• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 150
  • 54
  • 15
  • 13
  • 13
  • 7
  • 2
  • 2
  • 2
  • 1
  • 1
  • Tagged with
  • 303
  • 303
  • 119
  • 90
  • 73
  • 72
  • 70
  • 56
  • 46
  • 46
  • 46
  • 44
  • 43
  • 42
  • 42
  • 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.
61

An HMM/MRF-based stochastic framework for robust vehicle tracking

Kato, Jien, Watanabe, Toyohide, Joga, Sébastien, Ying, Liu, Hase, Hiroyuki, 加藤, ジェーン, 渡邉, 豊英 09 1900 (has links)
No description available.
62

Towards Scalable Analysis of Images and Videos

Zhao, Bin 01 September 2014 (has links)
With widespread availability of low-cost devices capable of photo shooting and high-volume video recording, we are facing explosion of both image and video data. The sheer volume of such visual data poses both challenges and opportunities in machine learning and computer vision research. In image classification, most of previous research has focused on small to mediumscale data sets, containing objects from dozens of categories. However, we could easily access images spreading thousands of categories. Unfortunately, despite the well-known advantages and recent advancements of multi-class classification techniques in machine learning, complexity concerns have driven most research on such super large-scale data set back to simple methods such as nearest neighbor search, one-vs-one or one-vs-rest approach. However, facing image classification problem with such huge task space, it is no surprise that these classical algorithms, often favored for their simplicity, will be brought to their knees not only because of the training time and storage cost they incur, but also because of the conceptual awkwardness of such algorithms in massive multi-class paradigms. Therefore, it is our goal to directly address the bigness of image data, not only the large number of training images and high-dimensional image features, but also the large task space. Specifically, we present algorithms capable of efficiently and effectively training classifiers that could differentiate tens of thousands of image classes. Similar to images, one of the major difficulties in video analysis is also the huge amount of data, in the sense that videos could be hours long or even endless. However, it is often true that only a small portion of video contains important information. Consequently, algorithms that could automatically detect unusual events within streaming or archival video would significantly improve the efficiency of video analysis and save valuable human attention for only the most salient contents. Moreover, given lengthy recorded videos, such as those captured by digital cameras on mobile phones, or surveillance cameras, most users do not have the time or energy to edit the video such that only the most salient and interesting part of the original video is kept. To this end, we also develop algorithm for automatic video summarization, without human intervention. Finally, we further extend our research on video summarization into a supervised formulation, where users are asked to generate summaries for a subset of a class of videos of similar nature. Given such manually generated summaries, our algorithm learns the preferred storyline within the given class of videos, and automatically generates summaries for the rest of videos in the class, capturing the similar storyline as in those manually summarized videos.
63

Introdução de dados auxiliares na classificação de imagens digitais de sensoriamento remoto aplicando conceitos da teoria da evidência

Lersch, Rodrigo Pereira January 2008 (has links)
Nesta tese investiga-se uma nova abordagem visando implementar os conceitos propostos na Teoria da Evidencia para fins de classificação de imagens digitais em Sensoriamento Remoto. Propõe-se aqui a utilização de variáveis auxiliares, estruturadas na forma de Planos de Informação (P.I.s) como em um SIG para gerar dados de confiança e de plausibilidade. São então aplicados limiares aos dados de confiança e de plausibilidade, com a finalidade de detectar erros de inclusão e de omissão, respectivamente, na imagem temática. Propõe-se nesta tese que estes dois limiares sejam estimados em função das acurácias do usuário e do produtor. A metodologia proposta nesta tese foi testada em uma área teste, coberta pela classe Mata Nativa com Araucária. O experimento mostrou que a metodologia aqui proposta atinge seus objetivos. / In this thesis we investigate a new approach to implement concepts developed by the Theory of Evidence to Remote Sensing digital image classification. In the proposed approach auxiliary variables are structured as layers in a GIS-like format to produce layers of belief and plausibility. Thresholds are applied to the layers of belief and plausibility to detect errors of commission and omission, respectively on the thematic image. The thresholds are estimated as functions of the user’s and producer’s accuracy. Preliminary tests were performed over an area covered by natural forest with Araucaria, showing some promising results.
64

Variational approximation of interface energies and applications / Approximation variationnelle d'énergies d'interface et applications

Zabiba, Mohammed 21 September 2017 (has links)
Les problèmes de partition minimale consistent à déterminer une partition d’un domaine en un nombre donné de composantes de manière à minimiser un critère géométrique. Dans les champs d’application tels que le traitement d’images et la mécanique des milieux continus, il est courant d’incorporer dans cet objectif une énergie d’interface qui prend en compte les longueurs des interfaces entre composantes. Ce travail est focalisé sur le traitement théorique et numérique de problèmes de partition minimale avec énergie d’interface. L’approche considérée est basée sur une approximation par Gamma-convergence et des techniques de dualité. / Minimal partition problems consist in finding a partition of a domain into a given number of components in order to minimize a geometric criterion. In applicative fields such as image processing or continuum mechanics, it is standard to incorporate in this objective an interface energy that accounts for the lengths of the interfaces between components. The present work is focused on thetheoretical and numerical treatment of minimal partition problems with interface energies. The considered approach is based on a Gamma-convergence approximation and duality techniques.
65

Análise temporal de índices de vegetação no apoio à classificação de imagens: cobertura do solo na bacia hidrográfica do Rio Sucuru.

SILVA, João Nailson de Castro. 12 September 2018 (has links)
Submitted by Lucienne Costa (lucienneferreira@ufcg.edu.br) on 2018-09-12T19:09:12Z No. of bitstreams: 1 JOÃO NAILSON DE CASTRO SILVA – DISSERTAÇÃO (PPGRN) 2017.pdf: 6066847 bytes, checksum: 06d6d215ba35522ddc64fb5c435d43f4 (MD5) / Made available in DSpace on 2018-09-12T19:09:12Z (GMT). No. of bitstreams: 1 JOÃO NAILSON DE CASTRO SILVA – DISSERTAÇÃO (PPGRN) 2017.pdf: 6066847 bytes, checksum: 06d6d215ba35522ddc64fb5c435d43f4 (MD5) Previous issue date: 2017-08-25 / Capes / A Caatinga é um bioma único que só ocorre na região do Semiárido do Brasil (SAB). Este bioma se diferencia principalmente pela capacidade de desenvolver mecanismos de adaptação aos baixos índices pluviométricos da região, além de apresentar alta resiliência nesse ambiente de elevada pressão antrópica. Tendo em vista que a cobertura vegetal exerce um papel muito importante no equilíbrio ambiental, as técnicas de sensoriamento remoto têm sido muito utilizadas para extrair informações biofísicas da vegetação. Este trabalho, teve como objetivo estabelecer uma metodologia que incorpore a capacidade de caracterização temporal do índice de vegetação à técnica de classificação de imagens para melhorar a identificação das classes de cobertura da Terra na bacia do Rio Sucuru, no Cariri paraibano. Neste sentido, busca-se uma classificação de referência dos padrões de cobertura da terra a partir de imagens de SR, para um período específico, no qual, seja possível uma validação em campo. Além disso, é realizada uma avaliação de uma série temporal de um índice de vegetação para melhoria da classificação realizada. Nessa pesquisa foi adotado parte da metodologia proposta por Chaves et al. (2008), para classificar os padrões de cobertura do solo e uma série temporal de EVI, processadas com 88 imagens selecionadas dos sensores ETM+ e OLI/TIRS, da série Landsat, para o período entre outubro de 2014 a setembro de 2016. Os resultados evidenciaram que analisar a cobertura vegetal utilizando apenas um único momento não retrata fidedignamente os padrões de cobertura do solo, visto que nesse ambiente semiárido as respostas que a vegetação apresenta diante da presença ou ausência de chuva são muito rápidas. Nesse sentido, os resultados mostram que uma análise espaço-temporal, utilizando um índice de vegetação, pode estabelecer uma melhor distinção das categorias atribuídas em uma classificação de padrões de cobertura do solo, possibilitando uma melhor percepção do comportamento da vegetação para um período de 24 meses observado. / The Caatinga is a unique biome that only occurs in the semi-arid region of Brazil. This biome is distinguished, mainly, by the capacity to develop mechanisms of adaptation to the low rainfall rates of the region. Plus, it also has a high resilience level upon high anthropic pressure. Considering that land cover plays a very important role in environmental balance, remote sensing techniques have been widely used to extract biophysical information from vegetation. The objective of this work is to establish a methodology that incorporates a time series vegetation index characterization to the image classification technique for improving the land cover classification in the Sucuru River basin in Cariri, Paraíba. In this sense, a Land Cover classification is acquired from SR images, for a specific data. For this data, there is a ground truth validation. In addition, an evaluation of a vegetation index time series is performed to improve the classification. In this research was adopted part of the methodology proposed by Chaves et al. (2008), to classify land cover patterns and a time series of EVI, processed with 88 images selected from the ETM + and OLI / TIRS sensors of the Landsat series for the period between October 2014 to September 2016. The results evidence that analyzing the land cover for a single time stamp could not reliably portray the land cover patterns since we often have fast changes before and after a rainfall event in this semi-arid environment. In this sense, the results show that a spatiotemporal analysis, using a vegetation index, can establish a better distinction of the categories assigned to a classification of land cover patterns, allowing a better perception of vegetation behavior for a period of 24 Months observed.
66

Introdução de dados auxiliares na classificação de imagens digitais de sensoriamento remoto aplicando conceitos da teoria da evidência

Lersch, Rodrigo Pereira January 2008 (has links)
Nesta tese investiga-se uma nova abordagem visando implementar os conceitos propostos na Teoria da Evidencia para fins de classificação de imagens digitais em Sensoriamento Remoto. Propõe-se aqui a utilização de variáveis auxiliares, estruturadas na forma de Planos de Informação (P.I.s) como em um SIG para gerar dados de confiança e de plausibilidade. São então aplicados limiares aos dados de confiança e de plausibilidade, com a finalidade de detectar erros de inclusão e de omissão, respectivamente, na imagem temática. Propõe-se nesta tese que estes dois limiares sejam estimados em função das acurácias do usuário e do produtor. A metodologia proposta nesta tese foi testada em uma área teste, coberta pela classe Mata Nativa com Araucária. O experimento mostrou que a metodologia aqui proposta atinge seus objetivos. / In this thesis we investigate a new approach to implement concepts developed by the Theory of Evidence to Remote Sensing digital image classification. In the proposed approach auxiliary variables are structured as layers in a GIS-like format to produce layers of belief and plausibility. Thresholds are applied to the layers of belief and plausibility to detect errors of commission and omission, respectively on the thematic image. The thresholds are estimated as functions of the user’s and producer’s accuracy. Preliminary tests were performed over an area covered by natural forest with Araucaria, showing some promising results.
67

Object detection in refrigerators using Tensorflow

Agarwal, Kirti 02 January 2019 (has links)
Object Detection is widely used in many applications such as face detection, detecting vehicles and pedestrians on streets, and autonomous vehicles. Object detection not only includes recognizing and classifying objects in an image, but also localizes those objects and draws bounding boxes around them. Therefore, most of the successful object detection networks make use of neural network based image classifiers in conjunction with object detection techniques. Tensorflow Object Detection API, an open source framework based on Google's TensorFlow, allows us to create, train and deploy object detection models. This thesis mainly focuses on detecting objects kept in a refrigerator. To facilitate the object detection in a refrigerator, we have used Tensorflow Object Detection API to train and evaluate models such as SSD-MobileNet-v2, Faster R-CNN-ResNet-101, and R-FCN-ResNet-101. The models are tested as a) a pre-trained model and b) a fine-tuned model devised by fine-tuning the existing models with a training dataset for eight food classes extracted from the ImageNet database. The models are evaluated on a test dataset for the same eight classes derived from the ImageNet database to infer which works best for our application. The results suggest that the performance of Faster R-CNN is the best on the test food dataset with a mAP score of 81.74%, followed by R-FCN with a mAP of 80.33% and SSD with a mAP of 76.39%. However, the time taken by SSD for detection is considerably less than the other two models which makes it a viable option for our objective. The results provide substantial evidence that the SSD model is the most suitable model for deploying object detection on mobile devices with an accuracy of 76.39%. Our methodology and results could potentially help other researchers to design a custom object detector and further enhance the precision for their datasets. / Graduate
68

Visual feature graphs and image recognition / Graphes d'attributs et reconnaissance d'images

Behmo, Régis 15 September 2010 (has links)
La problèmatique dont nous nous occupons dans cette thèse est la classification automatique d'images bidimensionnelles, ainsi que la détection d'objets génériques dans des images. Les avancées de ce champ de recherche contribuent à l'élaboration de systèmes intelligents, tels que des robots autonomes et la création d'un web sémantique. Dans ce contexte, la conception de représentations d'images et de classificateurs appropriés constituent des problèmes ambitieux. Notre travail de recherche fournit des solutions à ces deux problèmes, que sont la représentation et la classification d'images. Afin de générer notre représentation d'image, nous extrayons des attributs visuels de l'image et construisons une structure de graphe basée sur les propriétés liées au relations de proximités entre les points d'intérêt associés. Nous montrons que certaines propriétés spectrales de ces graphes constituent de bons invariants aux classes de transformations géométriques rigides. Notre représentation d'image est basée sur ces propriétés. Les résultats expérimentaux démontrent que cette représentation constitue une amélioration par rapport à d'autres représentations similaires, mais qui n'intègrent pas les informations liées à l'organisation spatiale des points d'intérêt. Cependant, un inconvénient de cette méthode est qu'elle fait appel à une quantification (avec pertes) de l'espace des attributs visuels afin d'être combinée avec un classificateur Support Vecteur Machine (SVM) efficace. Nous résolvons ce problème en créant un nouveau classificateur, basé sur la distance au plus proche voisin, et qui permet la classification d'objets assimilés à des ensembles de points. La linéarité de ce classificateur nous permet également de faire de la détection d'objet, en plus de la classification d'images. Une autre propriété intéressante de ce classificateur est sa capacité à combiner différents types d'attributs visuels de manière optimale. Nous utilisons cette propriété pour formuler le problème de classification de graphes de manière différente. Les expériences, menées sur une grande variété de jeux de données, montrent les bénéfices quantitatifs de notre approche. / We are concerned in this thesis by the problem of automated 2D image classification and general object detection. Advances in this field of research contribute to the elaboration of intelligent systems such as, but not limited to, autonomous robots and the semantic web. In this context, designing adequate image representations and classifiers for these representations constitute challenging issues. Our work provides innovative solutions to both these problems: image representation and classification. In order to generate our image representation, we extract visual features from the image and build a graphical structure based on properties of spatial proximity between the feature points. We show that certain spectral properties of this graph constitute good invariants to rigid geometric transforms. Our representation is based on these invariant properties. Experiments show that this representation constitutes an improvement over other similar representations that do not integrate the spatial layout of visual features. However, a drawback of this method is that it requires a lossy quantisation of the visual feature space in order to be combined with a state-of-the-art support vector machine (SVM) classifier. We address this issue by designing a new classifier. This generic classifier relies on a nearest-neighbour distance to classify objects that can be assimilated to feature sets, i.e: point clouds. The linearity of this classifier allows us to perform object detection, in addition to image classification. Another interesting property is its ability to combine different types of visual features in an optimal manner. We take advantage of this property to produce a new formulation for the classification of visual feature graphs. Experiments are conducted on a wide variety of publicly available datasets to justify the benefits of our approach.
69

Proposta de atualização de cadastro urbano a partir de detecção de alterações em imagens QUICK BIRD tomadas em diferentes épocas

Souza, Gabriel Gustavo Barros de [UNESP] 19 June 2009 (has links) (PDF)
Made available in DSpace on 2014-06-11T19:22:25Z (GMT). No. of bitstreams: 0 Previous issue date: 2009-06-19Bitstream added on 2014-06-13T18:49:02Z : No. of bitstreams: 1 souza_ggb_me_prud.pdf: 3569562 bytes, checksum: 1967b82d0ff7aaed4984bec889309e19 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / A atualização cadastral de área urbana é uma das questões mais importantes a ser considerada no planejamento municipal. Por esta área tratar de uma riqueza de detalhes acentuada, quando comparada as área rurais e de expansão urbana, torna-se difícil traçar uma metodologia de atualização de dados cadastrais que possa ser generalizada às áreas urbanas dos municípios. Isso não apenas em metodologia, mas para atender as necessidades e realidades que se deseja atualizar no Cadastro. Neste trabalho é apresentada uma proposta de atualização cadastral de área urbana a partir da utilização de imagens de satélite de alta resolução espacial (Quick Bird). São empregados, para isso, alguns métodos e técnicas nos processos de utilização das imagens adotadas. As imagens utilizadas abrangem a área teste, definida no município de Presidente Prudente. Para a detecção das alterações a serem atualizadas no banco de dados cadastrais foram utilizadas imagens pancromáticas e multiespectrais de épocas diferentes e empregaram-se técnicas de classificação de imagens para identificar e descrever visualmente os tipos de alvos alterados. De acordo com um limiar adotado, a partir das imagens e processos descritos, as alterações identificadas foram atualizadas no banco de dados cadastrais. As implicações para a seqüência adotada são apresentadas e discutidas nos capítulos desta pesquisa. / The urban cadastre updating is one of the most important questions about urban planning. In this area there are many details when compared to the rural area and urban expansion area that hinds the introduction cadastral updating approach could be generalized to urban areas. The demand of public administration and the reality of the cities must be considered in all process including Cadastre. In this work there is presented a urban area cadastral updating approach with the use of high resolution imagery (Quick Bird satellite). The methods and techniques are employed in the processes of use of the adopted images. The used images are of the city of Presidente Prudente. Images of different times were used for the change detection to be updated in the cadastral database. Image Classifications were used to identify and to describe visually the changes. In accordance with an adopted threshold, from the images and described processes, the identified changes were updated in the cadastral database. The implications for the adopted sequence are presented and discussed in the chapters of this report.
70

Image classification, storage and retrieval system for a 3 u cubesat

Gashayija, Jean Marie January 2014 (has links)
Thesis submitted in fulfillment of the requirements for the degree Master of Technology: Electrical Engineering in the Faculty of Engineering at the Cape Peninsula University of Technology / Small satellites, such as CubeSats are mainly utilized for space and earth imaging missions. Imaging CubeSats are equipped with high resolution cameras for the capturing of digital images, as well as mass storage devices for storing the images. The captured images are transmitted to the ground station and subsequently stored in a database. The main problem with stored images in a large image database, identified by researchers and developers within the last number of years, is the retrieval of precise, clear images and overcoming the semantic gap. The semantic gap relates to the lack of correlation between the semantic categories the user requires and the low level features that a content-based image retrieval system offers. Clear images are needed to be usable for applications such as mapping, disaster monitoring and town planning. The main objective of this thesis is the design and development of an image classification, storage and retrieval system for a CubeSat. This system enables efficient classification, storing and retrieval of images that are received on a daily basis from an in-orbit CubeSat. In order to propose such a system, a specific research methodology was chosen and adopted. This entails extensive literature reviews on image classification techniques and image feature extraction techniques, to extract content embedded within an image, and include studies on image database systems, data mining techniques and image retrieval techniques. The literature study led to a requirement analysis followed by the analyses of software development models in order to design the system. The proposed design entails classifying images using content embedded in the image and also extracting image metadata such as date and time. Specific features extraction techniques are needed to extract required content and metadata. In order to achieve extraction of information embedded in the image, colour feature (colour histogram), shape feature (Mathematical Morphology) and texture feature (GLCM) techniques were used. Other major contributions of this project include a graphical user interface which enables users to search for similar images against those stored in the database. An automatic image extractor algorithm was also designed to classify images according to date and time, and colour, texture and shape features extractor techniques were proposed. These ensured that when a user wishes to query the database, the shape objects, colour quantities and contrast contained in an image are extracted and compared to those stored in the database. Implementation and test results concluded that the designed system is able to categorize images automatically and at the same time provide efficient and accurate results. The features extracted for each image depend on colour, shape and texture methods. Optimal values were also incorporated in order to reduce retrieval times. The mathematical morphological technique was used to compute shape objects using erosion and dilation operators, and the co-occurrence matrix was used to compute the texture feature of the image.

Page generated in 0.1466 seconds