Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121745
F. Ababsa, Imane M. Zendjebil, Jean-Yves Didier, M. Mallem
3D camera tracking is an important issue for many kinds of applications such as augmented reality and robotics navigation. When image sequences are used, tracking needs to be initialized by matching 2D data extracted from images with 3D data representing a priori knowledge of the world. However, this process is difficult and the accuracy of the pose estimation strongly depends on the accuracy of the previous matching step. In this paper, we present two original approaches that achieve a 2D/3D points-based matching in order to initialize the 3D camera tracking. The first one is semi-automatic and requires the intervention of the user. The second one is completely automatic. Both approaches are based on SURF descriptors, which have the advantages of being fast and robust against outliers. A description of these two approaches is given and results obtained from experiments performed on real data are exposed and discussed.
{"title":"Efficient initialization schemes for real-time 3D camera tracking using image sequences","authors":"F. Ababsa, Imane M. Zendjebil, Jean-Yves Didier, M. Mallem","doi":"10.1109/ISDA.2011.6121745","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121745","url":null,"abstract":"3D camera tracking is an important issue for many kinds of applications such as augmented reality and robotics navigation. When image sequences are used, tracking needs to be initialized by matching 2D data extracted from images with 3D data representing a priori knowledge of the world. However, this process is difficult and the accuracy of the pose estimation strongly depends on the accuracy of the previous matching step. In this paper, we present two original approaches that achieve a 2D/3D points-based matching in order to initialize the 3D camera tracking. The first one is semi-automatic and requires the intervention of the user. The second one is completely automatic. Both approaches are based on SURF descriptors, which have the advantages of being fast and robust against outliers. A description of these two approaches is given and results obtained from experiments performed on real data are exposed and discussed.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132836230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121800
N. Díaz-Díaz, Francisco Gómez-Vela, J. Aguilar-Ruiz, Jorge García-Gutiérrez
In this paper, we propose a greedy clustering algorithm to identify groups of related genes and a new measure to improve the results of this algorithm. Clustering algorithms analyze genes in order to group those with similar behavior. Instead, our approach groups pairs of genes that present similar positive and/or negative interactions. In order to avoid noise in clusters, we apply a threshold, the neighbouring minimun index(λ), to know if a pair of genes have interaction enough or not. The algorithm allows the researcher to modify all the criteria: discretization mapping function, gene — gene mapping function and filtering function, and even the neighbouring minimun index, and provides much flexibility to obtain clusters based on the level of precision needed. We have carried out a deep experimental study in databases to obtain a good neighbouring minimun index, λ. The performance of our approach is experimentally tested on the yeast, yeast cell-cycle and malaria datasets. The final number of clusters has a very high level of customization and genes within show a significant level of cohesion, as it is shown graphically in the experiments.
{"title":"Gene-gene interaction based clustering method for microarray data","authors":"N. Díaz-Díaz, Francisco Gómez-Vela, J. Aguilar-Ruiz, Jorge García-Gutiérrez","doi":"10.1109/ISDA.2011.6121800","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121800","url":null,"abstract":"In this paper, we propose a greedy clustering algorithm to identify groups of related genes and a new measure to improve the results of this algorithm. Clustering algorithms analyze genes in order to group those with similar behavior. Instead, our approach groups pairs of genes that present similar positive and/or negative interactions. In order to avoid noise in clusters, we apply a threshold, the neighbouring minimun index(λ), to know if a pair of genes have interaction enough or not. The algorithm allows the researcher to modify all the criteria: discretization mapping function, gene — gene mapping function and filtering function, and even the neighbouring minimun index, and provides much flexibility to obtain clusters based on the level of precision needed. We have carried out a deep experimental study in databases to obtain a good neighbouring minimun index, λ. The performance of our approach is experimentally tested on the yeast, yeast cell-cycle and malaria datasets. The final number of clusters has a very high level of customization and genes within show a significant level of cohesion, as it is shown graphically in the experiments.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133384384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121716
G. Dubus, Fabrice Popineau, Yolaine Bourda
Personalized systems are a response to the increasing number of resources on the Internet, but can be difficult to create. In order to facilitate the design and creation of such personalized systems, we aim at formalizing them. The situation calculus is a logical framework that has often been proposed to model web applications and even personalized ones. However, the details of its use are much more rarely explained. In this paper we will show that it is needed to carefully consider which variant of the situation calculus to choose. We will precisely show why we want to use the so-called guarded action theories. We explain why and how it fits into an architecture. We introduce two scenarios of personalized applications to illustrate this choice.
{"title":"Situation calculus and personalized web systems","authors":"G. Dubus, Fabrice Popineau, Yolaine Bourda","doi":"10.1109/ISDA.2011.6121716","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121716","url":null,"abstract":"Personalized systems are a response to the increasing number of resources on the Internet, but can be difficult to create. In order to facilitate the design and creation of such personalized systems, we aim at formalizing them. The situation calculus is a logical framework that has often been proposed to model web applications and even personalized ones. However, the details of its use are much more rarely explained. In this paper we will show that it is needed to carefully consider which variant of the situation calculus to choose. We will precisely show why we want to use the so-called guarded action theories. We explain why and how it fits into an architecture. We introduce two scenarios of personalized applications to illustrate this choice.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133548865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121706
V. Berrocal-Plaza, M. A. Vega-Rodríguez, J. Pulido, J. M. Sánchez-Pérez
WiMAX (Worldwide Interoperability for Microwave Access) or IEEE 802.16 is a technology developed to provide greater bandwidth and coverage. One of the most important challenges in wireless deploying network is the Base Stations (BS) location to meet traffic and coverage requirements efficiently. In this paper we are using a particularized swarm intelligence algorithm based on collective behavior of honey bees to find good solutions. In order to minimize the interference among cells and reduce energy consumption, we apply a post-processing to obtain power control and sectorization. Simulations results show that our method provides more efficient and better solutions than those are obtained by other evolutionary algorithms in the same instances.
{"title":"Artificial Bee Colony Algorithm applied to WiMAX network planning problem","authors":"V. Berrocal-Plaza, M. A. Vega-Rodríguez, J. Pulido, J. M. Sánchez-Pérez","doi":"10.1109/ISDA.2011.6121706","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121706","url":null,"abstract":"WiMAX (Worldwide Interoperability for Microwave Access) or IEEE 802.16 is a technology developed to provide greater bandwidth and coverage. One of the most important challenges in wireless deploying network is the Base Stations (BS) location to meet traffic and coverage requirements efficiently. In this paper we are using a particularized swarm intelligence algorithm based on collective behavior of honey bees to find good solutions. In order to minimize the interference among cells and reduce energy consumption, we apply a post-processing to obtain power control and sectorization. Simulations results show that our method provides more efficient and better solutions than those are obtained by other evolutionary algorithms in the same instances.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132185451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121621
Ghader Simzan, A. Akbarimajd, M. Khosravani
An artificial capital market is employed to solve a multi-robot transportation problem. In this artificial market, each robot is considered as an investor agent where contributing in carrying the object is considered as asset. It should be decided which agents are going to do investment. A negotiation protocol is proposed to support the society to make decision by a distributed approach. The agents are self-interested trying to increase their own profit but acting in the framework of the negotiation protocol yields a decision that is the best for whole society. The best decision for the society corresponds to minimum fuel consumption. Simulation results showed that the convergence of the algorithm is very fast, the results are not dependent on starting point and the solution is close to optimal solution.
{"title":"A market based distributed cooperation mechanism in a multi-robot transportation problem","authors":"Ghader Simzan, A. Akbarimajd, M. Khosravani","doi":"10.1109/ISDA.2011.6121621","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121621","url":null,"abstract":"An artificial capital market is employed to solve a multi-robot transportation problem. In this artificial market, each robot is considered as an investor agent where contributing in carrying the object is considered as asset. It should be decided which agents are going to do investment. A negotiation protocol is proposed to support the society to make decision by a distributed approach. The agents are self-interested trying to increase their own profit but acting in the framework of the negotiation protocol yields a decision that is the best for whole society. The best decision for the society corresponds to minimum fuel consumption. Simulation results showed that the convergence of the algorithm is very fast, the results are not dependent on starting point and the solution is close to optimal solution.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124264697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121844
Miguel A. Serrano, Juan Gómez-Romero, M. A. Patricio, Jesús García, J. M. Molina
Representation and reasoning with spatial properties is essential in several application domains where ontologies are being successfully applied; e.g., Information Fusion systems. This requires a full characterization of the semantics of relations such as adjacent, included, overlapping, etc. Nevertheless, ontologies are not expressive enough to directly support widely-use spatial or topological theories, such as the Region Connection Calculus (RCC). In addition, these properties must be properly instantiated in the ontology, which may require expensive calculations. This paper presents a practical approach to represent and reason with topological properties in ontology-based systems, as well as some optimization techniques that have been applied in a video-based Information Fusion application.
{"title":"Topological properties in ontology-based applications","authors":"Miguel A. Serrano, Juan Gómez-Romero, M. A. Patricio, Jesús García, J. M. Molina","doi":"10.1109/ISDA.2011.6121844","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121844","url":null,"abstract":"Representation and reasoning with spatial properties is essential in several application domains where ontologies are being successfully applied; e.g., Information Fusion systems. This requires a full characterization of the semantics of relations such as adjacent, included, overlapping, etc. Nevertheless, ontologies are not expressive enough to directly support widely-use spatial or topological theories, such as the Region Connection Calculus (RCC). In addition, these properties must be properly instantiated in the ontology, which may require expensive calculations. This paper presents a practical approach to represent and reason with topological properties in ontology-based systems, as well as some optimization techniques that have been applied in a video-based Information Fusion application.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116434295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121667
Sergio Nesmachnow, F. Luna, E. Alba
This article presents a study which characterizes the computational efficiency behavior of a standard EA as a software program. The study analyzes the effects of some implementation decisions regarding memory utilization (dynamic vs. static, local vs. global) and the generation of pseudorandom numbers, on the execution time of the resulting EA. The experimental analysis allows us to conclude that significant improvements in efficiency can be gained by applying simple guidelines on how to best program the EA.
{"title":"Time analysis of standard evolutionary algorithms as software programs","authors":"Sergio Nesmachnow, F. Luna, E. Alba","doi":"10.1109/ISDA.2011.6121667","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121667","url":null,"abstract":"This article presents a study which characterizes the computational efficiency behavior of a standard EA as a software program. The study analyzes the effects of some implementation decisions regarding memory utilization (dynamic vs. static, local vs. global) and the generation of pseudorandom numbers, on the execution time of the resulting EA. The experimental analysis allows us to conclude that significant improvements in efficiency can be gained by applying simple guidelines on how to best program the EA.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129447474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121772
Manuel Baena-García, Rafael Morales Bueno
Discovering frequent factors from long strings is an important problem in many applications, such as biosequence mining. In classical approaches, the algorithms process a vast database of small strings. However, in this paper we analyze a small database of long strings. The main difference resides in the high number of patterns to analyze. To tackle the problem, we have developed a new algorithm for discovering frequent factors in long strings. This algorithm uses a new data structure to arrange nodes in a trie. A positioning matrix is defined as a new positioning strategy. By using positioning matrices, we can apply advanced prune heuristics in a trie with a minimal computational cost. The positioning matrices let us process strings including Short Tandem Repeats and calculate different interestingness measures efficiently. The algorithm has been successfully used in natural language and biological sequence contexts.
{"title":"New data structures for analyzing frequent factors in strings","authors":"Manuel Baena-García, Rafael Morales Bueno","doi":"10.1109/ISDA.2011.6121772","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121772","url":null,"abstract":"Discovering frequent factors from long strings is an important problem in many applications, such as biosequence mining. In classical approaches, the algorithms process a vast database of small strings. However, in this paper we analyze a small database of long strings. The main difference resides in the high number of patterns to analyze. To tackle the problem, we have developed a new algorithm for discovering frequent factors in long strings. This algorithm uses a new data structure to arrange nodes in a trie. A positioning matrix is defined as a new positioning strategy. By using positioning matrices, we can apply advanced prune heuristics in a trie with a minimal computational cost. The positioning matrices let us process strings including Short Tandem Repeats and calculate different interestingness measures efficiently. The algorithm has been successfully used in natural language and biological sequence contexts.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129839544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121718
Fabio Clarizia, F. Colace, M. D. Santo, L. Greco, Paolo Napoletano
It is well known that one way to improve the accuracy of a text retrieval system is to expand the original query with additional knowledge coded through topic-related terms. In the case of an interactive environment, the expansion, which is usually represented as a list of words, is extracted from documents whose relevance is known thanks to the feedback of the user. In this paper we argue that the accuracy of a text retrieval system can be improved if we employ a query expansion method based on a mixed Graph of Terms representation instead of a method based on a simple list of words. The graph, that is composed of a directed and an undirected subgraph, can be automatically extracted from a small set of only relevant documents (namely the user feedback) using a method for term extraction based on the probabilistic Topic Model. The evaluation of the proposed method has been carried out by performing a comparison with two less complex structures: one represented as a set of pairs of words and another that is a simple list of words.
{"title":"Mixed graph of terms for query expansion","authors":"Fabio Clarizia, F. Colace, M. D. Santo, L. Greco, Paolo Napoletano","doi":"10.1109/ISDA.2011.6121718","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121718","url":null,"abstract":"It is well known that one way to improve the accuracy of a text retrieval system is to expand the original query with additional knowledge coded through topic-related terms. In the case of an interactive environment, the expansion, which is usually represented as a list of words, is extracted from documents whose relevance is known thanks to the feedback of the user. In this paper we argue that the accuracy of a text retrieval system can be improved if we employ a query expansion method based on a mixed Graph of Terms representation instead of a method based on a simple list of words. The graph, that is composed of a directed and an undirected subgraph, can be automatically extracted from a small set of only relevant documents (namely the user feedback) using a method for term extraction based on the probabilistic Topic Model. The evaluation of the proposed method has been carried out by performing a comparison with two less complex structures: one represented as a set of pairs of words and another that is a simple list of words.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128690190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121816
R. Sousa, Jaime S. Cardoso
While ordinal classification problems are common in many situations, induction of ordinal decision trees has not evolved significantly. Conventional trees for regression settings or nominal classification are commonly induced for ordinal classification problems. On the other hand a decision tree consistent with the ordinal setting is often desirable to aid decision making in such situations as credit rating. In this work we extend a recently proposed strategy based on constraints defined globally over the feature space. We propose a bootstrap technique to improve the accuracy of the baseline solution. Experiments in synthetic and real data show the benefits of our proposal.
{"title":"Ensemble of decision trees with global constraints for ordinal classification","authors":"R. Sousa, Jaime S. Cardoso","doi":"10.1109/ISDA.2011.6121816","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121816","url":null,"abstract":"While ordinal classification problems are common in many situations, induction of ordinal decision trees has not evolved significantly. Conventional trees for regression settings or nominal classification are commonly induced for ordinal classification problems. On the other hand a decision tree consistent with the ordinal setting is often desirable to aid decision making in such situations as credit rating. In this work we extend a recently proposed strategy based on constraints defined globally over the feature space. We propose a bootstrap technique to improve the accuracy of the baseline solution. Experiments in synthetic and real data show the benefits of our proposal.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129000489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：