Desenvolvimento de um Sistema de Visão Global para uma Frota de Mini-Robôs Móveis

Navigation based on visual feedback for robots, working in a closed environment, can be obtained settling a camera in each robot (local vision system). However, this solution requests a camera and capacity of local processing for each robot. When possible, a global vision system is a cheapest solution for this problem. In this case, one or a little amount of cameras, covering all the workspace, can be shared by the entire team of robots, saving the cost of a great amount of cameras and the associated processing hardware needed in a local vision system. This work presents the implementation and experimental results of a global vision system for mobile mini-robots, using robot soccer as test platform. The proposed vision system consists of a camera, a frame grabber and a computer (PC) for image processing. The PC is responsible for the team motion control, based on the visual feedback, sending commands to the robots through a radio link. In order for the system to be able to unequivocally recognize each robot, each one has a label on its top, consisting of two colored circles. Image processing algorithms were developed for the eficient computation, in real time, of all objects position (robot and ball) and orientation (robot). A great problem found was to label the color, in real time, of each colored point of the image, in time-varying illumination conditions. To overcome this problem, an automatic camera calibration, based on clustering K-means algorithm, was implemented. This method guarantees that similar pixels will be clustered around a unique color class. The obtained experimental results shown that the position and orientation of each robot can be obtained with a precision of few millimeters. The updating of the position and orientation was attained in real time, analyzing 30 frames per second

Compressão Seletiva de Imagens Coloridas com Detecção Automática de Regiões de Interesse

There has been an increasing tendency on the use of selective image compression, since several applications make use of digital images and the loss of information in certain regions is not allowed in some cases. However, there are applications in which these images are captured and stored automatically making it impossible to the user to select the regions of interest to be compressed in a lossless manner. A possible solution for this matter would be the automatic selection of these regions, a very difficult problem to solve in general cases. Nevertheless, it is possible to use intelligent techniques to detect these regions in specific cases. This work proposes a selective color image compression method in which regions of interest, previously chosen, are compressed in a lossless manner. This method uses the wavelet transform to decorrelate the pixels of the image, competitive neural network to make a vectorial quantization, mathematical morphology, and Huffman adaptive coding. There are two options for automatic detection in addition to the manual one: a method of texture segmentation, in which the highest frequency texture is selected to be the region of interest, and a new face detection method where the region of the face will be lossless compressed. The results show that both can be successfully used with the compression method, giving the map of the region of interest as an input

Human face verification based on multidimensional Polynomial Powers of Sigmoid (PPS)

In this paper, we described how a multidimensional wavelet neural networks based on Polynomial Powers of Sigmoid (PPS) can be constructed, trained and applied in image processing tasks. In this sense, a novel and uniform framework for face verification is presented. The framework is based on a family of PPS wavelets,generated from linear combination of the sigmoid functions, and can be considered appearance based in that features are extracted from the face image. The feature vectors are then subjected to subspace projection of PPS-wavelet. The design of PPS-wavelet neural networks is also discussed, which is seldom reported in the literature. The Stirling Universitys face database were used to generate the results. Our method has achieved 92 % of correct detection and 5 % of false detection rate on the database.

Comparison of fracture surface and plane section analysis for ceramic grain size characterisation

A method has been developed to obtain quantitative information about grain size and shape from fractured surfaces of ceramic materials. One elaborated a routine to split intergranular and transgranular grains facets of ceramic fracture surfaces by digital image processing. A commercial ceramic (ALCOA A-16, Al2O3-1.5% of CrO) was used to test the proposed method. Microstructural measurements of grain shape and size taken from fracture surfaces have been compared through descriptive statistics of distributions, with the corresponding measurements from polished and etched surfaces. The agreement between results, with the expected bias on grain size values from fractures, obtained for both types of surfaces allowed to infer that this new technique can be used to extract the relevant microstructural information from fractured surfaces, thus minimising the time consuming steps of sample preparation. (C) 2003 Elsevier Ltd. All rights reserved.

Boundary identification criteria and geometry analysis of Al 7050 stretch zone from elevation profiles

This article describes the development of a method for analysis of the shape of the stretch zone surface based on parallax measurement theory and using digital image processing techniques. Accurate criteria for the definition of the boundaries of the stretch zone are established from profiles of fracture surfaces obtained from crack tip opening displacement tests on Al-7050 alloy samples. The elevation profiles behavior analysis is based on stretch zone width and height parameters. It is concluded that the geometry of the stretch zone profiles under plane strain conditions can be described by a semi-parabolic relationship. (C) Elsevier B.V., 1999. All rights reserved.

Fractal behavior throughout stretch zone of 15-5PH steel under elastic-plastic loading conditions

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Extended depth from focus reconstruction using NIH ImageJ plugins: Quality and resolution of elevation maps

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

3-D reconstruction by extended depth-of-field in failure analysis - Case study I: Qualitative fractographic investigation of fractured bolts in a partial valve

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Sistemas distribuídos aplicados à compressão e recuperação de imagens

Digital image processing is a field that demands great processing capacity. As such it becomes relevant to implement software that is based on the distribution of the processing into several nodes divided by computers belonging to the same network. Specifically discussed in this work are distributed algorithms of compression and expansion of images using the discrete cosine transform. The results show that the savings in processing time obtained due to the parallel algorithms in comparison to its sequential equivalents is a function that depends on the resolution of the image and the complexity of the involved calculation; that is efficiency is greater the longer the processing period is in terms of the time involved for the communication between the network points.

Uma nova forma de calcular os centros dos Clusters em algoritmos de agrupamento tipo fuzzy c-means

Clustering data is a very important task in data mining, image processing and pattern recognition problems. One of the most popular clustering algorithms is the Fuzzy C-Means (FCM). This thesis proposes to implement a new way of calculating the cluster centers in the procedure of FCM algorithm which are called ckMeans, and in some variants of FCM, in particular, here we apply it for those variants that use other distances. The goal of this change is to reduce the number of iterations and processing time of these algorithms without affecting the quality of the partition, or even to improve the number of correct classifications in some cases. Also, we developed an algorithm based on ckMeans to manipulate interval data considering interval membership degrees. This algorithm allows the representation of data without converting interval data into punctual ones, as it happens to other extensions of FCM that deal with interval data. In order to validate the proposed methodologies it was made a comparison between a clustering for ckMeans, K-Means and FCM algorithms (since the algorithm proposed in this paper to calculate the centers is similar to the K-Means) considering three different distances. We used several known databases. In this case, the results of Interval ckMeans were compared with the results of other clustering algorithms when applied to an interval database with minimum and maximum temperature of the month for a given year, referring to 37 cities distributed across continents

Utilizando mapas de conectividade fuzzy no desenvolvimento de algoritmos reparadores de imagens binárias 3D

A 3D binary image is considered well-composed if, and only if, the union of the faces shared by the foreground and background voxels of the image is a surface in R3. Wellcomposed images have some desirable topological properties, which allow us to simplify and optimize algorithms that are widely used in computer graphics, computer vision and image processing. These advantages have fostered the development of algorithms to repair bi-dimensional (2D) and three-dimensional (3D) images that are not well-composed. These algorithms are known as repairing algorithms. In this dissertation, we propose two repairing algorithms, one randomized and one deterministic. Both algorithms are capable of making topological repairs in 3D binary images, producing well-composed images similar to the original images. The key idea behind both algorithms is to iteratively change the assigned color of some points in the input image from 0 (background)to 1 (foreground) until the image becomes well-composed. The points whose colors are changed by the algorithms are chosen according to their values in the fuzzy connectivity map resulting from the image segmentation process. The use of the fuzzy connectivity map ensures that a subset of points chosen by the algorithm at any given iteration is the one with the least affinity with the background among all possible choices

Novos métodos determinísticos para gerar centros iniciais dos grupos no algoritmo fuzzy C-Means e variantes

Data clustering is applied to various fields such as data mining, image processing and pattern recognition technique. Clustering algorithms splits a data set into clusters such that elements within the same cluster have a high degree of similarity, while elements belonging to different clusters have a high degree of dissimilarity. The Fuzzy C-Means Algorithm (FCM) is a fuzzy clustering algorithm most used and discussed in the literature. The performance of the FCM is strongly affected by the selection of the initial centers of the clusters. Therefore, the choice of a good set of initial cluster centers is very important for the performance of the algorithm. However, in FCM, the choice of initial centers is made randomly, making it difficult to find a good set. This paper proposes three new methods to obtain initial cluster centers, deterministically, the FCM algorithm, and can also be used in variants of the FCM. In this work these initialization methods were applied in variant ckMeans.With the proposed methods, we intend to obtain a set of initial centers which are close to the real cluster centers. With these new approaches startup if you want to reduce the number of iterations to converge these algorithms and processing time without affecting the quality of the cluster or even improve the quality in some cases. Accordingly, cluster validation indices were used to measure the quality of the clusters obtained by the modified FCM and ckMeans algorithms with the proposed initialization methods when applied to various data sets

Segmentação fuzzy de imagens e vídeos

Image segmentation is the process of subdiving an image into constituent regions or objects that have similar features. In video segmentation, more than subdividing the frames in object that have similar features, there is a consistency requirement among segmentations of successive frames of the video. Fuzzy segmentation is a region growing technique that assigns to each element in an image (which may have been corrupted by noise and/or shading) a grade of membership between 0 and 1 to an object. In this work we present an application that uses a fuzzy segmentation algorithm to identify and select particles in micrographs and an extension of the algorithm to perform video segmentation. Here, we treat a video shot is treated as a three-dimensional volume with different z slices being occupied by different frames of the video shot. The volume is interactively segmented based on selected seed elements, that will determine the affinity functions based on their motion and color properties. The color information can be extracted from a specific color space or from three channels of a set of color models that are selected based on the correlation of the information from all channels. The motion information is provided into the form of dense optical flows maps. Finally, segmentation of real and synthetic videos and their application in a non-photorealistic rendering (NPR) toll are presented

Condicionamento estrutural das zonasa de cisalhamento da região de Forquilha, domínio Ceará Central: uma abordagem integrada de sensoriamento remoto e geologia estrutural

The studied region, named Forquilha and localized in northwestern Central Ceará domain (northern portion of Borborema Province), presents a lithostratigraphic framework constituted by paleoproterozoic metaplutonics, metasedimentary sequences and neoproterozoic granitoids. The metasedimentary rocks of Ceará group occupy most part of the area. This group is subdivided in two distinct units: Canindé and Independência. Canindé unit is represented basically by biotite paragneisses and muscovite paragneisses, with minor metabasic rocks (amphibolite lens). Independência sequence is composed by garnetiferous paragneisses, sillimanite-garnet-quartz-muscovite schists and quartz-muscovite schists, pure or muscovite quartzites and rare marbles. At least three ductile deformation events were recognized in both units of Ceará group, named D1, D2 and D3. The former one is interpreted as related to a low angle tangential tectonics which mass transport is southward. D2 event is marked by the development of close/isoclinal folds with a N-S oriented axis. Refolding patterns generated by F1 and F2 superposition are found in several places. The latest event (D3) corresponds to a transcurrent tectonics, which led to development of mega-folds and several shear zones, under a transpressional regime. The mapped shear zones are Humberto Monte (ZCHM), Poço Cercado (ZCPC) and Forquilha (ZCF). Digital image processing of enhanced Landsat 7-ETM+ satellite images, combined with field data, demonstrate that these penetrative structures are associated with positive and negative geomorphologic patterns, distributed in linear and curvilinear arrangements with tonal banding, corresponding to the ductile fabric and to crests. Diverse color composites were tested and RGB-531 and RGB-752 provided the best results for lineament analysis of the most prominent shear zones. Spatial filtering techniques (3x3 and 5x5 filters) were also used and the application of Prewitt filters generated the best products. The integrated analysis of morphological and textural aspects from filtered images, variation of tonalities related to the distribution of geologic units in color composites and the superposition over a digital elevation model, contributed to a characterization of the structural framework of the study area. Kinematic compatibility of ZCHM, ZCPC, ZCF shear zones, as well as Sobral-Pedro II (ZCSPII) shear zone, situated to the west of the study area, was one of the goal of this work. Two of these shear zones (ZCHM, ZCPC) display sinistral movements, while the others (ZCSPII, ZCF) exhibit dextral kinematics. 40Ar/39Ar ages obtained in this thesis for ZCSPII and ZCPC, associated with other 40Ar/39Ar data of adjacent areas, indicate that all these shear zones are related to Brasiliano orogeny. The trend of the structures, the opposite shear senses and the similar metamorphic conditions are fitted in a model based on the development of conjugate shear zones in an unconfined transpression area. A WNW-ESE bulk shortening direction is infered. The geometry and kinematic of the studied structures suggest that shortening was largely accommodated by lateral extrusion, with only minor amounts of vertical stretch

Sistema não-Intrusivo para Estimação da Direção do olhar utilizando redes neurais artificiais

The fundamental senses of the human body are: vision, hearing, touch, taste and smell. These senses are the functions that provide our relationship with the environment. The vision serves as a sensory receptor responsible for obtaining information from the outside world that will be sent to the brain. The gaze reflects its attention, intention and interest. Therefore, the estimation of gaze direction, using computer tools, provides a promising alternative to improve the capacity of human-computer interaction, mainly with respect to those people who suffer from motor deficiencies. Thus, the objective of this work is to present a non-intrusive system that basically uses a personal computer and a low cost webcam, combined with the use of digital image processing techniques, Wavelets transforms and pattern recognition, such as artificial neural network models, resulting in a complete system that performs since the image acquisition (including face detection and eye tracking) to the estimation of gaze direction. The obtained results show the feasibility of the proposed system, as well as several feature advantages.