This paper presents a novel algorithm for point correspondences using graph spectral analysis. Firstly, the correspondence probabilities are computed by using the eigenvectors and eigenvalues of the proximity matrix as well as the method of alternated row and column normalizations. Secondly, local similarity evaluated by shape context is incorporated into our spectral method to refine the results of spectral correspondence via a probabilistic relaxation approach. Experiments on both real-world and synthetic data show that our method possesses comparatively high accuracy.
{"title":"Spectral Correspondence Using Local Similarity Analysis","authors":"Jun Tang, Dong Liang, Nian Wang, Zhaohong Jia","doi":"10.1109/CIS.2007.74","DOIUrl":"https://doi.org/10.1109/CIS.2007.74","url":null,"abstract":"This paper presents a novel algorithm for point correspondences using graph spectral analysis. Firstly, the correspondence probabilities are computed by using the eigenvectors and eigenvalues of the proximity matrix as well as the method of alternated row and column normalizations. Secondly, local similarity evaluated by shape context is incorporated into our spectral method to refine the results of spectral correspondence via a probabilistic relaxation approach. Experiments on both real-world and synthetic data show that our method possesses comparatively high accuracy.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"44 16 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":"133626455","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}
As data stream springs up in various areas, distributed data stream management systems are being paid more and more attention. In DSMS, join is one of the most common but complicated operators, and the efficiency of continuous queries may be influenced by join directly. This paper mainly studies the join operation over data stream located on two different sites in WAN. Firstly, data model, query model and cost model are defined, and then a simple direct-join strategy and a semi-join strategy are proposed, which are respectively ideal under certain conditions but can't adapt to the variation of data stream. Finally, based on the analysis of the two strategies, an optimized adaptive join strategy is presented. The efficiency and flexibility of our strategy is proved by extensive experiments. Key words: distributed data stream management, continuous query, adaptive join.
{"title":"An Adaptive Join Strategy in Distributed Data Stream Management System","authors":"Xiaojing Li, Yu Gu, D. Yue, Ge Yu","doi":"10.1109/CIS.2007.55","DOIUrl":"https://doi.org/10.1109/CIS.2007.55","url":null,"abstract":"As data stream springs up in various areas, distributed data stream management systems are being paid more and more attention. In DSMS, join is one of the most common but complicated operators, and the efficiency of continuous queries may be influenced by join directly. This paper mainly studies the join operation over data stream located on two different sites in WAN. Firstly, data model, query model and cost model are defined, and then a simple direct-join strategy and a semi-join strategy are proposed, which are respectively ideal under certain conditions but can't adapt to the variation of data stream. Finally, based on the analysis of the two strategies, an optimized adaptive join strategy is presented. The efficiency and flexibility of our strategy is proved by extensive experiments. Key words: distributed data stream management, continuous query, adaptive join.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"67 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":"132064633","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}
Ting Liu, Ye Ji, Lequan Min, Geng Zhao, Xiaohong Qin
This paper introduces a constructive theorem for design- ing a non-autonomous driven system, which can achieve generalized chaos synchronization (GCS) to a driving sys- tem. As a first application, a encryption scheme is established based on GCS non-autonomous systems. This scheme has the functions of the datum authentication and one-time-pad. As a second application, the non-autonomous Driven van der Pol oscillator is selected as a driving system. A invertible transform H is introduced to design a driven sys- tem such that the two systems are in GS with respect to H. Based on the GCS systems and the scheme one can en- crypt and decrypt original information without any loss. The analysis of the key space and sensitivity of key param- eters show that this scheme has sound security. The key space of the scheme is larger that 2148. It can be expected that our theorem provides a new tool for studying and understanding the GS phenomena and the scheme offers a new method for information encryption.
{"title":"Generalized Synchronization Theorem for Non-Autonomous Differential Equation with Application in Encryption Scheme","authors":"Ting Liu, Ye Ji, Lequan Min, Geng Zhao, Xiaohong Qin","doi":"10.1109/CIS.2007.170","DOIUrl":"https://doi.org/10.1109/CIS.2007.170","url":null,"abstract":"This paper introduces a constructive theorem for design- ing a non-autonomous driven system, which can achieve generalized chaos synchronization (GCS) to a driving sys- tem. As a first application, a encryption scheme is established based on GCS non-autonomous systems. This scheme has the functions of the datum authentication and one-time-pad. As a second application, the non-autonomous Driven van der Pol oscillator is selected as a driving system. A invertible transform H is introduced to design a driven sys- tem such that the two systems are in GS with respect to H. Based on the GCS systems and the scheme one can en- crypt and decrypt original information without any loss. The analysis of the key space and sensitivity of key param- eters show that this scheme has sound security. The key space of the scheme is larger that 2148. It can be expected that our theorem provides a new tool for studying and understanding the GS phenomena and the scheme offers a new method for information encryption.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"6 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":"114448303","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}
Proportional-Integral-Derivative (PID) controller is still widely used in control engineering, and tuning of PID is a crucial operation. We utilize particle swarm optimization algorithm to design an online self- tuning framework of PID controller. Our system is simulated in Matlab based on particle swarm optimi- zation algorithm. Experiment focus on several prob- lems application concerned. Our conclusions include that different fitness function can lead to different time response, and application system should initialize range of each particle as small as possible. Moreover, the conclusions also include that we should choose a modest generations for the online system with linearly inertia weight consume less times evolutionary genera- tion, not a larger one. These conclusions can contrib- ute mostly to application system concerning about cal- culation cost. Keywords: PSO, PID controller, Matlab
{"title":"PSO Algorithm Based Online Self-Tuning of PID Controller","authors":"Xuzhou Li, Fei Yu, You-bo Wang","doi":"10.1109/CIS.2007.194","DOIUrl":"https://doi.org/10.1109/CIS.2007.194","url":null,"abstract":"Proportional-Integral-Derivative (PID) controller is still widely used in control engineering, and tuning of PID is a crucial operation. We utilize particle swarm optimization algorithm to design an online self- tuning framework of PID controller. Our system is simulated in Matlab based on particle swarm optimi- zation algorithm. Experiment focus on several prob- lems application concerned. Our conclusions include that different fitness function can lead to different time response, and application system should initialize range of each particle as small as possible. Moreover, the conclusions also include that we should choose a modest generations for the online system with linearly inertia weight consume less times evolutionary genera- tion, not a larger one. These conclusions can contrib- ute mostly to application system concerning about cal- culation cost. Keywords: PSO, PID controller, Matlab","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"20 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131874054","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}
Human body segmentation in complex situation is an important processing stage in video surveillance. The results have great affects on tracking, behavior recognition or object identification. In this paper, we present a method to segment region in which human bodies are overlapping or walking together. The multiple human objects region is segmented using potential function clustering in the vertical projection histograms of the region, the segmented results are verified by analyzing their geometry features. If the results are not consistent with the human geometry feature, it shows that multiple humans are overlapping. A binocular vision algorithm is proposed to segment the region based on distance. The Experimental results prove the algorithm works robustly, adaptively and efficiently.
{"title":"Human Body Segmentation in the Presence of Occlusion","authors":"Bi Sheng, Xiaoyan Shen, Qiang Wang","doi":"10.1109/CIS.2007.149","DOIUrl":"https://doi.org/10.1109/CIS.2007.149","url":null,"abstract":"Human body segmentation in complex situation is an important processing stage in video surveillance. The results have great affects on tracking, behavior recognition or object identification. In this paper, we present a method to segment region in which human bodies are overlapping or walking together. The multiple human objects region is segmented using potential function clustering in the vertical projection histograms of the region, the segmented results are verified by analyzing their geometry features. If the results are not consistent with the human geometry feature, it shows that multiple humans are overlapping. A binocular vision algorithm is proposed to segment the region based on distance. The Experimental results prove the algorithm works robustly, adaptively and efficiently.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"46 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":"128327734","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 introduces subscriptions as authorizations to access contents within time periods. For a technical real- ization of the subscriptions, a new key assignment scheme is proposed that supports fine-granular adjustable restrictions on both, contents and validity duration. Its security is based on the reliance of tamper-proof devices and hash functions. Since per subscription only one key pair is required, it is very suitable in practice. Additionally, a concept based on prepaid cards is given that unburdens the server from user authentication and preserves the users' anonymity.
{"title":"A Flexible Subscription Model for Broadcasted Digital Contents","authors":"Franz Kollmann","doi":"10.1109/CIS.2007.155","DOIUrl":"https://doi.org/10.1109/CIS.2007.155","url":null,"abstract":"This paper introduces subscriptions as authorizations to access contents within time periods. For a technical real- ization of the subscriptions, a new key assignment scheme is proposed that supports fine-granular adjustable restrictions on both, contents and validity duration. Its security is based on the reliance of tamper-proof devices and hash functions. Since per subscription only one key pair is required, it is very suitable in practice. Additionally, a concept based on prepaid cards is given that unburdens the server from user authentication and preserves the users' anonymity.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"117 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":"116177582","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}
Sensor networks have a wide spectrum of military and civil applications, particularly with respect to security and secure keys for encryption and authentication. This paper presents a new centralized approach which focuses on the group key distribution with revocation capability for sen- sor networks. We propose a new personal key share dis- tribution. When utilized, this approach proves to be secure against k-number of illegitimate colluding nodes. In con- trast to related approaches, our scheme can overcome the security shortcomings while keeping the small overhead re- quirements per node. It will be shown that our scheme is unconditionally secure and achieves forward secrecy. The analysis is demonstrated in terms of communication and storage overheads.
{"title":"A New Centralized Group Key Distribution and Revocation in Sensor Network","authors":"Tegshbayar Gerelbayar, Jong Sou Park","doi":"10.1109/CIS.2007.11","DOIUrl":"https://doi.org/10.1109/CIS.2007.11","url":null,"abstract":"Sensor networks have a wide spectrum of military and civil applications, particularly with respect to security and secure keys for encryption and authentication. This paper presents a new centralized approach which focuses on the group key distribution with revocation capability for sen- sor networks. We propose a new personal key share dis- tribution. When utilized, this approach proves to be secure against k-number of illegitimate colluding nodes. In con- trast to related approaches, our scheme can overcome the security shortcomings while keeping the small overhead re- quirements per node. It will be shown that our scheme is unconditionally secure and achieves forward secrecy. The analysis is demonstrated in terms of communication and storage overheads.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"451 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":"116180391","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}
The degree-constrained minimum spanning tree (dc- MST) problem is of high practical importance. Up to now there are few effective algorithms to solve this problem because of its NP-hard complexity. More recently, a ge- netic algorithm (GA) approach for this problem was tried by using Pr¨ufer number to encode a spanning tree. The Pr¨ufer number is a skillful encoding for tree but not efficient enough to deal with the dc-MST problem. In this paper, a new tree encoding is developed directly based on the de- gree constraint on each vertex and the connectivity among vertices. We denote it as degree-based permutation encod- ing and apply it to the dc-MST problem by using the GA approach. Compared with the numerical results and CPU runtimes between two encodings, the new degree-based per- mutation is effective to deal with the dc-MST problem and even more efficient than the Pr¨ufer number to evolve to the optimal or near-optimal solutions.
{"title":"A New Tree Encoding for the Degree-Constrained Spanning Tree Problem","authors":"Gengui Zhou, Z. Meng, Z. Cao, Jian Cao","doi":"10.1109/CIS.2007.16","DOIUrl":"https://doi.org/10.1109/CIS.2007.16","url":null,"abstract":"The degree-constrained minimum spanning tree (dc- MST) problem is of high practical importance. Up to now there are few effective algorithms to solve this problem because of its NP-hard complexity. More recently, a ge- netic algorithm (GA) approach for this problem was tried by using Pr¨ufer number to encode a spanning tree. The Pr¨ufer number is a skillful encoding for tree but not efficient enough to deal with the dc-MST problem. In this paper, a new tree encoding is developed directly based on the de- gree constraint on each vertex and the connectivity among vertices. We denote it as degree-based permutation encod- ing and apply it to the dc-MST problem by using the GA approach. Compared with the numerical results and CPU runtimes between two encodings, the new degree-based per- mutation is effective to deal with the dc-MST problem and even more efficient than the Pr¨ufer number to evolve to the optimal or near-optimal solutions.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"71 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":"116607164","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}
Secure group communication is a research hotspot. The Tree-based Group Diffie-Hellman Protocol is a fairly good key management scheme for dynamic peer group communications. Through analyzing TGDH protocol, the authors have found out that a deficiency exists with its communication mode. A lot of redundant messages are used to complete group re-keying so that more communication bandwidth will be consumed in TGDH. This paper aims to solve the deficiency and improve TGDH through designing a preparatory algorithm of finding a Key Association Set. A new re-keying protocol is also designed by using the algorithm. Theoretical analysis shows that our protocol effectively decreases the communication and storage overload of TGDH, with the communication bandwidth descending from O (nlogn) to O (n) and the key storage descending from O (n) to O (logn). The simulation result also shows the improved protocol has a better communication performance.
{"title":"An Improved Key Agreement Protocol Based on Key Association Set for Dynamic Peer Group","authors":"Chuyuan Wei, Ying Hao, Cheng Lv, Liping Qian","doi":"10.1109/CIS.2007.175","DOIUrl":"https://doi.org/10.1109/CIS.2007.175","url":null,"abstract":"Secure group communication is a research hotspot. The Tree-based Group Diffie-Hellman Protocol is a fairly good key management scheme for dynamic peer group communications. Through analyzing TGDH protocol, the authors have found out that a deficiency exists with its communication mode. A lot of redundant messages are used to complete group re-keying so that more communication bandwidth will be consumed in TGDH. This paper aims to solve the deficiency and improve TGDH through designing a preparatory algorithm of finding a Key Association Set. A new re-keying protocol is also designed by using the algorithm. Theoretical analysis shows that our protocol effectively decreases the communication and storage overload of TGDH, with the communication bandwidth descending from O (nlogn) to O (n) and the key storage descending from O (n) to O (logn). The simulation result also shows the improved protocol has a better communication performance.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"18 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":"125589102","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}
The sensitivity attack is a main threat to the security of watermarking schemes with open detectors. By the attempts across the detection boundary, the attackers gain adequate information of the embedded watermark to remove it with- out introducing serious distortions into the watermarked works. In some image watermarking schemes, the detection boundaries are the patchworks of certain numbers of hyper- planes. Here the existing sensitivity attacks are not suitable anymore for the detection functions have numbers of differ- ent gradients. The letter proposed a new sensitivity attack in which the attacking directions were calculated with a cer- tain number of gradients estimated separately with the old sensitivity attack. Our experiments show the new attack can remove the watermarks successfully without seriously tam- pering the fidelity.
{"title":"Analysis on the Sensitivity Attack to Watermarking Schemes with Patchwork Detection Boundaries","authors":"Qiyang Zhao, Zhonglin Wang, Baolin Yin","doi":"10.1109/CIS.2007.115","DOIUrl":"https://doi.org/10.1109/CIS.2007.115","url":null,"abstract":"The sensitivity attack is a main threat to the security of watermarking schemes with open detectors. By the attempts across the detection boundary, the attackers gain adequate information of the embedded watermark to remove it with- out introducing serious distortions into the watermarked works. In some image watermarking schemes, the detection boundaries are the patchworks of certain numbers of hyper- planes. Here the existing sensitivity attacks are not suitable anymore for the detection functions have numbers of differ- ent gradients. The letter proposed a new sensitivity attack in which the attacking directions were calculated with a cer- tain number of gradients estimated separately with the old sensitivity attack. Our experiments show the new attack can remove the watermarks successfully without seriously tam- pering the fidelity.","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":"129131290","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
扫码关注我们
求助内容：
应助结果提醒方式：