A Pochet Switched Network (PSN) is formed by users carrying portablehandheld devices such as smar... more A Pochet Switched Network (PSN) is formed by users carrying portablehandheld devices such as smartphones and tablets, which store messages, carry them from one point to another via physical movement, and forwards them when a communication opportunity arises. The success of the network thereby depends on the willingness of users to participate. PSN protocols tend to subject most of the routing burden on only a smaller set ofpopular nodes. This results in drastic resource consumption on popular nodes, and may eventually lead to user dissatisfaction, withdrawal, and performance degradation of the network. The key to ensuring fairness in PSN routing lies in the ability to estimate the burden on nodes, utilize this knowledge to provide an acceptably fair utilization of node resources, and evaluate the level of fairness achieved. This paper is concerned with measuring: (i) the burden routing impacts on nodes; and (ii) the fairness of routing algorithms based on the distribution of this bu...
In this work we solve a subproblem of the distance geometry problem in molecular conformation. Th... more In this work we solve a subproblem of the distance geometry problem in molecular conformation. The latter aims to determine the three-dimensional structure of a molecule from a set of imprecisely distances. We are interested only in the bound smoothing subproblem, which aims to tighten bounds from a set of lower and upper bounds on distance for pair of atoms. We apply a Biased Random-Key Genetic Algorithm to solve this subproblem, where each entry of chromosomes indicates how to decrease a bound, with the fitness function measuring the violation of the triangle inequalities. Experimental results show the effectiveness of this algorithm to solve randomly generated instances for which real distances between atoms are known
The Distance Geometry Problem (DGP) is defined as the problem of finding the spatial representati... more The Distance Geometry Problem (DGP) is defined as the problem of finding the spatial representation of a set of points, given the distances between them. An existing method in the literature that propose to solve this problem is the Stochastic Proximity Embedding (SPE), a simple, robust and self-organizing method that starts with an initial random configuration, selects pairs of points at random and adjust their distances based on a learning rate. The purpose is generate results that are close to the given set of relations between the objects. Therefore, this method is not fully effective to deal with uncertain distances, as expected in real world situation. The Molecular Distance Geometry Problem (MDGP) arises from the protein structure determination problem, and consists in finding Cartesian coordinates of the atoms in a molecule, based on the set of some interval distances obtained by Nuclear Magnetic Resonance (NMR). In this work, we propose a method to address the MDGP based on...
Anais do Simpósio Brasileiro de Sistemas de Informação (SBSI), 2015
Mineração de regras de associação tem mostrado grande potencial para extrair conhecimento de conj... more Mineração de regras de associação tem mostrado grande potencial para extrair conhecimento de conjunto de dados multidimensionais. Contudo, os métodos existentes na literatura não são efetivamente aplicáveis a dados temporais quantitativos. Este artigo estende os conceitos de mineração de regras de associação da literatura. Com base nestes conceitos é apresentado um método para mineração de regras de conjuntos de dados multidimensionais temporais quantitativos por meio de algoritmo genético, denominado GTARGA em referência à Quantitative Temporal Association Rule Mining by Genetic Algorithm. Experimentos com QTARGA em várias bases de dados reais mostram que este permite minerar várias regras de alta confiança em uma única execução do método.
Several areas of knowledge produce quantitative temporal data, which demand the development techn... more Several areas of knowledge produce quantitative temporal data, which demand the development techniques to identify patterns of them. Identification of emerging and decaying patterns are important in many applications because they can indicate trends that require decision-making or interventional measures. However, the literature have few researches about these kinds of patterns. This article proposes an approach for mining emerging and decaying patterns from quantitative temporal data sets using a genetic algorithm. Rules representing implications of temporal episodes are encoded into chromosomes of the genetic algorithm and these chromosomes are evolved by genetic operators. The quality of each chromosome is evaluated based on how exactly the occurrence frequency of a rule fits a straight line induced by linear regression. The decision whether the pattern is either emerging, decaying, or have no trend is taken based on the straight line slope and the regression coefficient. To prev...
The research project Mobile mEsh Network to Aid in CountEring drug TRAffiCKing (M.E.N.A.C.E-TRACK... more The research project Mobile mEsh Network to Aid in CountEring drug TRAffiCKing (M.E.N.A.C.E-TRACK) proposes the creation of a dynamic mesh network, intended to interconnect field personnel to a base of operations whenever possible. This type of network accepts the dynamic disconnection and reconnection of nodes. To configure a mesh node using, for instance, an access point, usually a modified firmware is needed. In this paper we present the first steps to build the M.E.N.A.C.E-TRACK infrastructure concerning the configuration of the access point, the chosen firmware and some configuration scenarios on an infra-structured network in order to demonstrate its flexibility.
Insects cause significant quantity and quality losses in stored grains. Producers are recommended... more Insects cause significant quantity and quality losses in stored grains. Producers are recommended to avoid excessive use of insecticides because they are harmful to living beings that consume the grains. Thus, it is of vital importance to early identify insects in grains to take control measures. Insects identification is usually done by collecting samples of grains from warehouses, followed by visual or laboratory analysis. However, this is a difficult and costly process. We propose to carry out this identification task automatically, using computational methods to perform endoscopic video analysis. The videos are recorded inside of grains warehouses by a endoscopic camera. As the classification process of moving objects in video depends fundamentally on precise segmentation of moving objets, we propose a new method of background subtraction and compared their results with the main methods of the literature according to a recent review. Experimental results show that the proposed m...
A recuperação baseada em forma pode ser realizada eficientemente através de saliências, já que es... more A recuperação baseada em forma pode ser realizada eficientemente através de saliências, já que este é um descritor robusto invariante à mudanças de escala, translações, rotações, etc. Para se obter as saliências, um método muito eficaz foi proposto recentemente: a Transformada Imagem Floresta (IFT). O objetivo de nosso trabalho é realizar a recuperação de informação baseada em saliência, utilizando a IFT, explorando o balanceamento entre a quantidade de detalhes e a preservação da propriedade de invariância, o que reflete imediatamente nas medidas de precisão x revocação. Alem disso, é objetivo encontrar o melhor valor representante para a saliência.
Resumo: Sistemas de recuperação de imagens por conteúdo (CBIR -Content-based Image Re-trieval) po... more Resumo: Sistemas de recuperação de imagens por conteúdo (CBIR -Content-based Image Re-trieval) possuem a habilidade de retornar as imagens mais similare a uma dada imagem con-sulta. Para isso, primeiro deve-se definir quais as características de baixo nível (cor, textura ou forma) devem ser analisadas nessa imagem. Neste trabalho, o objetivó e explorar o uso de pontos de saliência para representar formas. A idéiá e investigar esse método de representação em um banco de dados heterogêneo formado por diversos tipos de formas, contendo imagens com e sem ruídos e propor técnicas, tal como um algoritmo de extração de saliências robustò a ruídos e uma medida de similaridade eficiente que permita comparar dois objetos com número de saliências diferentes.
O crescente desenvolvimento da pesquisa no reconhecimento de face humana tem tido uma forte influ... more O crescente desenvolvimento da pesquisa no reconhecimento de face humana tem tido uma forte influência em várias aplicações comerciais, aplicações em identificação criminal e em sistemas de segurança. Vários algoritmos foram propostos a fim de resolver alguns desafios encontrados no sistema de recuperação, como variações de pose, iluminação, diferenças de idade, expressão facial e o método PCA – Principal Component Analysis – proposto por Turk e Pentland em 1991, é clássico no estudo de faces e tem como objetivo procurar as componentes principais da distribuição de faces ou os autovetores da matriz covariância do conjunto de faces. Cada autovetor representa a variação entre as faces e pode ser visto como um conjunto de características. Neste trabalho é avaliado o desempenho do método PCA em relação à iluminação. Também é avaliado como perturbações na imagem consulta, podem alterar os resultados da busca. Vários experimentos foram realizados e uma medida de precisão e revocação é cal...
Page 1. Weighted Variational Two-Phase Image Segmentation based on Fuzzy Region Competition Vinic... more Page 1. Weighted Variational Two-Phase Image Segmentation based on Fuzzy Region Competition Vinicius RP Borges∗, Celia A. Zorzo Barcelos§ and Denise Guliato‡ Federal University of Uberlandia Computer Faculty ∗ ‡, Mathematics ...
The goal of our work is to identify flow lines of moving objects in videos. These flows can then ... more The goal of our work is to identify flow lines of moving objects in videos. These flows can then be used to represent the underlying movement. Unlike studies using shape-based representations, this proposal uses all the image information to build denser flows for motion representation. We begin by segmenting each video frame into a large set of non-overlapping uniform-color regions called superpixels. These superpixels are then tracked over a number of frames to generate flow lines. The ideas reported in this work can be applied to the task of creating motion patterns, which in turn are important for identifying complex movements of objects and predict behavior. Experiments are performed on a set of synthetic and real-world motion sequences.
Page 1. Suspicious event recognition using infrared imagery Henrique C Fernandes Computer Science... more Page 1. Suspicious event recognition using infrared imagery Henrique C Fernandes Computer Science Departament Federal University of Uberlândia Uberlândia, Brazil henrique@mestrado.ufu.br Xavier Maldague Eletrical ...
In this paper, we explore a prelude implemen- tation for a portable wireless mesh network, intend... more In this paper, we explore a prelude implemen- tation for a portable wireless mesh network, intended to enable multimedia communication with no onsite infras- tructure. This is intended as a perimeter network for the fast and secure communication of devices (e.g. robots, IP cameras, notebooks, wifi sensors, etc.) in an environment with no network coverage (e.g. due to a natural disaster, as communication support during a sting operation etc). This kind of environment must be simple to configure, and it must support some kind of mesh network implementation for easy deployment. We estimate that by owning such communication infrastructure, for instance, law enforcement agencies would be able to perform a diverse scope of operations in an easy and efficient manner, preferably in the context of a MAN, which must be independent of landlines, and would allow for the transmission of multimedia data seamlessly (e.g. audio, video, GPS coordinates etc).
A Pochet Switched Network (PSN) is formed by users carrying portablehandheld devices such as smar... more A Pochet Switched Network (PSN) is formed by users carrying portablehandheld devices such as smartphones and tablets, which store messages, carry them from one point to another via physical movement, and forwards them when a communication opportunity arises. The success of the network thereby depends on the willingness of users to participate. PSN protocols tend to subject most of the routing burden on only a smaller set ofpopular nodes. This results in drastic resource consumption on popular nodes, and may eventually lead to user dissatisfaction, withdrawal, and performance degradation of the network. The key to ensuring fairness in PSN routing lies in the ability to estimate the burden on nodes, utilize this knowledge to provide an acceptably fair utilization of node resources, and evaluate the level of fairness achieved. This paper is concerned with measuring: (i) the burden routing impacts on nodes; and (ii) the fairness of routing algorithms based on the distribution of this bu...
In this work we solve a subproblem of the distance geometry problem in molecular conformation. Th... more In this work we solve a subproblem of the distance geometry problem in molecular conformation. The latter aims to determine the three-dimensional structure of a molecule from a set of imprecisely distances. We are interested only in the bound smoothing subproblem, which aims to tighten bounds from a set of lower and upper bounds on distance for pair of atoms. We apply a Biased Random-Key Genetic Algorithm to solve this subproblem, where each entry of chromosomes indicates how to decrease a bound, with the fitness function measuring the violation of the triangle inequalities. Experimental results show the effectiveness of this algorithm to solve randomly generated instances for which real distances between atoms are known
The Distance Geometry Problem (DGP) is defined as the problem of finding the spatial representati... more The Distance Geometry Problem (DGP) is defined as the problem of finding the spatial representation of a set of points, given the distances between them. An existing method in the literature that propose to solve this problem is the Stochastic Proximity Embedding (SPE), a simple, robust and self-organizing method that starts with an initial random configuration, selects pairs of points at random and adjust their distances based on a learning rate. The purpose is generate results that are close to the given set of relations between the objects. Therefore, this method is not fully effective to deal with uncertain distances, as expected in real world situation. The Molecular Distance Geometry Problem (MDGP) arises from the protein structure determination problem, and consists in finding Cartesian coordinates of the atoms in a molecule, based on the set of some interval distances obtained by Nuclear Magnetic Resonance (NMR). In this work, we propose a method to address the MDGP based on...
Anais do Simpósio Brasileiro de Sistemas de Informação (SBSI), 2015
Mineração de regras de associação tem mostrado grande potencial para extrair conhecimento de conj... more Mineração de regras de associação tem mostrado grande potencial para extrair conhecimento de conjunto de dados multidimensionais. Contudo, os métodos existentes na literatura não são efetivamente aplicáveis a dados temporais quantitativos. Este artigo estende os conceitos de mineração de regras de associação da literatura. Com base nestes conceitos é apresentado um método para mineração de regras de conjuntos de dados multidimensionais temporais quantitativos por meio de algoritmo genético, denominado GTARGA em referência à Quantitative Temporal Association Rule Mining by Genetic Algorithm. Experimentos com QTARGA em várias bases de dados reais mostram que este permite minerar várias regras de alta confiança em uma única execução do método.
Several areas of knowledge produce quantitative temporal data, which demand the development techn... more Several areas of knowledge produce quantitative temporal data, which demand the development techniques to identify patterns of them. Identification of emerging and decaying patterns are important in many applications because they can indicate trends that require decision-making or interventional measures. However, the literature have few researches about these kinds of patterns. This article proposes an approach for mining emerging and decaying patterns from quantitative temporal data sets using a genetic algorithm. Rules representing implications of temporal episodes are encoded into chromosomes of the genetic algorithm and these chromosomes are evolved by genetic operators. The quality of each chromosome is evaluated based on how exactly the occurrence frequency of a rule fits a straight line induced by linear regression. The decision whether the pattern is either emerging, decaying, or have no trend is taken based on the straight line slope and the regression coefficient. To prev...
The research project Mobile mEsh Network to Aid in CountEring drug TRAffiCKing (M.E.N.A.C.E-TRACK... more The research project Mobile mEsh Network to Aid in CountEring drug TRAffiCKing (M.E.N.A.C.E-TRACK) proposes the creation of a dynamic mesh network, intended to interconnect field personnel to a base of operations whenever possible. This type of network accepts the dynamic disconnection and reconnection of nodes. To configure a mesh node using, for instance, an access point, usually a modified firmware is needed. In this paper we present the first steps to build the M.E.N.A.C.E-TRACK infrastructure concerning the configuration of the access point, the chosen firmware and some configuration scenarios on an infra-structured network in order to demonstrate its flexibility.
Insects cause significant quantity and quality losses in stored grains. Producers are recommended... more Insects cause significant quantity and quality losses in stored grains. Producers are recommended to avoid excessive use of insecticides because they are harmful to living beings that consume the grains. Thus, it is of vital importance to early identify insects in grains to take control measures. Insects identification is usually done by collecting samples of grains from warehouses, followed by visual or laboratory analysis. However, this is a difficult and costly process. We propose to carry out this identification task automatically, using computational methods to perform endoscopic video analysis. The videos are recorded inside of grains warehouses by a endoscopic camera. As the classification process of moving objects in video depends fundamentally on precise segmentation of moving objets, we propose a new method of background subtraction and compared their results with the main methods of the literature according to a recent review. Experimental results show that the proposed m...
A recuperação baseada em forma pode ser realizada eficientemente através de saliências, já que es... more A recuperação baseada em forma pode ser realizada eficientemente através de saliências, já que este é um descritor robusto invariante à mudanças de escala, translações, rotações, etc. Para se obter as saliências, um método muito eficaz foi proposto recentemente: a Transformada Imagem Floresta (IFT). O objetivo de nosso trabalho é realizar a recuperação de informação baseada em saliência, utilizando a IFT, explorando o balanceamento entre a quantidade de detalhes e a preservação da propriedade de invariância, o que reflete imediatamente nas medidas de precisão x revocação. Alem disso, é objetivo encontrar o melhor valor representante para a saliência.
Resumo: Sistemas de recuperação de imagens por conteúdo (CBIR -Content-based Image Re-trieval) po... more Resumo: Sistemas de recuperação de imagens por conteúdo (CBIR -Content-based Image Re-trieval) possuem a habilidade de retornar as imagens mais similare a uma dada imagem con-sulta. Para isso, primeiro deve-se definir quais as características de baixo nível (cor, textura ou forma) devem ser analisadas nessa imagem. Neste trabalho, o objetivó e explorar o uso de pontos de saliência para representar formas. A idéiá e investigar esse método de representação em um banco de dados heterogêneo formado por diversos tipos de formas, contendo imagens com e sem ruídos e propor técnicas, tal como um algoritmo de extração de saliências robustò a ruídos e uma medida de similaridade eficiente que permita comparar dois objetos com número de saliências diferentes.
O crescente desenvolvimento da pesquisa no reconhecimento de face humana tem tido uma forte influ... more O crescente desenvolvimento da pesquisa no reconhecimento de face humana tem tido uma forte influência em várias aplicações comerciais, aplicações em identificação criminal e em sistemas de segurança. Vários algoritmos foram propostos a fim de resolver alguns desafios encontrados no sistema de recuperação, como variações de pose, iluminação, diferenças de idade, expressão facial e o método PCA – Principal Component Analysis – proposto por Turk e Pentland em 1991, é clássico no estudo de faces e tem como objetivo procurar as componentes principais da distribuição de faces ou os autovetores da matriz covariância do conjunto de faces. Cada autovetor representa a variação entre as faces e pode ser visto como um conjunto de características. Neste trabalho é avaliado o desempenho do método PCA em relação à iluminação. Também é avaliado como perturbações na imagem consulta, podem alterar os resultados da busca. Vários experimentos foram realizados e uma medida de precisão e revocação é cal...
Page 1. Weighted Variational Two-Phase Image Segmentation based on Fuzzy Region Competition Vinic... more Page 1. Weighted Variational Two-Phase Image Segmentation based on Fuzzy Region Competition Vinicius RP Borges∗, Celia A. Zorzo Barcelos§ and Denise Guliato‡ Federal University of Uberlandia Computer Faculty ∗ ‡, Mathematics ...
The goal of our work is to identify flow lines of moving objects in videos. These flows can then ... more The goal of our work is to identify flow lines of moving objects in videos. These flows can then be used to represent the underlying movement. Unlike studies using shape-based representations, this proposal uses all the image information to build denser flows for motion representation. We begin by segmenting each video frame into a large set of non-overlapping uniform-color regions called superpixels. These superpixels are then tracked over a number of frames to generate flow lines. The ideas reported in this work can be applied to the task of creating motion patterns, which in turn are important for identifying complex movements of objects and predict behavior. Experiments are performed on a set of synthetic and real-world motion sequences.
Page 1. Suspicious event recognition using infrared imagery Henrique C Fernandes Computer Science... more Page 1. Suspicious event recognition using infrared imagery Henrique C Fernandes Computer Science Departament Federal University of Uberlândia Uberlândia, Brazil henrique@mestrado.ufu.br Xavier Maldague Eletrical ...
In this paper, we explore a prelude implemen- tation for a portable wireless mesh network, intend... more In this paper, we explore a prelude implemen- tation for a portable wireless mesh network, intended to enable multimedia communication with no onsite infras- tructure. This is intended as a perimeter network for the fast and secure communication of devices (e.g. robots, IP cameras, notebooks, wifi sensors, etc.) in an environment with no network coverage (e.g. due to a natural disaster, as communication support during a sting operation etc). This kind of environment must be simple to configure, and it must support some kind of mesh network implementation for easy deployment. We estimate that by owning such communication infrastructure, for instance, law enforcement agencies would be able to perform a diverse scope of operations in an easy and efficient manner, preferably in the context of a MAN, which must be independent of landlines, and would allow for the transmission of multimedia data seamlessly (e.g. audio, video, GPS coordinates etc).
Uploads
Papers by Marcos Batista