Pub Date : 2011-10-10DOI: 10.1109/ICIINFS.2011.6038089
Lahiru Samarakoon, S. Kumarawadu, K. Pulasinghe
This paper describes a closed domain question answering system which can be used as the first step in automating a customer helpdesk of a commercial organization. Even though there has been an increasing interest in data-driven methods over the past decade to achieve more natural human-machine interactions, such methods require a large amount of manually labeled representative data on how user converses with a machine. However, this is a strong requirement that is difficult to be satisfied in the early phase of system development. The knowledge-based approach that we present here is aimed at maximally making use of the user experience available with the customer services representatives (CSRs) in the organization and hence not relying on application data. The approach takes into account the syntactic, lexical, and morphological variations, as well as a way of synonym transduction that is allowed to vary over the systems knowledgebase. The query understanding method, which is based on a ranking algorithm and a pattern writing process, takes into account the intent, context, and content components of natural language meaning as well as the word order. A genetic algorithm-based method is presented for regularly updating the ranking parameters to adapt to changes in the nature of users' queries over time. We present an evaluation of our system deployed in a real-world enterprise helpdesk environment at Exetel Pty Ltd., Australia.
{"title":"Automated question answering for customer helpdesk applications","authors":"Lahiru Samarakoon, S. Kumarawadu, K. Pulasinghe","doi":"10.1109/ICIINFS.2011.6038089","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038089","url":null,"abstract":"This paper describes a closed domain question answering system which can be used as the first step in automating a customer helpdesk of a commercial organization. Even though there has been an increasing interest in data-driven methods over the past decade to achieve more natural human-machine interactions, such methods require a large amount of manually labeled representative data on how user converses with a machine. However, this is a strong requirement that is difficult to be satisfied in the early phase of system development. The knowledge-based approach that we present here is aimed at maximally making use of the user experience available with the customer services representatives (CSRs) in the organization and hence not relying on application data. The approach takes into account the syntactic, lexical, and morphological variations, as well as a way of synonym transduction that is allowed to vary over the systems knowledgebase. The query understanding method, which is based on a ranking algorithm and a pattern writing process, takes into account the intent, context, and content components of natural language meaning as well as the word order. A genetic algorithm-based method is presented for regularly updating the ranking parameters to adapt to changes in the nature of users' queries over time. We present an evaluation of our system deployed in a real-world enterprise helpdesk environment at Exetel Pty Ltd., Australia.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125590135","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-10-10DOI: 10.1109/ICIINFS.2011.6038129
C. Liyanagedera, U. C. Dissanayake, K. T. D. D. N. Jayapala, S. Abeyratne, K. Rathnayake
Simulation of a maximum power point tracking (MPPT) algorithm prior to implementation is useful in avoiding unnecessary prototyping, fabricating and testing costs. Also upon implementation of the actual hardware system, performance monitoring and recording of the system behavior is of importance. The data manipulated above is useful in energy management and saving applications. To full fill the above requirements and to demonstrate it, a system hardware and software is designed in the research. The proposed user-software provides a gateway to real time monitoring of a prototype MPPT converter performance. Additionally, through the proposed user software, obtaining datasets to model a solar cell of interest for more accurate simulation on a given algorithm is made possible. Also it is demonstrated that the software and the prototype system together help monitoring and validating the performance of a solar panel based system.
{"title":"Simulation and fabrication of a maximum power point tracker monitoring and validating system","authors":"C. Liyanagedera, U. C. Dissanayake, K. T. D. D. N. Jayapala, S. Abeyratne, K. Rathnayake","doi":"10.1109/ICIINFS.2011.6038129","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038129","url":null,"abstract":"Simulation of a maximum power point tracking (MPPT) algorithm prior to implementation is useful in avoiding unnecessary prototyping, fabricating and testing costs. Also upon implementation of the actual hardware system, performance monitoring and recording of the system behavior is of importance. The data manipulated above is useful in energy management and saving applications. To full fill the above requirements and to demonstrate it, a system hardware and software is designed in the research. The proposed user-software provides a gateway to real time monitoring of a prototype MPPT converter performance. Additionally, through the proposed user software, obtaining datasets to model a solar cell of interest for more accurate simulation on a given algorithm is made possible. Also it is demonstrated that the software and the prototype system together help monitoring and validating the performance of a solar panel based system.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129552965","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-10-10DOI: 10.1109/ICIINFS.2011.6038046
Ramanujam Sarathi, R. Karpagam
The tracking phenomenon is basically a carbonaceous process, which occurs at the surface of the insulating material during operation. Epoxy nanocomposites have high tracking resistance. Tracking studies were carried out by adopting IEC-587 standards. An attempt has been made to characterize the UHF signal radiated due to discharges during tracking studies. Percentage of clay content in epoxy nanocomposites has not showed any variation in UHF signal generated. It is observed that surface discharges radiates UHF signal with its frequency content lies in the range of 1–3 GHz and at the time of tracking it is in the range of 1–2 GHz. Zero span analysis of UHF signal by using spectrum analyser could help one to identify the point of transition from surface discharge to tracking condition.
{"title":"Understanding the tracking phenomena in epoxy nanocomposites adopting UHF technique","authors":"Ramanujam Sarathi, R. Karpagam","doi":"10.1109/ICIINFS.2011.6038046","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038046","url":null,"abstract":"The tracking phenomenon is basically a carbonaceous process, which occurs at the surface of the insulating material during operation. Epoxy nanocomposites have high tracking resistance. Tracking studies were carried out by adopting IEC-587 standards. An attempt has been made to characterize the UHF signal radiated due to discharges during tracking studies. Percentage of clay content in epoxy nanocomposites has not showed any variation in UHF signal generated. It is observed that surface discharges radiates UHF signal with its frequency content lies in the range of 1–3 GHz and at the time of tracking it is in the range of 1–2 GHz. Zero span analysis of UHF signal by using spectrum analyser could help one to identify the point of transition from surface discharge to tracking condition.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131259068","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-10-10DOI: 10.1109/ICIINFS.2011.6038126
N. Kumaresan, M. Subbiah, R. Karthigaivel
Single-phase inductor alternators have been shown to be suitable for use with renewable energy electric conversion systems for small power applications. Since both the field and the ac output winding are on the stator, these alternators, in respect of construction and maintenance, have all the advantages of self-excited induction generators presently being employed with renewable energy sources. An attempt has been made in this paper to modify the stator winding design of conventional inductor alternators, to reduce the field power requirement by reducing the number of field winding coils and also to feed this winding by self-excitation, so that their suitability for the proposed applications could be further enhanced. Taking the induced EMF of a conventional single-phase inductor alternator as the bench mark value, the EMF of the new design is calculated and compared. Such calculations are made by determining the EMF of each coil separately, which leads to the assessment of the number of possible parallel paths of the ac output winding. A simple microcontroller based MOSFET chopper circuit has been developed for the filed current control of the inductor alternator. Test results obtained on an alternator wound with the proposed winding design are presented. A dc motor for initial test purposes and then a bio-mass gasifier based diesel engine to demonstrate the application with renewable energy sources, have been used as prime-movers for the alternator.
{"title":"Single-phase self-excited inductor alternators for renewable energy electric conversion systems","authors":"N. Kumaresan, M. Subbiah, R. Karthigaivel","doi":"10.1109/ICIINFS.2011.6038126","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038126","url":null,"abstract":"Single-phase inductor alternators have been shown to be suitable for use with renewable energy electric conversion systems for small power applications. Since both the field and the ac output winding are on the stator, these alternators, in respect of construction and maintenance, have all the advantages of self-excited induction generators presently being employed with renewable energy sources. An attempt has been made in this paper to modify the stator winding design of conventional inductor alternators, to reduce the field power requirement by reducing the number of field winding coils and also to feed this winding by self-excitation, so that their suitability for the proposed applications could be further enhanced. Taking the induced EMF of a conventional single-phase inductor alternator as the bench mark value, the EMF of the new design is calculated and compared. Such calculations are made by determining the EMF of each coil separately, which leads to the assessment of the number of possible parallel paths of the ac output winding. A simple microcontroller based MOSFET chopper circuit has been developed for the filed current control of the inductor alternator. Test results obtained on an alternator wound with the proposed winding design are presented. A dc motor for initial test purposes and then a bio-mass gasifier based diesel engine to demonstrate the application with renewable energy sources, have been used as prime-movers for the alternator.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131552033","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-10-10DOI: 10.1109/ICIINFS.2011.6038086
G. Rajakaruna, K. D. Saminda, H. K. S. R.C. Kumara, P. Athukorala, W. Wijayaweera, A. Karunananda
Ontology is becoming popular as a powerful way to structure the knowledge sources for complex systems. Modeling of evolvable ontologies turns out to be a research challenge for many decades. This paper presents how the agent technology can be used to update their ontologies while they are in execution. This solution has been designed to work on a primitive ontology at the beginning. Interaction among the agents updates the ontology as per the user intervention. Protégé and JADE have been used to implement the evolvable ontology and the agents respectively. The solution also uses mobile technology to synchronize the end user communication when the desired users are not connected on to the system at a required time. This amounts to minimize resource utilization by the agent, and also to enable notifications to the inactive team members in a timely manner. The system has been used to organize an exhibition, and shown the power of evolving ontology to communicate previously unseen aspects and also to incorporate emergent needs of a planning task in general. Our solution has been able to effectively update ontologies of end users before they come for a formal meeting.
{"title":"Agent technology to model evolvable ontologies","authors":"G. Rajakaruna, K. D. Saminda, H. K. S. R.C. Kumara, P. Athukorala, W. Wijayaweera, A. Karunananda","doi":"10.1109/ICIINFS.2011.6038086","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038086","url":null,"abstract":"Ontology is becoming popular as a powerful way to structure the knowledge sources for complex systems. Modeling of evolvable ontologies turns out to be a research challenge for many decades. This paper presents how the agent technology can be used to update their ontologies while they are in execution. This solution has been designed to work on a primitive ontology at the beginning. Interaction among the agents updates the ontology as per the user intervention. Protégé and JADE have been used to implement the evolvable ontology and the agents respectively. The solution also uses mobile technology to synchronize the end user communication when the desired users are not connected on to the system at a required time. This amounts to minimize resource utilization by the agent, and also to enable notifications to the inactive team members in a timely manner. The system has been used to organize an exhibition, and shown the power of evolving ontology to communicate previously unseen aspects and also to incorporate emergent needs of a planning task in general. Our solution has been able to effectively update ontologies of end users before they come for a formal meeting.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"251 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132681984","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}
Suggesting friends is a very important aspect in any online social network. In this paper, we present a relational similarity model for suggesting friends in online social networks, which uses relational features as opposed to the non-relational features that are used in current friend suggestion applications. We take a supervised learning approach and build a model that uses information of not only the two central users but also of their current neighborhoods. We use a dataset from Facebook to evaluate the accuracy of our model by comparing the performance of feature sets belonging to relational/non-relational categories and boolean and numerical sub categories. We show experimentally that the relational information improves the accuracy of boolean features but does not affect the performance of numerical features. Moreover, we show that our overall model is highly accurate in recommending people in online social networks.
{"title":"Relational similarity model for suggesting friends in online social networks","authors":"Miraj Mohajireen, Charith Ellepola, Madura Perera, Indika Kahanda, Upulee Kanewala","doi":"10.1109/ICIINFS.2011.6038090","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038090","url":null,"abstract":"Suggesting friends is a very important aspect in any online social network. In this paper, we present a relational similarity model for suggesting friends in online social networks, which uses relational features as opposed to the non-relational features that are used in current friend suggestion applications. We take a supervised learning approach and build a model that uses information of not only the two central users but also of their current neighborhoods. We use a dataset from Facebook to evaluate the accuracy of our model by comparing the performance of feature sets belonging to relational/non-relational categories and boolean and numerical sub categories. We show experimentally that the relational information improves the accuracy of boolean features but does not affect the performance of numerical features. Moreover, we show that our overall model is highly accurate in recommending people in online social networks.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130309882","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-10-10DOI: 10.1109/ICIINFS.2011.6038119
G. Illeperuma, Upul J. Sonnadara
A simulation and a pilot scale implementation of a vision based robot navigation system was carried out to determine the feasibility and the efficiency of using optical flow based algorithms in autonomous robot navigation. For the simulation work, VRML 97 was used to create the virtual world and the robot. Simulink was used to implement the algorithm and the optical flow calculations. The video stream captured through a virtual camera as seen by the robot was used to calculate the optical flow to determine the direction and the speed of the robot for the next step. A mathematical model was used to solve the problem analytically. The same algorithm was implemented and tested in real-time in a controlled environment. Data gathered through the simulation and the actual implementation showed that it is possible to use optical flow based algorithms in robot navigation.
{"title":"An autonomous robot navigation system based on optical flow","authors":"G. Illeperuma, Upul J. Sonnadara","doi":"10.1109/ICIINFS.2011.6038119","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038119","url":null,"abstract":"A simulation and a pilot scale implementation of a vision based robot navigation system was carried out to determine the feasibility and the efficiency of using optical flow based algorithms in autonomous robot navigation. For the simulation work, VRML 97 was used to create the virtual world and the robot. Simulink was used to implement the algorithm and the optical flow calculations. The video stream captured through a virtual camera as seen by the robot was used to calculate the optical flow to determine the direction and the speed of the robot for the next step. A mathematical model was used to solve the problem analytically. The same algorithm was implemented and tested in real-time in a controlled environment. Data gathered through the simulation and the actual implementation showed that it is possible to use optical flow based algorithms in robot navigation.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115984499","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-10-10DOI: 10.1109/ICIINFS.2011.6038113
M. Firdhous, O. Ghazali, S. Hassan
Cloud computing has been considered the new computing paradigm that would make the computing a utility. With the widespread acceptance of cloud computing, computing resources including computational power, storage, development platform and applications will be available as services. Hitherto computing resources were considered capital items and customers used to pay for these resources as for any other product. Cloud computing changes all these and consumers will pay only for what is consumed similar to other services or utilities. When cloud computing becomes more popular, different vendors would provide different services at different levels of qualities and prices. Hence customers will have to identify the differences in quality offered by different service providers and need to select the right service provider based on their requirements. A trust management system will match the service providers and the customers based on the requirements customers and the capabilities of service providers. In this paper, the authors propose a trust management system along with a trust evolution mechanism that can be used to measure the performance of services based on the response time of systems. The proposed mechanism formulates trust scores for different service level requirements based on assurance (confidence) levels. Hence this mechanism is suitable for managing multiple service levels against single trust score for all the service levels. Also the proposed mechanism is adaptive as it continuously modifies the scores based on the performance of the system. The proposed mechanism has been tested in a simulated environment and the results are found to be satisfactory.
{"title":"A trust computing mechanism for cloud computing with multilevel thresholding","authors":"M. Firdhous, O. Ghazali, S. Hassan","doi":"10.1109/ICIINFS.2011.6038113","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038113","url":null,"abstract":"Cloud computing has been considered the new computing paradigm that would make the computing a utility. With the widespread acceptance of cloud computing, computing resources including computational power, storage, development platform and applications will be available as services. Hitherto computing resources were considered capital items and customers used to pay for these resources as for any other product. Cloud computing changes all these and consumers will pay only for what is consumed similar to other services or utilities. When cloud computing becomes more popular, different vendors would provide different services at different levels of qualities and prices. Hence customers will have to identify the differences in quality offered by different service providers and need to select the right service provider based on their requirements. A trust management system will match the service providers and the customers based on the requirements customers and the capabilities of service providers. In this paper, the authors propose a trust management system along with a trust evolution mechanism that can be used to measure the performance of services based on the response time of systems. The proposed mechanism formulates trust scores for different service level requirements based on assurance (confidence) levels. Hence this mechanism is suitable for managing multiple service levels against single trust score for all the service levels. Also the proposed mechanism is adaptive as it continuously modifies the scores based on the performance of the system. The proposed mechanism has been tested in a simulated environment and the results are found to be satisfactory.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114160757","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-10-10DOI: 10.1109/ICIINFS.2011.6038044
R. M. T. P. Rajakaruna, W. Fernando, J. Calic
The proliferation of video consumption, especially over mobile devices, has created a demand for efficient interactive video applications and high-level video analysis. This is particularly significant in real-time applications and resource-limited scenarios. Pixel-domain video processing is often inefficient for many of these applications due to its complexity, whereas compressed domain processing offer fast but unreliable results. In order to achieve fast and effective video processing, this paper proposes a novel video encoding architecture that facilitate efficient compressed domain processing, while maintaining compliance with the mainstream coding standards. This is achieved by optimizing the accuracy of motion information embedded in the compressed video, in addition to compression efficiency. In a motion detection application, we demonstrate that the motion estimated by the proposed encoder can be directly used to extract object information, as opposed to conventionally coded video. The incurred rate distortion overheads can be weighed against the reduced processing required for video analysis targeting a wide spectrum of computer vision applications.
{"title":"Application-aware video coding architecture using camera and object motion-models","authors":"R. M. T. P. Rajakaruna, W. Fernando, J. Calic","doi":"10.1109/ICIINFS.2011.6038044","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038044","url":null,"abstract":"The proliferation of video consumption, especially over mobile devices, has created a demand for efficient interactive video applications and high-level video analysis. This is particularly significant in real-time applications and resource-limited scenarios. Pixel-domain video processing is often inefficient for many of these applications due to its complexity, whereas compressed domain processing offer fast but unreliable results. In order to achieve fast and effective video processing, this paper proposes a novel video encoding architecture that facilitate efficient compressed domain processing, while maintaining compliance with the mainstream coding standards. This is achieved by optimizing the accuracy of motion information embedded in the compressed video, in addition to compression efficiency. In a motion detection application, we demonstrate that the motion estimated by the proposed encoder can be directly used to extract object information, as opposed to conventionally coded video. The incurred rate distortion overheads can be weighed against the reduced processing required for video analysis targeting a wide spectrum of computer vision applications.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130550518","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-10-10DOI: 10.1109/ICIINFS.2011.6038042
Chaminda Namal Senarathne, Shanaka Ransiri, Pushpika Arangala, Asanka Balasooriya, C. De Silva
This paper presents a new algorithm for Image Registration and Stitching. The algorithm is designed to be extremely efficient and fast in its execution and is intended for use in stitching images extracted from a video stream of a camera. This algorithm is not universally applicable to all the image registration and stitching problems. It is customized to be used to generate single images of surfaces such as a conveyor belt or undercarriage of vehicles, which cannot be captured by a single photo. The algorithm works by extracting edges of the two images to be registered. Then it selects a reference section from the first image and search in the second image where it finds the best match for that section. The best match is the east difference score. The section in the second image which gives the least difference score is then identified as the registration point between the two images. The speed of the algorithm is improved by using heuristics to restrict the search space in the second image. We present full details of how the extraction of the heuristic is done from the inputs and how it drastically reduces the execution time of the algorithm. The paper also contains a full section on comparing our algorithm with a set of existing algorithms. Our algorithm outperforms the existing ones for all the common image sizes.
{"title":"A faster image registration and stitching algorithm","authors":"Chaminda Namal Senarathne, Shanaka Ransiri, Pushpika Arangala, Asanka Balasooriya, C. De Silva","doi":"10.1109/ICIINFS.2011.6038042","DOIUrl":"https://doi.org/10.1109/ICIINFS.2011.6038042","url":null,"abstract":"This paper presents a new algorithm for Image Registration and Stitching. The algorithm is designed to be extremely efficient and fast in its execution and is intended for use in stitching images extracted from a video stream of a camera. This algorithm is not universally applicable to all the image registration and stitching problems. It is customized to be used to generate single images of surfaces such as a conveyor belt or undercarriage of vehicles, which cannot be captured by a single photo. The algorithm works by extracting edges of the two images to be registered. Then it selects a reference section from the first image and search in the second image where it finds the best match for that section. The best match is the east difference score. The section in the second image which gives the least difference score is then identified as the registration point between the two images. The speed of the algorithm is improved by using heuristics to restrict the search space in the second image. We present full details of how the extraction of the heuristic is done from the inputs and how it drastically reduces the execution time of the algorithm. The paper also contains a full section on comparing our algorithm with a set of existing algorithms. Our algorithm outperforms the existing ones for all the common image sizes.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129376232","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
扫码关注我们
求助内容：
应助结果提醒方式：