Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361091
Deng Zhang, J. Ryu, T. Nishimura
Anisotropic diffusion based de-noising methods have been demonstrated for the effectiveness on both noise suppression and edge preservation. However, pulse noise liked spots in the de-noised images and threshold selection are two problems of these methods. This paper presents a simulated annealing and local contrast based anisotropic diffusion method for 1/f noise reduction on the pinned-type complementary metal oxide semiconductor image sensors (CMOS image sensors: CIS). Experimental results reveal that the proposed method is an acceptably good solution to the avoidance of the appearance of the pulse noise liked spots in the de-noised images and the threshold selection.
{"title":"Simulated annealing and local contrast based anisotropic diffusion method for 1/f noise reduction","authors":"Deng Zhang, J. Ryu, T. Nishimura","doi":"10.1109/ICACIA.2009.5361091","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361091","url":null,"abstract":"Anisotropic diffusion based de-noising methods have been demonstrated for the effectiveness on both noise suppression and edge preservation. However, pulse noise liked spots in the de-noised images and threshold selection are two problems of these methods. This paper presents a simulated annealing and local contrast based anisotropic diffusion method for 1/f noise reduction on the pinned-type complementary metal oxide semiconductor image sensors (CMOS image sensors: CIS). Experimental results reveal that the proposed method is an acceptably good solution to the avoidance of the appearance of the pulse noise liked spots in the de-noised images and the threshold selection.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127097194","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-28DOI: 10.1109/ICACIA.2009.5361127
Minghao Yang, Da-peng Chen, Xiao-Song Zhang
Malicious intrusion is the behavior that threats a large number of computers; therefore, recent research has focused on devising new techniques to detect and control internet intrusion with high efficiency and low cost. Unfortunately some anomaly detection system (ADS) over machine learning may get some false alarms if the results of machine learning cannot cover all the normal or abnormal data. In this paper, to solve this problem, we introduce a new approach for anomaly detection using contiguous expert voting algorithm (CEVS). At first, we present our framework of the anomaly detection system, and then we define a new algorithm based on data mining, at last we will use this algorithm to detect the internet anomaly and report our experimental result. The results show that the proposed approach can improve the detection performance of the ADS, where traditional anomaly detection system is used.
{"title":"Anomaly detection based on contiguous expert voting algorithm","authors":"Minghao Yang, Da-peng Chen, Xiao-Song Zhang","doi":"10.1109/ICACIA.2009.5361127","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361127","url":null,"abstract":"Malicious intrusion is the behavior that threats a large number of computers; therefore, recent research has focused on devising new techniques to detect and control internet intrusion with high efficiency and low cost. Unfortunately some anomaly detection system (ADS) over machine learning may get some false alarms if the results of machine learning cannot cover all the normal or abnormal data. In this paper, to solve this problem, we introduce a new approach for anomaly detection using contiguous expert voting algorithm (CEVS). At first, we present our framework of the anomaly detection system, and then we define a new algorithm based on data mining, at last we will use this algorithm to detect the internet anomaly and report our experimental result. The results show that the proposed approach can improve the detection performance of the ADS, where traditional anomaly detection system is used.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122858302","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-28DOI: 10.1109/ICACIA.2009.5361155
Bu-Yu Wang, Mei-an Li, Yongjun Wang
In order to precisely procure the Chinese person information on the web, especially distinguish from the namesake, this paper propose a clustering algorithm based on latent semantic model. It establishes for every document a latent semantic model of sentence-word matrix based on central distance, central segment, document length, etc, by building the central word library of person attributes. It clusters the similar documents by means of dynamic-extending clustering algorithm. Experiments prove that the algorithm gives high accuracy to documents clustering as well as maintaining the coherence of the person's semantic information and highlighting the importance of semantic information under different sequences.
{"title":"A clustering algorithm based on latent semantic model","authors":"Bu-Yu Wang, Mei-an Li, Yongjun Wang","doi":"10.1109/ICACIA.2009.5361155","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361155","url":null,"abstract":"In order to precisely procure the Chinese person information on the web, especially distinguish from the namesake, this paper propose a clustering algorithm based on latent semantic model. It establishes for every document a latent semantic model of sentence-word matrix based on central distance, central segment, document length, etc, by building the central word library of person attributes. It clusters the similar documents by means of dynamic-extending clustering algorithm. Experiments prove that the algorithm gives high accuracy to documents clustering as well as maintaining the coherence of the person's semantic information and highlighting the importance of semantic information under different sequences.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121963188","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-28DOI: 10.1109/ICACIA.2009.5361081
Yue Wang, Yuan-Yuan Huang, Jianping Li
For the superiority of good uniqueness, stability and being easily collected, fingerprint has become one of the most widely used biological characteristics. The algorithm of fingerprints identification is generally divided into three parts: image pretreatment, feature point extraction and matching. This paper analyses and improves the most widely used matching algorithm-the shortest distance point matching algorithm which is based on point model. Firstly, we need to find a reference point, which is taken as the Origin of the polar coordinates, among the feature points. Secondly, transfer the feature points to the polar coordinates from the rectangular coordinate system, now the consequence caused by the translation of the fingerprint image is clear. There are two steps in matching process, in first matching, if the amount of the matching points, without considering the effect of angle, is greater than or equal to the threshold, we step into the second matching based on angle. It is proved that the improvement is significantly effective to the system which includes a large amount of template images in the database.
{"title":"The research and improvement of fingerprint matching algorithm","authors":"Yue Wang, Yuan-Yuan Huang, Jianping Li","doi":"10.1109/ICACIA.2009.5361081","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361081","url":null,"abstract":"For the superiority of good uniqueness, stability and being easily collected, fingerprint has become one of the most widely used biological characteristics. The algorithm of fingerprints identification is generally divided into three parts: image pretreatment, feature point extraction and matching. This paper analyses and improves the most widely used matching algorithm-the shortest distance point matching algorithm which is based on point model. Firstly, we need to find a reference point, which is taken as the Origin of the polar coordinates, among the feature points. Secondly, transfer the feature points to the polar coordinates from the rectangular coordinate system, now the consequence caused by the translation of the fingerprint image is clear. There are two steps in matching process, in first matching, if the amount of the matching points, without considering the effect of angle, is greater than or equal to the threshold, we step into the second matching based on angle. It is proved that the improvement is significantly effective to the system which includes a large amount of template images in the database.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122000749","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-28DOI: 10.1109/ICACIA.2009.5361101
Shuquan Li, Yue Wu, Dayong Zhu, Jia Chen
With the development of the Internet, Multicast applications are deployed for mainstream use, IP multicasting is critical technology in those applications. The absence of security mechanism has limited the use of multicast. In order to protect communication confidentiality, Traffic in secure multicast is encrypted with a Session Encryption Key which is only to the certificated group members. Key management become essential issue for IP multicast. The aim of key management for multicast is for group members in one multicast session to generate, refresh and transfer keys which are used for encryption and authentication. In this paper, we review some typical schemes and propose a new key management scheme for large and dynamic multicast group. It is shown our scheme is very efficient and scalable to large multicast groups.
{"title":"A hierarchical key management scheme for large and dynamic multicast groups","authors":"Shuquan Li, Yue Wu, Dayong Zhu, Jia Chen","doi":"10.1109/ICACIA.2009.5361101","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361101","url":null,"abstract":"With the development of the Internet, Multicast applications are deployed for mainstream use, IP multicasting is critical technology in those applications. The absence of security mechanism has limited the use of multicast. In order to protect communication confidentiality, Traffic in secure multicast is encrypted with a Session Encryption Key which is only to the certificated group members. Key management become essential issue for IP multicast. The aim of key management for multicast is for group members in one multicast session to generate, refresh and transfer keys which are used for encryption and authentication. In this paper, we review some typical schemes and propose a new key management scheme for large and dynamic multicast group. It is shown our scheme is very efficient and scalable to large multicast groups.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129559320","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-28DOI: 10.1109/ICACIA.2009.5361111
Xian-Li Li, Jiawei Zhang, Wei-Hong Fang
Aiming at the limited resources and data transmission redundancy of WSN, this paper proposes a novel data compression algorithm based on lifting wavelet transform, gives the rational design. The algorithm distributes the computing quantity which the lifting wavelet transform requires to all nodes, eliminates extra computing and data transmission, reduces the information redundancy of network, greatly saves the energy of wireless transmission, prolongs network lifetime. The simulation results show that the data compression algorithm based on lifting wavelet transform performs well in energy saving without sacrificing the reconstruction quality of signal in comparing with the data compression algorithm based on traditional wavelet transform.
{"title":"The research of data compression algorithm based on lifting wavelet transform for wireless sensor network","authors":"Xian-Li Li, Jiawei Zhang, Wei-Hong Fang","doi":"10.1109/ICACIA.2009.5361111","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361111","url":null,"abstract":"Aiming at the limited resources and data transmission redundancy of WSN, this paper proposes a novel data compression algorithm based on lifting wavelet transform, gives the rational design. The algorithm distributes the computing quantity which the lifting wavelet transform requires to all nodes, eliminates extra computing and data transmission, reduces the information redundancy of network, greatly saves the energy of wireless transmission, prolongs network lifetime. The simulation results show that the data compression algorithm based on lifting wavelet transform performs well in energy saving without sacrificing the reconstruction quality of signal in comparing with the data compression algorithm based on traditional wavelet transform.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129807161","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-28DOI: 10.1109/ICACIA.2009.5361082
Hao Dong, She Kun, Cheng Yu
This paper is about an interdisciplinary knowledge relating to Computer Science and Solid State Electronics. The normal FORMAT or DELET operation in computer can not verily eras the data on the hard disk. By using precision instruments, the data could be recognized and recovered. Based on the intensive study in characteristic of magnetic medium and the data encoding rules, this paper represents an effective theory to destruct data from hard disk without specialized equipment. And finally, it proposes a feasible solution for the data destruction software on Linux and Windows operating system.
{"title":"Research on secure destruction of digital information","authors":"Hao Dong, She Kun, Cheng Yu","doi":"10.1109/ICACIA.2009.5361082","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361082","url":null,"abstract":"This paper is about an interdisciplinary knowledge relating to Computer Science and Solid State Electronics. The normal FORMAT or DELET operation in computer can not verily eras the data on the hard disk. By using precision instruments, the data could be recognized and recovered. Based on the intensive study in characteristic of magnetic medium and the data encoding rules, this paper represents an effective theory to destruct data from hard disk without specialized equipment. And finally, it proposes a feasible solution for the data destruction software on Linux and Windows operating system.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128458243","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-28DOI: 10.1109/ICACIA.2009.5361140
Lin Liu, Xiaofeng Gu, Jianping Li, Jie Lin, Jin-Xin Shi, Yuan-Yuan Huang
Given uncertain status reports or notes come from multi-sensor, identity fusion further makes them integrate information and jointly determine the observed entities. This paper discusses an improved data fusion approach to multi-biometric feature, including face, fingerprint and iris image. The approach is called improved multiple biometric data fusion algorithm, based on the eigen-face and the Gabor wavelet methods, incorporating the advantages of the single algorithm. Now we have built a new fusion system, which has demonstrated the improved performance over single biometric systems.
{"title":"Research on data fusion of multiple biometric features","authors":"Lin Liu, Xiaofeng Gu, Jianping Li, Jie Lin, Jin-Xin Shi, Yuan-Yuan Huang","doi":"10.1109/ICACIA.2009.5361140","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361140","url":null,"abstract":"Given uncertain status reports or notes come from multi-sensor, identity fusion further makes them integrate information and jointly determine the observed entities. This paper discusses an improved data fusion approach to multi-biometric feature, including face, fingerprint and iris image. The approach is called improved multiple biometric data fusion algorithm, based on the eigen-face and the Gabor wavelet methods, incorporating the advantages of the single algorithm. Now we have built a new fusion system, which has demonstrated the improved performance over single biometric systems.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130472458","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-28DOI: 10.1109/ICACIA.2009.5361154
Jian Shu, Chunxiang Xu
Authenticated group key exchange (AGKE) enable a set of participants in a public network to share a key which can be further used to achieve confidentiality and authentication. Most of the schemes required a linear number of communications round with respect to the number of group members, such schemes are not practical. Others are inefficient being required some additional condition such as central authority or logic structure. After analyzed the security of bresson's protocol, a improved scheme is proposed, which is simple and efficient. The scheme is proven secure under Decisional Diffie-Hellman assumption.
{"title":"A improved scheme for authenticated group key exchange","authors":"Jian Shu, Chunxiang Xu","doi":"10.1109/ICACIA.2009.5361154","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361154","url":null,"abstract":"Authenticated group key exchange (AGKE) enable a set of participants in a public network to share a key which can be further used to achieve confidentiality and authentication. Most of the schemes required a linear number of communications round with respect to the number of group members, such schemes are not practical. Others are inefficient being required some additional condition such as central authority or logic structure. After analyzed the security of bresson's protocol, a improved scheme is proposed, which is simple and efficient. The scheme is proven secure under Decisional Diffie-Hellman assumption.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124229339","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-28DOI: 10.1109/ICACIA.2009.5361165
Bohao Liu, G. Xie, X. Du, Xian Li, Ping Sun
A bottom contact pentacene based organic thin film transistor (OTFT) was fabricated in this paper. Pentacene thin film acting both as gas sensing layer and the active layer was formed by vacuum evaporation and was characterized by atomic force microscopy (AFM) and x-ray diffraction (XRD). The results show that the film is highly ordered and has a polycrystalline morphology. The current-voltage characteristics of the OTFT was also investigated. The drain-source current in the saturation region would changed when the OTFT was exposed to alcohol vapor compared to that under an exposure to nitrogen gas. It indicates that the drain-source current can be considered as a key parameter to monitoring chemical species. Such OTFTs devices are promising to act as a novel class of chemical sensors.
{"title":"Pentacene based organic thin-film transistor as gas sensor","authors":"Bohao Liu, G. Xie, X. Du, Xian Li, Ping Sun","doi":"10.1109/ICACIA.2009.5361165","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361165","url":null,"abstract":"A bottom contact pentacene based organic thin film transistor (OTFT) was fabricated in this paper. Pentacene thin film acting both as gas sensing layer and the active layer was formed by vacuum evaporation and was characterized by atomic force microscopy (AFM) and x-ray diffraction (XRD). The results show that the film is highly ordered and has a polycrystalline morphology. The current-voltage characteristics of the OTFT was also investigated. The drain-source current in the saturation region would changed when the OTFT was exposed to alcohol vapor compared to that under an exposure to nitrogen gas. It indicates that the drain-source current can be considered as a key parameter to monitoring chemical species. Such OTFTs devices are promising to act as a novel class of chemical sensors.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121200437","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
扫码关注我们
求助内容：
应助结果提醒方式：