A novel license plate locating approach based on the color and texture features is presented. Firstly, the input image is converted to the hue-saturation-intensity (HSI) color space. Then a target image is obtained by applying a sequence of image processing techniques to the hue and saturation component images. After that, the space-pixel histogram of the target image is analyzed and mathematically modeled, so that the horizontal candidate is extracted. Finally, discrete wavelet transform is performed on the candidate, and the sum of the first order difference of the DWT subimages highlights the texture information of the LP area, telling the precise position of the license plate. The proposed algorithm focuses on combining the color features with the texture features, improving the locating reliability. Experiment was conducted on a database of 332 images taken from various illumination situations. The license plate detecting rate of success is as high as 96.4%.
{"title":"A Color and Texture Feature Based Approach to License Plate Location","authors":"Jia Li, Mei Xie","doi":"10.1109/CIS.2007.71","DOIUrl":"https://doi.org/10.1109/CIS.2007.71","url":null,"abstract":"A novel license plate locating approach based on the color and texture features is presented. Firstly, the input image is converted to the hue-saturation-intensity (HSI) color space. Then a target image is obtained by applying a sequence of image processing techniques to the hue and saturation component images. After that, the space-pixel histogram of the target image is analyzed and mathematically modeled, so that the horizontal candidate is extracted. Finally, discrete wavelet transform is performed on the candidate, and the sum of the first order difference of the DWT subimages highlights the texture information of the LP area, telling the precise position of the license plate. The proposed algorithm focuses on combining the color features with the texture features, improving the locating reliability. Experiment was conducted on a database of 332 images taken from various illumination situations. The license plate detecting rate of success is as high as 96.4%.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132428666","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}
Recently, numerous Multiobjective Evolutionary Algorithms (MOEAs) have been presented to solve real life problems. However, a number of issues still remain with regards to MOEAs such as convergence to the true Pareto front as well as scalability to many objective problems rather than just bi-objective problems. The performance of these algorithms may be augmented by incorporating the coevolutionary concept. Hence, in this paper, a new algorithm for multiobjective optimization called SPEA2-CC is illustrated. SPEA2-CC combines an MOEA, Strength Pareto Evolutionary Algorithm 2 (SPEA2) with Cooperative Coevolution (CC). Scalability tests have been conducted to evaluate and compare the SPEA2- CC against the original SPEA2 for seven DTLZ test problems with a set of objectives (3 to 5 objectives). The results show clearly that the performance scalability of SPEA2-CC was significantly better compared to the original SPEA2 as the number of objectives becomes higher.
{"title":"Performance Scalability of a Cooperative Coevolution Multiobjective Evolutionary Algorithm","authors":"Tse Guan Tan, J. Teo, H. Lau","doi":"10.1109/CIS.2007.181","DOIUrl":"https://doi.org/10.1109/CIS.2007.181","url":null,"abstract":"Recently, numerous Multiobjective Evolutionary Algorithms (MOEAs) have been presented to solve real life problems. However, a number of issues still remain with regards to MOEAs such as convergence to the true Pareto front as well as scalability to many objective problems rather than just bi-objective problems. The performance of these algorithms may be augmented by incorporating the coevolutionary concept. Hence, in this paper, a new algorithm for multiobjective optimization called SPEA2-CC is illustrated. SPEA2-CC combines an MOEA, Strength Pareto Evolutionary Algorithm 2 (SPEA2) with Cooperative Coevolution (CC). Scalability tests have been conducted to evaluate and compare the SPEA2- CC against the original SPEA2 for seven DTLZ test problems with a set of objectives (3 to 5 objectives). The results show clearly that the performance scalability of SPEA2-CC was significantly better compared to the original SPEA2 as the number of objectives becomes higher.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"180 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116704767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A new test cases generation approach is presented which based on UML sequence diagrams and Object Constraint Language (OCL). In this approach, a tree representation of sequence diagrams is constructed. Firstly traversal of the constructed tree for selecting conditional predicates from the sequence diagram is carried out. Then, post- and precondition is described by OCL. We transform the conditional predicates on the sequence diagram and apply function minimization technique to generate the test data. The generated test cases achieve message paths coverage and constraint attribute coverage of all objects which relate to the message. Lastly, the results of experiments show that this method has a better performance.
{"title":"Test Case Automate Generation from UML Sequence Diagram and OCL Expression","authors":"Bao-Lin Li, Zhi-Shu Li, Li Qing, Yan-Hong Chen","doi":"10.1109/CIS.2007.150","DOIUrl":"https://doi.org/10.1109/CIS.2007.150","url":null,"abstract":"A new test cases generation approach is presented which based on UML sequence diagrams and Object Constraint Language (OCL). In this approach, a tree representation of sequence diagrams is constructed. Firstly traversal of the constructed tree for selecting conditional predicates from the sequence diagram is carried out. Then, post- and precondition is described by OCL. We transform the conditional predicates on the sequence diagram and apply function minimization technique to generate the test data. The generated test cases achieve message paths coverage and constraint attribute coverage of all objects which relate to the message. Lastly, the results of experiments show that this method has a better performance.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121999702","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}
Based on the characteristics of optimal operation of cascaded hydropower stations, a mathematic model about the multistage optimization is established. In order to improve the capability of the traditional algorithm in optimal operation of cascaded reservoirs, Niche Genetic Algorithm (NGA) is suggested. This method could avoid the situation of GA convergence at a much earlier stage. The validity of improvement algorithm is testified by the solution of three classic functions. Finally it is successfully applied to the cascaded hydropower stations of the Qing River. The results show that NGA has not only better optimization capability, but also better accuracy. It is a superior non-linear optimal method which could locally search the global solution with greater probability.
{"title":"An Improved Genetic Algorithm for Optimal Operation of Cascaded Reservoirs","authors":"Na Li, Ya-dong Mei","doi":"10.1109/CIS.2007.50","DOIUrl":"https://doi.org/10.1109/CIS.2007.50","url":null,"abstract":"Based on the characteristics of optimal operation of cascaded hydropower stations, a mathematic model about the multistage optimization is established. In order to improve the capability of the traditional algorithm in optimal operation of cascaded reservoirs, Niche Genetic Algorithm (NGA) is suggested. This method could avoid the situation of GA convergence at a much earlier stage. The validity of improvement algorithm is testified by the solution of three classic functions. Finally it is successfully applied to the cascaded hydropower stations of the Qing River. The results show that NGA has not only better optimization capability, but also better accuracy. It is a superior non-linear optimal method which could locally search the global solution with greater probability.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124715543","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}
Fairness and non-repudiation turn out to be increasingly important security services with the fast growth of electronic commerce on the Internet. We have made some game based analysis of multi-party non-repudiation protocols recently. We use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure. Fairness and non-repudiation of the MK multi-party non-repudiation protocol are automated analyzed by using Mocha, a model-checker that supports the alternating transition systems and the alternating temporal logic. Finally we have made some improvement of the protocol which enable it to have fairness and non-repudiation.
{"title":"Game-Based Analysis of Multi-Party Non-Repudiation Protocols","authors":"Wang Xueming, Li Xiang","doi":"10.1109/CIS.2007.142","DOIUrl":"https://doi.org/10.1109/CIS.2007.142","url":null,"abstract":"Fairness and non-repudiation turn out to be increasingly important security services with the fast growth of electronic commerce on the Internet. We have made some game based analysis of multi-party non-repudiation protocols recently. We use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure. Fairness and non-repudiation of the MK multi-party non-repudiation protocol are automated analyzed by using Mocha, a model-checker that supports the alternating transition systems and the alternating temporal logic. Finally we have made some improvement of the protocol which enable it to have fairness and non-repudiation.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124768303","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}
Partial fingerprint recognition is an important challenge especially when the partial image does not include singular points such as core and delta. In this paper, we propose a new localized feature named combined feature for partial fingerprint recognition. The combined feature combines the information of every two minutiae of the image and the ridges structure between them. This feature is defined based on the minutiae including ridge endings and bifurcations. The combined feature is invariant with respect to the global transformations such as rotation and transformation. The recognition is performed in three steps: minutiae extraction, combined features extraction and matching. Experimental results on FVC2004 show efficiency and accuracy of the proposed method.
{"title":"A Combined Feature for Fingerprint Recognition","authors":"M. Abdoos, N. Mozayani","doi":"10.1109/CIS.2007.218","DOIUrl":"https://doi.org/10.1109/CIS.2007.218","url":null,"abstract":"Partial fingerprint recognition is an important challenge especially when the partial image does not include singular points such as core and delta. In this paper, we propose a new localized feature named combined feature for partial fingerprint recognition. The combined feature combines the information of every two minutiae of the image and the ridges structure between them. This feature is defined based on the minutiae including ridge endings and bifurcations. The combined feature is invariant with respect to the global transformations such as rotation and transformation. The recognition is performed in three steps: minutiae extraction, combined features extraction and matching. Experimental results on FVC2004 show efficiency and accuracy of the proposed method.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124121218","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}
Multi-relational data mining can be categorized into graph-based and logic-based approaches. In this paper, we propose some optimizations for mining graph databases with Subdue, which is one of the earliest and most effective graph-based relational learning algorithms. The optimizations improve the subgraph isomorphism computation and reduce the numbers of subgraph isomorphism testing, which are the major source of complexity in Subdue. Experimental results indicate that the improved algorithm is much more efficient than the original one.
{"title":"An Efficient Graph-Based Multi-Relational Data Mining Algorithm","authors":"Jingfeng Guo, Lizhen Zheng, Tieying Li","doi":"10.1109/CIS.2007.118","DOIUrl":"https://doi.org/10.1109/CIS.2007.118","url":null,"abstract":"Multi-relational data mining can be categorized into graph-based and logic-based approaches. In this paper, we propose some optimizations for mining graph databases with Subdue, which is one of the earliest and most effective graph-based relational learning algorithms. The optimizations improve the subgraph isomorphism computation and reduce the numbers of subgraph isomorphism testing, which are the major source of complexity in Subdue. Experimental results indicate that the improved algorithm is much more efficient than the original one.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128630282","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}
Current watermark models cannot reflect the conflicting relationship among cover fidelity, watermark robustness and watermark capacity. And there is no effective guidance for designing robust watermark algorithms in content security applications, such as the copyright protection. A robust watermark model based on subliminal channel for content security applications is proposed. In this model, the half- symmetry of watermark communication is pointed out. Based on the model, the approaches to solve the conflicting relationship are presented as to increase entropy of cover, to decrease entropy of watermark message and to increase mutual information between cover and watermark through cover transformation, watermark encoding, public and subliminal channel encoding. The conditions and methods of the cover transformation and watermark encoding are presented. This model and its approaches will offer theory guidance for researches on robust watermark algorithms in content security applications.
{"title":"Robust Watermark Model Based on Subliminal Channel","authors":"Cheng Yang, Jianbo Liu, Yaqing Niu","doi":"10.1109/CIS.2007.63","DOIUrl":"https://doi.org/10.1109/CIS.2007.63","url":null,"abstract":"Current watermark models cannot reflect the conflicting relationship among cover fidelity, watermark robustness and watermark capacity. And there is no effective guidance for designing robust watermark algorithms in content security applications, such as the copyright protection. A robust watermark model based on subliminal channel for content security applications is proposed. In this model, the half- symmetry of watermark communication is pointed out. Based on the model, the approaches to solve the conflicting relationship are presented as to increase entropy of cover, to decrease entropy of watermark message and to increase mutual information between cover and watermark through cover transformation, watermark encoding, public and subliminal channel encoding. The conditions and methods of the cover transformation and watermark encoding are presented. This model and its approaches will offer theory guidance for researches on robust watermark algorithms in content security applications.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130760512","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 : 2007-12-15DOI: 10.1142/S0218001409007065
S. Soltani, A. Barforoush
Transferring the current Websites to Semantic Websites, using ontology population, is a research area within which classification has the main role. The existing classification algorithms and single level execution of them are insufficient on web data. Moreover, because of the variety in the context and structure of even common domain Websites, there is a lack of training data. In this paper we had three experiences: 1- using information in domain ontology about the layers of classes to train classifiers (layered classification) with improvement up to 10% on accuracy of classification. 2- experience on problem of training dataset and using clustering as a preprocess. 3- using ensembles to benefit from both two methods. Beside the improvement of accuracy from these experiences, we found out that with ensemble we can dispense with the algorithm of classification and use a simple classification like Naïve Bayes and have the accuracy of complex algorithms like SVM.
{"title":"Web pages Classification Using Domain Ontology and Clustering","authors":"S. Soltani, A. Barforoush","doi":"10.1142/S0218001409007065","DOIUrl":"https://doi.org/10.1142/S0218001409007065","url":null,"abstract":"Transferring the current Websites to Semantic Websites, using ontology population, is a research area within which classification has the main role. The existing classification algorithms and single level execution of them are insufficient on web data. Moreover, because of the variety in the context and structure of even common domain Websites, there is a lack of training data. In this paper we had three experiences: 1- using information in domain ontology about the layers of classes to train classifiers (layered classification) with improvement up to 10% on accuracy of classification. 2- experience on problem of training dataset and using clustering as a preprocess. 3- using ensembles to benefit from both two methods. Beside the improvement of accuracy from these experiences, we found out that with ensemble we can dispense with the algorithm of classification and use a simple classification like Naïve Bayes and have the accuracy of complex algorithms like SVM.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130478119","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}
In constrained optimization problems, evolutionary algorithms often utilize a penalty function to deal with constraints, which is, however, difficult to control the penalty parameters. To overcome this shortcoming, this paper presents a new constraint handling scheme. Firstly, a new fitness function defined by this penalty function and the objective function is designed. The new fitness function not only can classify all individuals in current population into different layers automatically, but also can distinguish solutions effectively from different layers. Meanwhile, a new crossover operator is also proposed which can produce more high quality individuals. Based on these, a new evolutionary algorithm for constrained optimization problems is proposed. The simulations are made on five widely used benchmark problems, and the results indicate the proposed algorithm is effective.
{"title":"A New Evolutionary Algorithm for Constrained Optimization Problems","authors":"Yi Hu, Yuping Wang","doi":"10.1109/CIS.2007.199","DOIUrl":"https://doi.org/10.1109/CIS.2007.199","url":null,"abstract":"In constrained optimization problems, evolutionary algorithms often utilize a penalty function to deal with constraints, which is, however, difficult to control the penalty parameters. To overcome this shortcoming, this paper presents a new constraint handling scheme. Firstly, a new fitness function defined by this penalty function and the objective function is designed. The new fitness function not only can classify all individuals in current population into different layers automatically, but also can distinguish solutions effectively from different layers. Meanwhile, a new crossover operator is also proposed which can produce more high quality individuals. Based on these, a new evolutionary algorithm for constrained optimization problems is proposed. The simulations are made on five widely used benchmark problems, and the results indicate the proposed algorithm is effective.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780250","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
扫码关注我们
求助内容：
应助结果提醒方式：