Pub Date : 2013-11-01DOI: 10.1109/ICCSCE.2013.6720007
M. N. Mansor, Mohd Nazri Rejab
Most of infant pain cause changes in the face. Clinicians use image analysis to characterize the pathological faces. Nowadays, infant pain research is increasing dramatically due to high demand from all medical team. This paper presents a sparse and naïve Bayes classifier for the diagnosis of infant pain disorders. Phase congruency image and local binary pattern are proposed. The proposed algorithms provide very promising classification rate.
{"title":"Phase congruency image and sparse classifier for newborn classifying pain state","authors":"M. N. Mansor, Mohd Nazri Rejab","doi":"10.1109/ICCSCE.2013.6720007","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6720007","url":null,"abstract":"Most of infant pain cause changes in the face. Clinicians use image analysis to characterize the pathological faces. Nowadays, infant pain research is increasing dramatically due to high demand from all medical team. This paper presents a sparse and naïve Bayes classifier for the diagnosis of infant pain disorders. Phase congruency image and local binary pattern are proposed. The proposed algorithms provide very promising classification rate.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"30 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120972836","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6719984
Emre Dincel, U. Yildirim, M. T. Söylemez
Systems with inverse response are difficult to be identified because of the existence of at least one zero at the right half s-plane. However, it is important to obtain the transfer function as accurately as possible for such systems to be able to provide the desired performance using a controller. If the system has dead-time, the design problem becomes more complicated. This paper presents a new modeling method for under-damped second order systems with an inverse response to overcome the difficulties both in the analysis and design. Besides, a PID controller design in discrete-time domain is also introduced to provide a good performance in the closed-loop. The performance of the proposed modeling and control technique is demonstrated on an example using simulations.
{"title":"Modeling and control of under-damped second order systems with dead-time and inverse response","authors":"Emre Dincel, U. Yildirim, M. T. Söylemez","doi":"10.1109/ICCSCE.2013.6719984","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6719984","url":null,"abstract":"Systems with inverse response are difficult to be identified because of the existence of at least one zero at the right half s-plane. However, it is important to obtain the transfer function as accurately as possible for such systems to be able to provide the desired performance using a controller. If the system has dead-time, the design problem becomes more complicated. This paper presents a new modeling method for under-damped second order systems with an inverse response to overcome the difficulties both in the analysis and design. Besides, a PID controller design in discrete-time domain is also introduced to provide a good performance in the closed-loop. The performance of the proposed modeling and control technique is demonstrated on an example using simulations.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123528590","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6720014
Leow Ching Leong, K. S. Gan, Tse Guan Tan, C. K. On, R. Alfred, P. Anthony
In this paper, we describe the results of implementing Genetic Programming (GP) using two different Artificial Neural Networks (ANN) topologies in a customized Tower Defense (TD) games. The ANNs used are (1) Feed-forward Neural Network (FFNN) and (2) Elman-Recurrent Neural Network (ERNN). TD game is one of the strategy game genres. Players are required to build towers in order to prevent the creeps from reaching their bases. Lives will be deducted if any creeps manage to reach the base. In this research, a map will be designed. The AI method used will self-synthesize and analyze the level of difficulty of the designed map. The GP acts as a tuner of the weights in ANNs. The ANNs will act as players to block the creeps from reaching the base. The map will then be evaluated by the ANNs in the testing phase. Our findings showed that GP works well with ERNN compared to GP with FFNN.
{"title":"Self-synthesized controllers for tower defense game using genetic programming","authors":"Leow Ching Leong, K. S. Gan, Tse Guan Tan, C. K. On, R. Alfred, P. Anthony","doi":"10.1109/ICCSCE.2013.6720014","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6720014","url":null,"abstract":"In this paper, we describe the results of implementing Genetic Programming (GP) using two different Artificial Neural Networks (ANN) topologies in a customized Tower Defense (TD) games. The ANNs used are (1) Feed-forward Neural Network (FFNN) and (2) Elman-Recurrent Neural Network (ERNN). TD game is one of the strategy game genres. Players are required to build towers in order to prevent the creeps from reaching their bases. Lives will be deducted if any creeps manage to reach the base. In this research, a map will be designed. The AI method used will self-synthesize and analyze the level of difficulty of the designed map. The GP acts as a tuner of the weights in ANNs. The ANNs will act as players to block the creeps from reaching the base. The map will then be evaluated by the ANNs in the testing phase. Our findings showed that GP works well with ERNN compared to GP with FFNN.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115053391","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6719999
R. A. Fayadh, F. Malek, H. Fadhil, N. Saudin
The UWB is 7.5 GHz (from 3.1 GHz to 10.6 GHz) was defined by Federal Communications Commission (FCC) for high data rate wireless communication systems. This band needs special and active antenna for transmission and reception of wideband signals. So that, the design of UWB antenna plays very important role in indoor and outdoor wireless systems. Because of more challenges toward the wireless communication, i.e., inter-symbol interference, multi-access interference, and narrow band system interference, the UWB antenna should have the capability of operation during these challenges. The notched microstrip patch antenna was designed using CST microwave studio with limited dimensions and the results are accepted for the UWB that was allocated by FCC. The proposed antenna was fabricated on printed circuit board (PCB) with same dimensions and analysis. Taconic TLY-5 substrate material was used in this small size antenna to give low cost and lighter than those made of FR4 substrate material. The measured results are nearly identical with those of simulation for return loss (S11) and voltage standing wave ratio (VSWR). The simulated radiation patterns are nearly omni-directional radiations over the UWB bandwidth.
{"title":"Design of ultra wideband rectangular microstrip notched patch antenna","authors":"R. A. Fayadh, F. Malek, H. Fadhil, N. Saudin","doi":"10.1109/ICCSCE.2013.6719999","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6719999","url":null,"abstract":"The UWB is 7.5 GHz (from 3.1 GHz to 10.6 GHz) was defined by Federal Communications Commission (FCC) for high data rate wireless communication systems. This band needs special and active antenna for transmission and reception of wideband signals. So that, the design of UWB antenna plays very important role in indoor and outdoor wireless systems. Because of more challenges toward the wireless communication, i.e., inter-symbol interference, multi-access interference, and narrow band system interference, the UWB antenna should have the capability of operation during these challenges. The notched microstrip patch antenna was designed using CST microwave studio with limited dimensions and the results are accepted for the UWB that was allocated by FCC. The proposed antenna was fabricated on printed circuit board (PCB) with same dimensions and analysis. Taconic TLY-5 substrate material was used in this small size antenna to give low cost and lighter than those made of FR4 substrate material. The measured results are nearly identical with those of simulation for return loss (S11) and voltage standing wave ratio (VSWR). The simulated radiation patterns are nearly omni-directional radiations over the UWB bandwidth.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114331959","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6719967
M. N. Mansor, Mohd Nazri Rejab
This paper discussed the crucial demand regarding the scheme to translate the silence voice from the newborn. The infant can't afford to express their feeling of pain by voice. Hence, we proudly present an infant pain recognition system to overcome this matter. We employed the Single Scale Retinex (SSR) to remove the illumination level. Secondly, Gray-Level Co-occurrence Matrix (GLCM) was adopted as the feature extraction. We determine the condition of the infants (pain/no pain) with Hybrid Genetic Algorithm Neural Network (GANN) and Linear Discriminant Analysis (LDA). Several examples were conducted to evaluate the performance of the proposed method under different illumination levels.
{"title":"Infant pain recognition system with GLCM features and GANN under unstructed lighting condition","authors":"M. N. Mansor, Mohd Nazri Rejab","doi":"10.1109/ICCSCE.2013.6719967","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6719967","url":null,"abstract":"This paper discussed the crucial demand regarding the scheme to translate the silence voice from the newborn. The infant can't afford to express their feeling of pain by voice. Hence, we proudly present an infant pain recognition system to overcome this matter. We employed the Single Scale Retinex (SSR) to remove the illumination level. Secondly, Gray-Level Co-occurrence Matrix (GLCM) was adopted as the feature extraction. We determine the condition of the infants (pain/no pain) with Hybrid Genetic Algorithm Neural Network (GANN) and Linear Discriminant Analysis (LDA). Several examples were conducted to evaluate the performance of the proposed method under different illumination levels.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115079836","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6719928
Ying-Jen Chen, Motoyasu Tanaka, Kazuo Tanaka, Hua O. Wang
This paper proposes two stability criteria for polynomial fuzzy systems by applying minimum-type and maximum-type piecewise polynomial Lyapunov functions (PPLFs) respectively. Piecewise Lyapunov functions and polynomial Lyapunov functions (PLFs) have been utilized to the stability analysis for fuzzy-model-based (FMB) control systems to obtain relaxed results in literature. However, the minimum-type and maximum-type PPLFs have not been employed to analyze the stability of FMB control systems. Therefore, this paper applies the minimum-type and maximum-type PPLFs to the stability analysis of polynomial FMB control systems. Two relaxed stability criteria represented in terms of bilinear sum-of-squares (SOS) conditions are proposed. The proposed stability criteria are represented in terms of bilinear SOS conditions that cannot be directly solved by the mathematical tools of solving SOS optimization problem (e.g. SOSTOOLS and SOSOPT). Therefore, the path-following method that has been shown to be effective for the nonconvex bilinear matrix inequality problem is employed for solving the bilinear SOS problem of the proposed stability criteria. A numerical example is provided to demonstrate the relaxation of the proposed stability criteria.
{"title":"Piecewise polynomial lyapunov functions based stability analysis for polynomial fuzzy systems","authors":"Ying-Jen Chen, Motoyasu Tanaka, Kazuo Tanaka, Hua O. Wang","doi":"10.1109/ICCSCE.2013.6719928","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6719928","url":null,"abstract":"This paper proposes two stability criteria for polynomial fuzzy systems by applying minimum-type and maximum-type piecewise polynomial Lyapunov functions (PPLFs) respectively. Piecewise Lyapunov functions and polynomial Lyapunov functions (PLFs) have been utilized to the stability analysis for fuzzy-model-based (FMB) control systems to obtain relaxed results in literature. However, the minimum-type and maximum-type PPLFs have not been employed to analyze the stability of FMB control systems. Therefore, this paper applies the minimum-type and maximum-type PPLFs to the stability analysis of polynomial FMB control systems. Two relaxed stability criteria represented in terms of bilinear sum-of-squares (SOS) conditions are proposed. The proposed stability criteria are represented in terms of bilinear SOS conditions that cannot be directly solved by the mathematical tools of solving SOS optimization problem (e.g. SOSTOOLS and SOSOPT). Therefore, the path-following method that has been shown to be effective for the nonconvex bilinear matrix inequality problem is employed for solving the bilinear SOS problem of the proposed stability criteria. A numerical example is provided to demonstrate the relaxation of the proposed stability criteria.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115418622","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6719959
A. Abdulrazzaq, N. Rashid, Ayad Hussain Abdulkader Alezzi
The advancement of computer hardware has opened up new challenges to algorithms experts. One of the challenges is designing new algorithm that exploit the parallel nature of the new architecture of current computer hardware. In this study, we redesign the hybrid exact string matching algorithm named AKRAM on parallel platform with the goal of speeding up the algorithm. The parallel of this algorithm showed optimal results, in parallel time, speed up, efficiency and percentage of performance gain when compared to the sequential version. The result demonstrated that the performance of both parallelized and sequential of AKRAM algorithm was influenced by type of data. The DNA sequence showed the highest performance than other data types after parallelization.
{"title":"Parallel processing of hybrid exact string matching algorithm","authors":"A. Abdulrazzaq, N. Rashid, Ayad Hussain Abdulkader Alezzi","doi":"10.1109/ICCSCE.2013.6719959","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6719959","url":null,"abstract":"The advancement of computer hardware has opened up new challenges to algorithms experts. One of the challenges is designing new algorithm that exploit the parallel nature of the new architecture of current computer hardware. In this study, we redesign the hybrid exact string matching algorithm named AKRAM on parallel platform with the goal of speeding up the algorithm. The parallel of this algorithm showed optimal results, in parallel time, speed up, efficiency and percentage of performance gain when compared to the sequential version. The result demonstrated that the performance of both parallelized and sequential of AKRAM algorithm was influenced by type of data. The DNA sequence showed the highest performance than other data types after parallelization.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127500390","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6719927
Eman T. Hassan, Hazem M. Abbas, H. K. Mohamed
We present a new inpainting algorithm that is based on image segmentation and segment classification. First, we employ the mean shift algorithm to segment the input image. Then, we divide the original inpainting problem to be either one of the two problems: Large Segment Inpainting problem or Non-uniform Segments inpainting problem. The reason we do that is that human eye is more discerning to the errors in the structure and texture propagation of a large-uniform regions with less details while it is less discerning to errors in non-uniform regions with more details. We propose a novel algorithm for each one of the problems- Large Segment Inpainting and Non-uniform Segments inpainting- according to the main features of each one. The experimental results show the advantage of our technique which produces output images with better perceived visual quality.
{"title":"Image inpainting based on image segmentation and segment classification","authors":"Eman T. Hassan, Hazem M. Abbas, H. K. Mohamed","doi":"10.1109/ICCSCE.2013.6719927","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6719927","url":null,"abstract":"We present a new inpainting algorithm that is based on image segmentation and segment classification. First, we employ the mean shift algorithm to segment the input image. Then, we divide the original inpainting problem to be either one of the two problems: Large Segment Inpainting problem or Non-uniform Segments inpainting problem. The reason we do that is that human eye is more discerning to the errors in the structure and texture propagation of a large-uniform regions with less details while it is less discerning to errors in non-uniform regions with more details. We propose a novel algorithm for each one of the problems- Large Segment Inpainting and Non-uniform Segments inpainting- according to the main features of each one. The experimental results show the advantage of our technique which produces output images with better perceived visual quality.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126427183","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6719939
Saeed Mohammadloo, M. Arbabmir, H. G. Asl
In this paper we present a new landmark initialization technique for Bearing-Only Simultaneous Localization and Mapping (SLAM) algorithm. The initialization scheme is a type of the delayed constrained initialization method and is different from previous approaches. In our work, it is shown that the angle between sequential observations measured by a bearing-only sensor such as pan-tilt camera and the distance between the vehicle and landmark plays an important role in landmark localization accuracy. Considering this fact, a proper constrained function that utilizes the rotation angle of the camera is applied between multiple landmark location estimates and the best estimate is selected. The simulation results show that the proposed technique is capable to pick out the best initial estimate for landmark location and improves the accuracy of state estimates in Bearing-Only SLAM.
在本文中，我们提出了一种新的地标初始化技术，用于仅轴承同步定位和绘图（SLAM）算法。该初始化方案是延迟约束初始化方法的一种，与以往的方法不同。我们的研究表明，由方位传感器（如云台相机）测得的连续观测值与车辆和地标之间的距离之间的角度对地标定位精度起着重要作用。考虑到这一事实，在多个地标位置估计值之间应用了一个利用摄像头旋转角度的适当约束函数，并选出了最佳估计值。仿真结果表明，所提出的技术能够选出地标定位的最佳初始估计值，并提高了仅有轴承的 SLAM 中状态估计的准确性。
{"title":"New constrained initialization for bearing-only SLAM","authors":"Saeed Mohammadloo, M. Arbabmir, H. G. Asl","doi":"10.1109/ICCSCE.2013.6719939","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6719939","url":null,"abstract":"In this paper we present a new landmark initialization technique for Bearing-Only Simultaneous Localization and Mapping (SLAM) algorithm. The initialization scheme is a type of the delayed constrained initialization method and is different from previous approaches. In our work, it is shown that the angle between sequential observations measured by a bearing-only sensor such as pan-tilt camera and the distance between the vehicle and landmark plays an important role in landmark localization accuracy. Considering this fact, a proper constrained function that utilizes the rotation angle of the camera is applied between multiple landmark location estimates and the best estimate is selected. The simulation results show that the proposed technique is capable to pick out the best initial estimate for landmark location and improves the accuracy of state estimates in Bearing-Only SLAM.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125974268","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 : 2013-11-01DOI: 10.1109/ICCSCE.2013.6719966
A. Ali
Iris pattern is the region on human eye that generally used for identifying person. The pattern is unique for each person and must be transformed into a representation that gives meaning to the textures. However, this process could be hampered if the given image has poor contrast of intensity level. This paper suggests an approach to enhance the image in order to obtain abundant iris texture. First, using common method of segmentation, the iris region is localized and transformed to rectangular form. Then, we apply the moving average on the image to reduce random noise. At this stage, an amendment will be imposed to produce uniform gray levels distribution. After that, histogram equalization method will be applied to produce equalized contrast and more embellish iris pattern. Finally, this enhanced image is used to produce one dimensional real value as iris signature. Support Vector Machines (SVM) is used to classify the iris images and the results are promising.
{"title":"Simple features generation method for SVM based iris classification","authors":"A. Ali","doi":"10.1109/ICCSCE.2013.6719966","DOIUrl":"https://doi.org/10.1109/ICCSCE.2013.6719966","url":null,"abstract":"Iris pattern is the region on human eye that generally used for identifying person. The pattern is unique for each person and must be transformed into a representation that gives meaning to the textures. However, this process could be hampered if the given image has poor contrast of intensity level. This paper suggests an approach to enhance the image in order to obtain abundant iris texture. First, using common method of segmentation, the iris region is localized and transformed to rectangular form. Then, we apply the moving average on the image to reduce random noise. At this stage, an amendment will be imposed to produce uniform gray levels distribution. After that, histogram equalization method will be applied to produce equalized contrast and more embellish iris pattern. Finally, this enhanced image is used to produce one dimensional real value as iris signature. Support Vector Machines (SVM) is used to classify the iris images and the results are promising.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126014836","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
扫码关注我们
求助内容：
应助结果提醒方式：