Pub Date : 2009-12-11DOI: 10.1109/ICET.2009.5353147
M. Rehan, Abrar Ahmed, N. Iqbal, Muhammad Shahid Nazir
Anti-windup compensator is an additional controller which is used to compensate the affect of saturation non-linearity often present in practical systems. This paper describes the system identification, uncertainty modeling, control and implementation of different anti-windup techniques for a computer interfaced AC motor speed control system. System identification is done using pseudo random number technique. A robustly stable PI-controller is designed and implemented in order to control the AC motor speed. Wind-up affect due to actuator saturation is removed by implementing different schemes like Internal Model Control (IMC), full order, low order and static anti-windup compensator and practical results are compared.
{"title":"Experimental comparison of different anti-windup schemes for an AC motor speed control system","authors":"M. Rehan, Abrar Ahmed, N. Iqbal, Muhammad Shahid Nazir","doi":"10.1109/ICET.2009.5353147","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353147","url":null,"abstract":"Anti-windup compensator is an additional controller which is used to compensate the affect of saturation non-linearity often present in practical systems. This paper describes the system identification, uncertainty modeling, control and implementation of different anti-windup techniques for a computer interfaced AC motor speed control system. System identification is done using pseudo random number technique. A robustly stable PI-controller is designed and implemented in order to control the AC motor speed. Wind-up affect due to actuator saturation is removed by implementing different schemes like Internal Model Control (IMC), full order, low order and static anti-windup compensator and practical results are compared.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125535783","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353172
N. Memon, S. Gilani
Digital medical images are very easy to be modified for illegal purposes. For example malignant nodules on lung parenchyma in chest CT scan images is an important diagnostic clue, and it can be wiped of intentionally for insurance purposes or added intentionally into chest CT Scan images. In this paper we propose multiple watermarking method for authentication of medical images. CT scan images have been chosen for testing the algorithm. In order to achieve high imperceptibility, data embedding technique based on adaptive data hiding method in wavelet domain has been implemented. Experimental results show that the proposed scheme outperforms the prior works in terms of PSNR and MSE.
{"title":"Adaptive data hiding scheme for medical images using integer wavelet transform","authors":"N. Memon, S. Gilani","doi":"10.1109/ICET.2009.5353172","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353172","url":null,"abstract":"Digital medical images are very easy to be modified for illegal purposes. For example malignant nodules on lung parenchyma in chest CT scan images is an important diagnostic clue, and it can be wiped of intentionally for insurance purposes or added intentionally into chest CT Scan images. In this paper we propose multiple watermarking method for authentication of medical images. CT scan images have been chosen for testing the algorithm. In order to achieve high imperceptibility, data embedding technique based on adaptive data hiding method in wavelet domain has been implemented. Experimental results show that the proposed scheme outperforms the prior works in terms of PSNR and MSE.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125592613","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353170
M. Sarim, A. Hilton, Jean-Yves Guillemaut
Natural image matting is an interesting and difficult problem of computer vision because of its under-constrained nature. It often requires a user interaction, a trimap, to aid the algorithm in identifying the initial definite foreground and background regions. Current techniques use local or global image statistics of these definite regions to estimate the alpha matte for the undefined region. In this paper we propose a novel non-parametric template correspondence approach to estimate the alpha matte. This technique alleviates the problem of previous parametric algorithms that rely solely on colour information and hence are unable to exploit the image structure to their advantage. The proposed technique uses global and local template correspondence, to the definite know regions, to construct the background and foreground layers. Once the foreground and background colours are estimated, the final alpha matte is computed. According to the quantitative analysis against the ground truth, the proposed algorithm outperforms the current state-of-the-art parametric matting techniques.
{"title":"Alpha matte estimation of natural images using local and global template correspondence","authors":"M. Sarim, A. Hilton, Jean-Yves Guillemaut","doi":"10.1109/ICET.2009.5353170","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353170","url":null,"abstract":"Natural image matting is an interesting and difficult problem of computer vision because of its under-constrained nature. It often requires a user interaction, a trimap, to aid the algorithm in identifying the initial definite foreground and background regions. Current techniques use local or global image statistics of these definite regions to estimate the alpha matte for the undefined region. In this paper we propose a novel non-parametric template correspondence approach to estimate the alpha matte. This technique alleviates the problem of previous parametric algorithms that rely solely on colour information and hence are unable to exploit the image structure to their advantage. The proposed technique uses global and local template correspondence, to the definite know regions, to construct the background and foreground layers. Once the foreground and background colours are estimated, the final alpha matte is computed. According to the quantitative analysis against the ground truth, the proposed algorithm outperforms the current state-of-the-art parametric matting techniques.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124490572","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353161
S. A. Hussain, S. Zaman, M. Ayub
Research in the field of character recognition for Urdu script faces challenges mainly due to its characteristics, like cursive nature, multiple fonts and context dependent shapes of characters and their position with respect to the base line. This paper addresses problems recognizing Nasakh script of Urdu Language. The proposed system takes segmented character as input and recognizes them in two steps. In the first step the different shapes of each character are classifies into 33 categories using Kohonen Self-organizing Map (SOM) by auto clustering similar ligatures for initial classification. During the Feature Extraction phase more than twenty five different features are extracted from each character which are further processed for final character recognition.
{"title":"A Self Organizing Map based Urdu Nasakh character recognition","authors":"S. A. Hussain, S. Zaman, M. Ayub","doi":"10.1109/ICET.2009.5353161","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353161","url":null,"abstract":"Research in the field of character recognition for Urdu script faces challenges mainly due to its characteristics, like cursive nature, multiple fonts and context dependent shapes of characters and their position with respect to the base line. This paper addresses problems recognizing Nasakh script of Urdu Language. The proposed system takes segmented character as input and recognizes them in two steps. In the first step the different shapes of each character are classifies into 33 categories using Kohonen Self-organizing Map (SOM) by auto clustering similar ligatures for initial classification. During the Feature Extraction phase more than twenty five different features are extracted from each character which are further processed for final character recognition.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114265904","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353211
M. Bilal, M. Khan, R. Ali
Natural languages are inherently ambiguous. For a machine translation system, it is an essential task to resolve the ambiguities in the source language. Before resolution of ambiguities, their identification is an essential task. This research paper is about the classification and identification of syntactic ambiguities in Pashto text. Here, the identification is based on the parse trees build by the parser for the ambiguous phrases. An algorithm is proposed which correctly identifies syntactic ambiguities with a success rate of 64.3%.
{"title":"Identification of syntactic ambiguities in Pashto text","authors":"M. Bilal, M. Khan, R. Ali","doi":"10.1109/ICET.2009.5353211","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353211","url":null,"abstract":"Natural languages are inherently ambiguous. For a machine translation system, it is an essential task to resolve the ambiguities in the source language. Before resolution of ambiguities, their identification is an essential task. This research paper is about the classification and identification of syntactic ambiguities in Pashto text. Here, the identification is based on the parse trees build by the parser for the ambiguous phrases. An algorithm is proposed which correctly identifies syntactic ambiguities with a success rate of 64.3%.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"82 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131323787","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353187
M. A. Rizvi, A. I. Bhatti, Q. R. Butt
This paper presents the mathematical abstraction for detecting faults in a class of MIMO system where inputs are acting in a specific cyclic sequence to produce the output using hybrid modeling. Based on the proposed mathematical abstraction an algorithm is proposed for the detection of faults in these systems. The method is then applied for the problem of misfire fault detection in spark ignition engines and simulation results are provided with noise added in data.
{"title":"Fault detection in a class of hybrid system","authors":"M. A. Rizvi, A. I. Bhatti, Q. R. Butt","doi":"10.1109/ICET.2009.5353187","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353187","url":null,"abstract":"This paper presents the mathematical abstraction for detecting faults in a class of MIMO system where inputs are acting in a specific cyclic sequence to produce the output using hybrid modeling. Based on the proposed mathematical abstraction an algorithm is proposed for the detection of faults in these systems. The method is then applied for the problem of misfire fault detection in spark ignition engines and simulation results are provided with noise added in data.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124838709","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353148
M. Rehan, Abrar Ahmed, N. Iqbal
In this paper, discrete-time full and reduced order anti-windup design for general linear cascade control systems under actuator saturation constraint is considered. Based on decoupled architecture with multi-loop compensation, l2 gain reduction, discrete-time Block Diagonal Quadratic Lyapunov Function, and sector bounded-ness, LMI conditions are developed for full and reduced order anti-windup design which guarantees the stability and performance of overall closed-loop system. Results are demonstrated through a simulation example from process control.
{"title":"Discrete-time full and reduced order anti-windup compensator synthesis for constraint cascade control systems: An LMI based approach","authors":"M. Rehan, Abrar Ahmed, N. Iqbal","doi":"10.1109/ICET.2009.5353148","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353148","url":null,"abstract":"In this paper, discrete-time full and reduced order anti-windup design for general linear cascade control systems under actuator saturation constraint is considered. Based on decoupled architecture with multi-loop compensation, l2 gain reduction, discrete-time Block Diagonal Quadratic Lyapunov Function, and sector bounded-ness, LMI conditions are developed for full and reduced order anti-windup design which guarantees the stability and performance of overall closed-loop system. Results are demonstrated through a simulation example from process control.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125013763","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353156
K. Iqbal
In this paper different configurations of the MIMO systems have been used to analyze the performance in terms of BER of the system with and without co-channel interference cancellation techniques under various channel conditions using spatial channel model. All the simulations for different systems have been implemented in Matlab to carry out the comparative analysis of Bell labs layered space time (BLAST) MIMO systems. Simulation results are implemented along-with the result analysis giving the advantage of antenna diversity achieved at receiving end by increasing the number of antennas. Basically two models with different number of antennas at receiving end are implemented and the main objective of this paper is extensive use of realistic Spatial Channel model offering three propagation scenarios such as suburban macro-cell, urban macro-cell and urban micro-cell. Urban micro-cellular environment is further differentiated into line of sight (LOS) and non line of sight (NLOS) propagation. The ultimate aim of implementation is to increase the throughput by exploiting diversity at receiving end and same is achieved by LST systems where data rate is improved with more number of antenna elements at receiving end but BER performance is not improved. It is even observed from the simulations that overall LST systems using successive interference cancellation technique that cancels the effect of co-channel interference because of transmit antennas have better BER performance than systems where interference cancellation is not carried out. For the purpose of interference cancellation the ranking of received signal is required to be done that is based on the value of SNR. A signal with highest SNR is at highest priority as compared to other having lower SNR. This ranking of signal based on highest SNR is carried out by implementation of novel successive interference cancellation algorithm.
{"title":"Exploitation of space diversity using SCM to increase the data rate by MIMO technology and analysis of system's performance on the basis of BER","authors":"K. Iqbal","doi":"10.1109/ICET.2009.5353156","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353156","url":null,"abstract":"In this paper different configurations of the MIMO systems have been used to analyze the performance in terms of BER of the system with and without co-channel interference cancellation techniques under various channel conditions using spatial channel model. All the simulations for different systems have been implemented in Matlab to carry out the comparative analysis of Bell labs layered space time (BLAST) MIMO systems. Simulation results are implemented along-with the result analysis giving the advantage of antenna diversity achieved at receiving end by increasing the number of antennas. Basically two models with different number of antennas at receiving end are implemented and the main objective of this paper is extensive use of realistic Spatial Channel model offering three propagation scenarios such as suburban macro-cell, urban macro-cell and urban micro-cell. Urban micro-cellular environment is further differentiated into line of sight (LOS) and non line of sight (NLOS) propagation. The ultimate aim of implementation is to increase the throughput by exploiting diversity at receiving end and same is achieved by LST systems where data rate is improved with more number of antenna elements at receiving end but BER performance is not improved. It is even observed from the simulations that overall LST systems using successive interference cancellation technique that cancels the effect of co-channel interference because of transmit antennas have better BER performance than systems where interference cancellation is not carried out. For the purpose of interference cancellation the ranking of received signal is required to be done that is based on the value of SNR. A signal with highest SNR is at highest priority as compared to other having lower SNR. This ranking of signal based on highest SNR is carried out by implementation of novel successive interference cancellation algorithm.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123761979","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353129
Haseeb Aslam Butt, Taufeeq Elahi
This paper presents a working methodology for automatically turning off the sound system of a car in presence of an incoming or outgoing call, for/by any mobile phone aboard the vehicle. The device also automatically resumes the sound system once the call has ended. Its intelligent programming prevents unwanted interruptions on SMS or missed calls.
{"title":"Car audio interruption and resumption control based on activity in cellular band","authors":"Haseeb Aslam Butt, Taufeeq Elahi","doi":"10.1109/ICET.2009.5353129","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353129","url":null,"abstract":"This paper presents a working methodology for automatically turning off the sound system of a car in presence of an incoming or outgoing call, for/by any mobile phone aboard the vehicle. The device also automatically resumes the sound system once the call has ended. Its intelligent programming prevents unwanted interruptions on SMS or missed calls.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130363579","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353132
Y. A. Malkani, Lachhman Das Dhomeja
Secure Device Association (also known as security initialization, first-connect or simply pairing in the literature) can be referred as the process of establishing a secure channel between a pair of devices in close proximity. There have been many recent proposals to provide secure pairing of devices in close proximity. All vary in their security against different attacks, the needed hardware capabilities and the necessary level of user attention. In a world of heterogeneous devices and requirements, we need mechanisms to allow automated selection of the best device association protocols without requiring the user to have an in-depth knowledge of the minutiae of the underlying technologies. Further, these mechanisms should facilitate unobtrusive device identification, matching of pairing techniques to requirements, chains of communication to bridge between devices of different capability and improved security by combining techniques where possible. In this paper, we present research trends and issues in the area of secure device association for ad hoc and ubiquitous computing environments followed by a short survey of the existing methods.
{"title":"Secure device association for ad hoc and ubiquitous computing environments","authors":"Y. A. Malkani, Lachhman Das Dhomeja","doi":"10.1109/ICET.2009.5353132","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353132","url":null,"abstract":"Secure Device Association (also known as security initialization, first-connect or simply pairing in the literature) can be referred as the process of establishing a secure channel between a pair of devices in close proximity. There have been many recent proposals to provide secure pairing of devices in close proximity. All vary in their security against different attacks, the needed hardware capabilities and the necessary level of user attention. In a world of heterogeneous devices and requirements, we need mechanisms to allow automated selection of the best device association protocols without requiring the user to have an in-depth knowledge of the minutiae of the underlying technologies. Further, these mechanisms should facilitate unobtrusive device identification, matching of pairing techniques to requirements, chains of communication to bridge between devices of different capability and improved security by combining techniques where possible. In this paper, we present research trends and issues in the area of secure device association for ad hoc and ubiquitous computing environments followed by a short survey of the existing methods.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132709274","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
扫码关注我们
求助内容：
应助结果提醒方式：