Juan Humberto Sossa Azuela, Ricardo Barrón, R. Vázquez
{"title":"Real-valued pattern classification based on extended associative memory","authors":"Juan Humberto Sossa Azuela, Ricardo Barrón, R. Vázquez","doi":"10.1109/ENC.2004.1342608","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342608","url":null,"abstract":"We propose an associative model for the classification of real-valued patterns. It is an extension of well-known associative model proposed by K. Steinbuch in 1961, which is known to be only useful in the binary case. The proposed extension is tested in several scenarios with images of realistic objects.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122472489","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}
{"title":"Robust MPEG-2 SNR scalable coding using variable end-of-block","authors":"R. Hasimoto-Beltrán, A. Khokhar","doi":"10.1109/ENC.2004.1342600","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342600","url":null,"abstract":"Signal-to-noise ratio (SNR) scalable coding over priority networks has been used as a robust mechanism to transmission errors, since the most important information (base layer) can be sent over an error free channel as in the case of ATM networks or over protected channel as in the case of IP networks. SNR scalability ensures a minimum video quality at the receiver end by sacrificing the least important information (enhancement layer) when losses occur. However, one disadvantage of scalable coding is its lower compression performance with respect to the one-layer encoding (/spl sim/10-15%, (D. Wilson and M. Ghanbari, 1999)). In this work, we propose an error resilient scheme for MPEG-2 SNR scalable video transmission that is compression efficient, in addition to providing scalable error resynchronization mechanism to enhancement layer that impedes the propagation of errors beyond the physically affected area in the bitstream. In order to provide robustness to errors during transmission, the proposed scheme uses triangular coding in the transform domain (R. Hasimoto-Beltran et al., 2000) and a modified variable end of block based on the number of bits per unit of block. Our scheme yields significantly better compression ratios compared to the MPEG-2 standard (3% to 6.7%) while at the same time improves considerably the quality of the received data (2-11 db) under different conditions of data losses.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"156 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128731980","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}
{"title":"Real-time embedded vision system development using AIBO Vision Workshop 2","authors":"N. Lovell","doi":"10.1109/ENC.2004.1342616","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342616","url":null,"abstract":"Development of visual processing components in embedded systems is a difficult task. The nature of embedded devices not only limits the processing power available to applications, but the limited I/O facilities also considerably hinder development. Several complexities emerge for testing, debugging, quality evaluation and profiling when developing on an embedded device. This means that vision processing algorithms are not only harder to design for embedded systems, but require more time to debug and test than would be the case on a general purpose computing device. However the increase in deployment of robotic systems has seen embedded vision development becoming increasingly necessary in many problem domains. AIBO Vision Workshop 2 (AVW2) is a utility that address these problems associated with vision processing development on embedded systems by providing a flexible, off-line, modularised vision pipeline. That is, AVW2 aids developers in this area as it provides an immersive environment where each step (module) can be flexibly placed in a user configured vision pipeline. The output can then be rigorously inspected and tested. The code of the embedded system is executed in the environment of the AVW2 tool allowing profiling (experimental evaluation of the time requirements of the code).","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126703301","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}
{"title":"Central action selection using sensor fusion","authors":"Fernando Montes-González, A. Marín-Hernández","doi":"10.1109/ENC.2004.1342619","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342619","url":null,"abstract":"A computational model of central action selection has been successfully embedded in a robotic platform. The proposed model, allows action selection between basic behaviors in a rat-like fashion. These behaviors imitate some home cage activities of a laboratory rat. The behavioral setting ranges from: search-'food', 'food'-pickup, 'food'-deposit, wall-finding and look-around. There is evidence that the switching of multiple sensorimotor systems in the vertebrate brain is similar to the concept of action oriented sensor fusion in AI robotics. In this work, by integrating infrared, odometry and visual information within a reactive navigation scheme, we use sensor fusion to produce action selection. Following this approach, initial experiments were conducted using a robot simulation software. Subsequent tests were carried out to evaluate the functionality of the model in a Khepera robot.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124031513","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}
J. A. Sánchez, Carlos Proal, M. F. Maldonado-Naude
{"title":"Supporting structured, semi-structured and unstructured data in digital libraries","authors":"J. A. Sánchez, Carlos Proal, M. F. Maldonado-Naude","doi":"10.1109/ENC.2004.1342629","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342629","url":null,"abstract":"This work presents an approach to the design of digital libraries by raising and addressing issues involved in supporting services for collections of structured, semi-structured and unstructured objects. We present a system architecture for a digital library that includes provisions for storing and retrieving data with differing structure levels (ranging from highly unstructured to highly structured). We have successfully instantiated this architecture via a practical implementation that integrates technologies such as relational and novel XML databases as well as indexing and information retrieval techniques. A number of digital library applications are using these facilities for handling differing structure levels in an integrated fashion.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132155413","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}
Rodrigo Morteo, Víctor M. González, J. Favela, G. Mark
{"title":"Sphere Juggler: fast context retrieval in support of working spheres","authors":"Rodrigo Morteo, Víctor M. González, J. Favela, G. Mark","doi":"10.1109/ENC.2004.1342628","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342628","url":null,"abstract":"Information workers typically demand the aggregation of multiple information resources related to their activities such as documents, contacts, and emails. Current mechanisms for aggregation of resources lack enough flexibility to collect different kinds of information and offer no support to facilitate their prompt retrieval. This work presents Sphere Juggler, a system that integrates seamlessly with the popular Microsoft Windows interface facilitating the grouping of information related with the current activities of people, as well as a fast switching between them. The architecture of the system and its interface are described. A preliminary evaluation of the system indicates that people envisions important benefits by having the functionality offered by the system.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130224116","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}
{"title":"Feature selection for visual gesture recognition using hidden Markov models","authors":"J.A. Montero, L. Sucar","doi":"10.1109/ENC.2004.1342606","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342606","url":null,"abstract":"Hidden Markov models have become the preferred technique for visual recognition of human gestures. However, the recognition rate depends on the set of visual features used, and also on the number of states of the hidden variable. It is difficult to determine a priori the optimal set of features and number of states. We analyse experimentally the use of different features for gesture recognition in an office environment. We considered a set of seven gestures that include interaction with other objects, such as writing, using the mouse, opening a drawer, etc. We use a single camera to detect and track the hand of the user based on adaptive colour histograms. From tracking the hand in a video sequence we obtain several features. The features considered include position and velocity in polar and Cartesian coordinates, and the trajectory represented as a chain code. Given that these features are continuous, we discretized them into a set of symbols using vector quantization. We then tested the recognition rate using HMMs with different: (i) number of discrete symbols; (ii) number of hidden states, (Hi) combination of features. The results show a high variation on the recognition rate depending on these parameters, from below 50% to more than 95%. The best performance (97%) was obtained by using the magnitude and orientation in polar coordinates, 64 discrete symbols and 10 states.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131518331","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}
{"title":"Deterring password sharing: user authentication via fuzzy c-means clustering applied to keystroke biometric data","authors":"S. Mandujano, Rogelio Soto","doi":"10.1109/ENC.2004.1342604","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342604","url":null,"abstract":"This work describes a clustering-based system to enhance user authentication by applying fuzzy techniques to biometric data in order to deter password sharing. Fuzzy c-means is used to train personal, per-keyboard profiles based on the keystroke dynamics of users when entering passwords on a keyboard. These profiles use DES encryption taking the actual passwords as key and are read at logon time by the access control mechanism in order to further validate the identity of the user. Fuzzy values obtained from membership functions applied to the input (i.e., keystroke latencies) are compared against profile values, and a match, within a certain precision threshold /spl gamma/, will grant access to the user. With this technique, even when user A shares password P/sub A/ with user B, B will still be denied access unless he is capable of mimicking the keystroke dynamics of A. We describe the motivation, design, and implementation of a prototype whose results indicate the accuracy level and feasibility of the approach.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520726","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}
A. Angeles-Yreta, H. Solis-Estrella, V. Landassuri-Moreno, J. Figueroa-Nazuno
{"title":"Similarity search in seismological signals","authors":"A. Angeles-Yreta, H. Solis-Estrella, V. Landassuri-Moreno, J. Figueroa-Nazuno","doi":"10.1109/ENC.2004.1342588","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342588","url":null,"abstract":"Similarity search in time series databases has been the focus of a lot research. It is non-trivial problem due their peculiar structure, high dimensionality (C. Faloutsos et. al, 1994), noise, and high feature correlation; it is also the heart of many data mining applications, like clustering, classification, rule discovery and query by content. In general, similarity has been measured with the Euclidean metric, but the dimensionality curse problem remains (K. Chan and A. Wai-chee, 1999). Basically, there are four major techniques that have been proposed in order to reduce the dimensionality of the data (E. Keogh et. al, 2000), singular value decomposition (SVD), the discrete Fourier transform (DFT), the discrete wavelets transform (DWT), and the piecewise aggregate approximation (PAA)(E. Keogh and M. Pazzami, 2000). In this work, we use the dynamic time warping (DTW) algorithm and PAA dimensionality reduction technique as a new approach to find the similarity between seismological signals.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130414610","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}
{"title":"A fairness study of the adaptive RIO active queue management algorithm","authors":"R. Cartas, J. Orozco, J. Incera, David Ros","doi":"10.1109/ENC.2004.1342589","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342589","url":null,"abstract":"Active queue management (AQM) mechanisms manage queue lengths by dropping packets when congestion is building up; end-systems can then react to such losses by reducing their packet rate, hence avoiding severe congestion. They are also very useful for the differentiated forwarding of packets in the DiffServ architecture. Many studies have shown that setting the parameters of an AQM algorithm may prove difficult and error-prone, and that the performance of AQM mechanisms is very sensitive to network conditions. The adaptive RIO mechanism (A-RIO) addresses both issues. It requires a single parameter, the desired queuing delay and adjusts its internal dynamics accordingly. A-RIO has been thoroughly evaluated in terms of delay response and network utilization but no study has been conducted in order to evaluate its behaviour in terms of fairness. By way of ns-2 simulations, This work examines A-RIO's ability to fairly share the network's resources (bandwidth) between the flows contending for those resources. Using Jain's fairness index as our performance metric, we compare the bandwidth distribution among flows obtained with A-RIO and with RIO.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123401824","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}