An algorithm is developed to estimate visibility from images captured by video cameras. We propose to smooth the captured image by mean shift and extract the landmark edge by an improved ADM. Then the visibility is estimated in terms of a simplified visibility definition. In comparison with traditional methods, our method not only remove the noise in landmark boundary region, but also make boundary region be more uniform and the extracted edge be more salient. Experimental results illustrate the effectiveness of our approach in visibility estimation.
{"title":"Visibility Estimation Based on Mean Shift","authors":"Wenbing Chen, Xiaolei Zhang, Jianwei Yang","doi":"10.1109/IAS.2009.81","DOIUrl":"https://doi.org/10.1109/IAS.2009.81","url":null,"abstract":"An algorithm is developed to estimate visibility from images captured by video cameras. We propose to smooth the captured image by mean shift and extract the landmark edge by an improved ADM. Then the visibility is estimated in terms of a simplified visibility definition. In comparison with traditional methods, our method not only remove the noise in landmark boundary region, but also make boundary region be more uniform and the extracted edge be more salient. Experimental results illustrate the effectiveness of our approach in visibility estimation.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124215835","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}
Lossless data hiding is a technique that used to embed secret message into media for generating the stego image. The receiver who obtains the stego image can extract the secret message from it and restore the original media via the extraction and recovery image algorithms. Coltuc and Chassery combined look-up table and reversible contrast mapping technique to generate a very fast watermarking embedding scheme in 2007. Their scheme is simple and the hiding capacity is high. In addition, the image quality of the stego image generated by their scheme is fine. However, in their method, absolute difference is used to control image distortion. If the value of the absolute difference is low, then the hiding capacity will be limited and decreased. Therefore, we apply the histogram technique to improve Coltuc and Chassery’s scheme. The experimental results show that the image quality of the proposed scheme is better than that of Coltuc and Chassery’s scheme.
{"title":"An Effective Lossless Hiding Technique Based on Reversible Contrast Mapping and Histogram Embedding Methods","authors":"T. Lu, Ying-Hsuan Huang","doi":"10.1109/IAS.2009.113","DOIUrl":"https://doi.org/10.1109/IAS.2009.113","url":null,"abstract":"Lossless data hiding is a technique that used to embed secret message into media for generating the stego image. The receiver who obtains the stego image can extract the secret message from it and restore the original media via the extraction and recovery image algorithms. Coltuc and Chassery combined look-up table and reversible contrast mapping technique to generate a very fast watermarking embedding scheme in 2007. Their scheme is simple and the hiding capacity is high. In addition, the image quality of the stego image generated by their scheme is fine. However, in their method, absolute difference is used to control image distortion. If the value of the absolute difference is low, then the hiding capacity will be limited and decreased. Therefore, we apply the histogram technique to improve Coltuc and Chassery’s scheme. The experimental results show that the image quality of the proposed scheme is better than that of Coltuc and Chassery’s scheme.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126276312","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}
Deepa Susan Rajan, Chetan Yeole, Harshad Nakade, Huirong Fu, Ye Zhu
Inter-vehicle communication is an emerging field of research which focuses on different ways of increasing safety and efficiency in future intelligent highways. However, the security in these inter vehicular communication is a major issue. Since the vehicular network does not have a fixed infrastructure, developing a security scheme in a highly dynamically changing environment is a major challenge. In this paper we are proposing two algorithms for verifying the position information claimed by other vehicles in a multi-hop vehicular network.
{"title":"Position Verification in Multi-hop Vehicular Networks","authors":"Deepa Susan Rajan, Chetan Yeole, Harshad Nakade, Huirong Fu, Ye Zhu","doi":"10.1109/IAS.2009.345","DOIUrl":"https://doi.org/10.1109/IAS.2009.345","url":null,"abstract":"Inter-vehicle communication is an emerging field of research which focuses on different ways of increasing safety and efficiency in future intelligent highways. However, the security in these inter vehicular communication is a major issue. Since the vehicular network does not have a fixed infrastructure, developing a security scheme in a highly dynamically changing environment is a major challenge. In this paper we are proposing two algorithms for verifying the position information claimed by other vehicles in a multi-hop vehicular network.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126282854","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}
Quantum no-key protocol is a quantum realization of Shamir’s idea of no-key cryptosystem, which can be used to transport quantum and classical message secretly. It is beyond computational security. We give a practical quantum no-key protocol with mutual identification. In order to prevent MIM (man-in-the-middle) attack, we realize secure information transmission and identification by utilizing a short pre-shared secret bit sequence. And we use pseudo-random sequences to mix the photons which are used for information transmission and the photons which are used for identification. Pseudo-random sequence partly protects the secret sequence and makes our protocol more practical while do not weaken the security. We post a schematic diagram of the experimental set-up which is based on fiber communication system. Our protocol does not need entanglement, multi-qubit operation or classical communication.
{"title":"Practical Quantum No-key Protocol with Identification","authors":"Yang Wu, Li Yang","doi":"10.1109/IAS.2009.106","DOIUrl":"https://doi.org/10.1109/IAS.2009.106","url":null,"abstract":"Quantum no-key protocol is a quantum realization of Shamir’s idea of no-key cryptosystem, which can be used to transport quantum and classical message secretly. It is beyond computational security. We give a practical quantum no-key protocol with mutual identification. In order to prevent MIM (man-in-the-middle) attack, we realize secure information transmission and identification by utilizing a short pre-shared secret bit sequence. And we use pseudo-random sequences to mix the photons which are used for information transmission and the photons which are used for identification. Pseudo-random sequence partly protects the secret sequence and makes our protocol more practical while do not weaken the security. We post a schematic diagram of the experimental set-up which is based on fiber communication system. Our protocol does not need entanglement, multi-qubit operation or classical communication.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129520341","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}
This paper primarily researches on the feasibility of embedding watermark to relational databases in the Discrete Wavelet Transform (DWT) domain. Watermark embedding is known to be difficult for relational databases. This paper focuses on the analysis of the wavelet high frequency coefficients of corresponding data and gives the definition of the intensive factor. By employing the linear correlation detecting method, this paper proposes the watermarking algorithm, which can embed the watermark into relational database successfully in DWT domain. The watermark can be distributed to different parts of the relational database. Experiments show that the embedded digital watermarks in the proposed algorithm are invisible and some degree of the robustness of the proposed algorithm against the commonly attacks that are used in databases processing.
{"title":"Watermarking Relational Databases for Ownership Protection Based on DWT","authors":"Chuanxian Jiang, Xiaowei Chen, Zhi Li","doi":"10.1109/IAS.2009.220","DOIUrl":"https://doi.org/10.1109/IAS.2009.220","url":null,"abstract":"This paper primarily researches on the feasibility of embedding watermark to relational databases in the Discrete Wavelet Transform (DWT) domain. Watermark embedding is known to be difficult for relational databases. This paper focuses on the analysis of the wavelet high frequency coefficients of corresponding data and gives the definition of the intensive factor. By employing the linear correlation detecting method, this paper proposes the watermarking algorithm, which can embed the watermark into relational database successfully in DWT domain. The watermark can be distributed to different parts of the relational database. Experiments show that the embedded digital watermarks in the proposed algorithm are invisible and some degree of the robustness of the proposed algorithm against the commonly attacks that are used in databases processing.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128539249","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}
Wenbiao Peng, Chaojun Yan, Xinqiong Liu, Lihua Deng
The emergency command system is an important part in the project of warning, monitoring and geologic disasters prevention in the Three Gorges Reservoir Area, because it can provide a reliable technical guarantee. This paper describes a multimedia emergency command system based on satellite IP link. The characteristics include an on-the-spot information collection and transmission, an integrated emergency communications, an emergency commanding, an emergency dispatching and strategic decision analysis. The system can meet the need of emergency mobile command and is effective and practical. It enhances the efficiency of working for establishing interconnection of the discrete resources and realizing the commanding of emergency.
{"title":"Emergency Command System for Geologic Disasters Prevention","authors":"Wenbiao Peng, Chaojun Yan, Xinqiong Liu, Lihua Deng","doi":"10.1109/IAS.2009.51","DOIUrl":"https://doi.org/10.1109/IAS.2009.51","url":null,"abstract":"The emergency command system is an important part in the project of warning, monitoring and geologic disasters prevention in the Three Gorges Reservoir Area, because it can provide a reliable technical guarantee. This paper describes a multimedia emergency command system based on satellite IP link. The characteristics include an on-the-spot information collection and transmission, an integrated emergency communications, an emergency commanding, an emergency dispatching and strategic decision analysis. The system can meet the need of emergency mobile command and is effective and practical. It enhances the efficiency of working for establishing interconnection of the discrete resources and realizing the commanding of emergency.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124576083","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}
R. Ahmad, Ganthan Narayana Samy, Nuzulha Khilwani Ibrahim, P. Bath, Z. Ismail
Threats to information security for healthcare information system increased tremendously. There are various factors contribute to information security threats, many researchers focused only to certain factors which interest them (e.g., virus attack). Certain factors which may be important remain unexplored. In addition, lack of tools and technologies directed to limited number of threats traced in healthcare system. Thus it introduces bias in threat analysis. This study explored the use of biological computational termed Genetic Algorithm (GAs) combined with Cox regression (CoRGA) in identifying a potential threat for healthcare system. The results show that variable described “misused of e-mail” is the major information security threats for healthcare system. Results were compared with manual analysis using the same data, and it is shows that GAs not just introducing new threats for healthcare system but it was similar with others threats proposed by previous researches.
{"title":"Threats Identification in Healthcare Information Systems Using Genetic Algorithm and Cox Regression","authors":"R. Ahmad, Ganthan Narayana Samy, Nuzulha Khilwani Ibrahim, P. Bath, Z. Ismail","doi":"10.1109/IAS.2009.313","DOIUrl":"https://doi.org/10.1109/IAS.2009.313","url":null,"abstract":"Threats to information security for healthcare information system increased tremendously. There are various factors contribute to information security threats, many researchers focused only to certain factors which interest them (e.g., virus attack). Certain factors which may be important remain unexplored. In addition, lack of tools and technologies directed to limited number of threats traced in healthcare system. Thus it introduces bias in threat analysis. This study explored the use of biological computational termed Genetic Algorithm (GAs) combined with Cox regression (CoRGA) in identifying a potential threat for healthcare system. The results show that variable described “misused of e-mail” is the major information security threats for healthcare system. Results were compared with manual analysis using the same data, and it is shows that GAs not just introducing new threats for healthcare system but it was similar with others threats proposed by previous researches.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"65 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130538084","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}
Providing anonymous routing in mobile ad hoc networks (MANET) has been a hot issue for the purpose of security and privacy concerns. But there are very few have been done about providing a valid method to detect malicious node and providing a trustworthy protection over whole network. In this paper, we introduce a localized trust management which can primarily remove malicious nodes, and propose an efficient anonymous routing protocol by node that participates in the protocol encrypts entire message with trust key and says Hello to its ancestor within expiration time. It makes malicious node can be detected and isolated from the network. In this way, a anonymous and secure route path can be established in a hostile environment. Meanwhile, it is able to efficiently against the Denial-of-Service (DoS) attack.
{"title":"An Efficient Anonymous Routing Protocol for Mobile Ad Hoc Networks","authors":"Xiaoqing Li, Hui Li, Jianfeng Ma, Weidong Zhang","doi":"10.1109/IAS.2009.267","DOIUrl":"https://doi.org/10.1109/IAS.2009.267","url":null,"abstract":"Providing anonymous routing in mobile ad hoc networks (MANET) has been a hot issue for the purpose of security and privacy concerns. But there are very few have been done about providing a valid method to detect malicious node and providing a trustworthy protection over whole network. In this paper, we introduce a localized trust management which can primarily remove malicious nodes, and propose an efficient anonymous routing protocol by node that participates in the protocol encrypts entire message with trust key and says Hello to its ancestor within expiration time. It makes malicious node can be detected and isolated from the network. In this way, a anonymous and secure route path can be established in a hostile environment. Meanwhile, it is able to efficiently against the Denial-of-Service (DoS) attack.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131462345","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}
This study not only applies Multi-Criteria Decision Making with Incomplete Linguistic model (InlinPreRa) and uses horizontal, vertical and oblique pairwise comparison algorithms to construct but also expansion group decision making model. When the decision maker is carrying out the pairwise comparison, the following problems can be avoided: time pressure, lack of complete information, the decision maker is lack of this professional knowledge, or the information provided is unreal and thus it is difficult to obtain information.
本研究运用inlinpreera多准则决策模型(Multi-Criteria Decision Making with Incomplete Linguistic model, inlinpreera)，并运用水平、垂直和倾斜的两两比较算法构建和扩展群体决策模型。当决策者进行两两比较时，可以避免以下问题:时间紧迫，信息不完整，决策者缺乏该专业知识，或者提供的信息不真实，难以获得信息。
{"title":"An Approach to Group Decision Making Based on Incomplete Linguistic Preference Relations","authors":"Tien-Chin Wang, S. Peng, S. Hsu, Jui-Fang Chang","doi":"10.1109/IAS.2009.204","DOIUrl":"https://doi.org/10.1109/IAS.2009.204","url":null,"abstract":"This study not only applies Multi-Criteria Decision Making with Incomplete Linguistic model (InlinPreRa) and uses horizontal, vertical and oblique pairwise comparison algorithms to construct but also expansion group decision making model. When the decision maker is carrying out the pairwise comparison, the following problems can be avoided: time pressure, lack of complete information, the decision maker is lack of this professional knowledge, or the information provided is unreal and thus it is difficult to obtain information.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131596428","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}
System-level design methods can provide a systematic and effective way of evaluating various design options, thus shortening the product development time. This paper relaxes the HC algorithm by considering the K best candidates in each clustering iteration to alleviate the possibility of being trapped in local minimum during hardware/software (HW/SW) partition. We also present an architecture mapping algorithm together with the defined sensitivity measure to further reduce the hardware requirement. Simulation results show that the complexity of exploration time can be greatly reduced with only little performance loss as compared to the exhaustive search. The proposed algorithm can thus provide a good compromise between exploration time and accuracy.
{"title":"Hardware/Software Codesign of Resource Constrained Real-Time Systems","authors":"Chia-Cheng Lo, Jung-Guan Luo, Ming-Der Shieh","doi":"10.1109/IAS.2009.19","DOIUrl":"https://doi.org/10.1109/IAS.2009.19","url":null,"abstract":"System-level design methods can provide a systematic and effective way of evaluating various design options, thus shortening the product development time. This paper relaxes the HC algorithm by considering the K best candidates in each clustering iteration to alleviate the possibility of being trapped in local minimum during hardware/software (HW/SW) partition. We also present an architecture mapping algorithm together with the defined sensitivity measure to further reduce the hardware requirement. Simulation results show that the complexity of exploration time can be greatly reduced with only little performance loss as compared to the exhaustive search. The proposed algorithm can thus provide a good compromise between exploration time and accuracy.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121669423","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
扫码关注我们
求助内容：
应助结果提醒方式：