R. Bremananth, A. Chitra, V. Seetharaman, V.S.L. Nathan
{"title":"A robust video based license plate recognition system","authors":"R. Bremananth, A. Chitra, V. Seetharaman, V.S.L. Nathan","doi":"10.1109/ICISIP.2005.1529444","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529444","url":null,"abstract":"License plate recognition system (LPRS) is a difficult problem in the field of machine vision and is of substantial interest because of its applications to areas such as cross border security, law enforcement and various other automation applications. Previous methods used plate specific details such as aspect ratio, color or dimensions of the plate in the complex task of plate localization. In this paper, license plate localization process is carried out by weight based density map (WBDM) method, which is independent of such constraints. The proposed method also relaxes constraints in lighting conditions. The robustness of this method is well suited for application in countries like India where the appearance of plates varies widely. 1750 images were captured in different background scenes under various lighting conditions. This method has been tested with different types of vehicles such as buses, care, trucks etc. The overall identification rate of this algorithm is 98.63% in different conditions.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121021296","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 Web based amplified fragment length polymorphism search system","authors":"S. Srinivasan, D.P. Mital, S. Haque","doi":"10.1109/ICISIP.2005.1529473","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529473","url":null,"abstract":"Computerization has affected all aspects of science. The flexibility of programming languages, ease of writing platform independent languages and the cost effectiveness of computerized simulation as compared to actual lab work has made use of computer in biotechnology a mandatory tool. The aspect of programming language utilized in this project is searching in an extensive database of primers and restriction enzymes suitable matches to carry out the AFLP procedure. This could be an ideal cost effective search engine for a laboratory carrying out applications with AFLP. This highly specific search engine would help selection of restriction enzyme and primers without actual lab work which could aid in saving time as well as money to any lab.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121071477","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":"Effect of RR segment duration on short-term HRV assessment using Poincare plot","authors":"D. Singh, K. Vinod","doi":"10.1109/ICISIP.2005.1529493","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529493","url":null,"abstract":"HRV analysis is an unprecedented tool capable of providing relevant information on autonomic modulation of sinus node as well as on diagnosis and prognosis in a variety of clinical conditions. Spectral analysis of the RR tachogram is typically used to estimate the effect of the sympathetic and parasympathetic modulation of the RR-intervals. An emerging analysis technique is the Poincare plot, the graphical representation of the correlation between consecutive RR intervals, which takes a sequence of intervals and plots each interval against the following interval. Keeping in view, its advantages like visual assessment; ability to display nonlinear aspects and complexity; no need of RR interval pre-processing; less sensitive to artifacts etc., the quantification of Poincare plot has been discussed recently for a better description of results. Previously, Poincare plot based HRV analysis has been reported for few minutes to several hours of RR segment durations. The major advantage of the Poincare plots lies in their relative insensitivity to artefacts and ectopic beats, while the major disadvantage is the need for a reasonable number of RR intervals and a longer ECG recording. To contain the nonstationarity and noise in long-term ECG records, short-term HRV analysis has been favoured. Here a study on a standard database containing nonhomogeneous group of subjects, has been carried out and 5-minute RR segment length has been shown to provide good enough plot morphology for visual evaluation. As the existing Poincare plot quantification measures are linearly related with the statistical measures, so the plot morphology alone should be considered for the assessment of autonomic and cardiovascular systems.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127134979","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}
K.N. Pasumarthy, M. Grzegorzek, Joachim Denzler, H. Niemann
{"title":"Scene exploration using Bayesian nets","authors":"K.N. Pasumarthy, M. Grzegorzek, Joachim Denzler, H. Niemann","doi":"10.1109/ICISIP.2005.1529449","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529449","url":null,"abstract":"Exploring scenes using Bayesian nets is based on the idea of performing an active knowledge based search on images unlike conventional visual recognition algorithms. During the active search of images, a sample set of training images from different classes is available right at the onset of an experiment and the nature of the class to be searched is unknown. Usually a recursive search on the images for objects, belonging to all classes is performed using a conventional object recognition system and our approach presented in the present paper can obviate this. The search by Bayesian nets can be confined only to a specific class or a set of classes, provided the relationships between constituent objects are exactly defined. We prove that if structural relationships are rightly established between the constituent objects of an image, searching scenes using Bayesian nets is quite effective and the presented results proclaim this very fact.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116092724","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 nonlinear algorithm for maneuvering target visual-based tracking","authors":"M. Djouadi, A. Sebbagh, D. Berkani","doi":"10.1109/ICISIP.2005.1529421","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529421","url":null,"abstract":"In this paper, we present an efficient filtering algorithm to perform accurate estimation in jump Markov nonlinear systems, which we aim to contribute in solving the problem of model-based body motion estimation by using data coming from visual sensors. The interacting multiple model (IMM) algorithm is specially designed to track accurately targets whose state and/or measurement (assumed to be linear) models changes during motion transition. However, when these models are nonlinear, the IMM algorithm must be modified in order to guarantee an accurate track. In this paper we propose to avoid the extended Kalman filter because of its limitations and substitute it with the unscented Kalman filter which seems to be more efficient especially according to the simulation results obtained with the nonlinear IMM algorithm (NIMM).","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117053118","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":"Adaptive multiagent routing protocol using location sensing - hybrid wireless networks","authors":"A. Velmurugan, R. Rajaram","doi":"10.1109/ICISIP.2005.1529415","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529415","url":null,"abstract":"This paper presents a adaptive multiagent routing protocol (AMARP) using location sensing for intelligent knowledge extraction for hybrid wireless networks, which utilizes a combination of caching strategy in dynamic source routing (DSR) and limited flooding area in location aided routing (LAR) protocol. The key novelty of AMARP is that it can gradually discover knowledge of topological characteristics such as population density using mobile agents for location sensing of the distribution of the network. This knowledge can be organized in the form of a set of guiding/spl I.bar/routes, which includes a chain of important positions between a pair of source and destination locations. The guiding/spl I.bar/route information is learned during the route discovery phase by the mobile agents, and it can be used to guide future route discovery process in a more efficient manner. AMARP is especially suitable for mobility models where nodes are not uniformly distributed. AMARP can exploit the topological characteristics in these models and limit the search space in route discovery process in a more refined granularity. Simulations results show that AMARP outperforms LAR and DSR in term of routing overhead; saving up to 30% broadcast routing messages compared to the LAR approach.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129523523","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":"Complexity measures for software systems : towards multi-agent based software testing","authors":"P. Dhavachelvan, G. Uma","doi":"10.1109/ICISIP.2005.1529476","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529476","url":null,"abstract":"Bringing together agents and other fields of software engineering might be difficult, as the advantages of agent technology are still not widely recognized. Effectiveness claims of agent-oriented software engineering are based upon the strategies for addressing complex systems. Agent technologies facilitate the automated software testing by virtue of their high-level decomposition, independency and parallel activation. The informal interpretations of qualitative agent theories are not sufficient to distinguish agent-based approaches from other approaches in software testing. In this paper, we do not just described the agent-based approach in software testing, also developed an evaluation framework for agent-oriented approach in software testing and proposed a multi-agent system for software testing. This paper therefore provides a timely summary and enhancement of agent theory in software testing, which motivates recent efforts in adapting concepts and methodologies for agent-oriented software testing (AOST) to complex systems, which has not previously done. The 'multi-modal' approach proposed here is to offer a definition for encompassing to cover the software testing phenomena, based on agents, at the preliminary level, yet sufficiently tight that it can rule out complex systems that are clearly not agent-based.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114835540","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":"Algorithm on thinking in terms of images","authors":"Li Daiping, Yu Yongquan","doi":"10.1109/ICISIP.2005.1529439","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529439","url":null,"abstract":"In the light that there is no deducing ability or learning ability of traditional hypertext of multimedia computing, this paper provides a new method of pattern-matching based on thinking in terms of images through developing the pattern-matching in the artificial intelligence field, proposes a corresponding algorithm, and the learning problem of multimedia computing based on model recognition is discussed.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124313849","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}
Srinivasan, A. Chandrasekhar, Jayesh Seshadri, Siddharth
{"title":"An intelligent neural network based driving system using artificial net extension","authors":"Srinivasan, A. Chandrasekhar, Jayesh Seshadri, Siddharth","doi":"10.1109/ICISIP.2005.1529456","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529456","url":null,"abstract":"Over the past decade, the field of automated intelligent transport systems has been the focus of intensive research. This paper proposes an intelligent neural network based driving system using artificial net extension (INDSANE), an advanced automated transport system with considerable advantages over previous attempts in this field. The system uses a multi-layer feed-forward neural network with back propagation learning. In addition, the design of INDSANE involves the convergence of a plethora of technologies like a global positioning system (GPS), a geographic information system (GIS), and laser ranging. INDSANE can guide mobile agent through a hostile and unfamiliar domain after being trained by a human user with domain expertise. One of the many areas in which INDSANE scores against the competition is that the system is completely domain independent and incurs a lot less processor overhead. INDSANE thus provides more functionality even though it requires a lot less input as compared to other attempts in this field. This reduction in the size of the input vector translates into more efficient and faster processing. Another of INDSANE's hallmark features is its ability to negotiate turns and implement lane-changing maneuvers with a view to overtaking obstacles. It does this by employing a novel technique, selective net masking. INDSANE also employs a technique called artificial net extension for negotiating traffic signals. A simulation of INDSANE's neural network was performed on a variety of network topologies, and the best network selected.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124024932","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 decomposition method for support vector clustering","authors":"V. Saradhi, H. Karnik, P. Mitra","doi":"10.1109/ICISIP.2005.1529460","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1529460","url":null,"abstract":"In this paper we study how to apply decomposition method for support vector clustering (SVC) and compare its performance with that of non-decomposition methods which solves quadratic programming problem using traditional techniques. Decomposition is one of the major methods for solving SVMs and is known for its efficiency. SVC is a novel clustering method that uses SVM approach. SVC problem is formulated as a quadratic optimization with constrains to come up with clusters. When applying SVC to large data sets, traditional ways of solving quadratic programming problem require huge memory and computational time. This problem is eased by the application of the decomposition method. This paper discusses the application of the decomposition method in such cases and gives a detailed discussion on how to apply the method. The method is applied on a few benchmark data sets and results shows a substantial improvement in terms of performance.","PeriodicalId":445130,"journal":{"name":"Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128068593","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}