In this paper, an unsupervised change detection method for multitemporal remote sensing images is proposed. Firstly, the difference image is obtained from two multitemporal images acquired on the same geographical area but at different time instances. Then the difference image is decomposed by nonsubsampled contour let transform (NSCT). For each pixel in the difference image, a feature vector is extracted using the NSCT coefficients and the difference image itself which are in the same position. The final change map is achieved by clustering the feature vectors using kernel fuzzy c-means (KFCM) clustering algorithm into two classes: changed and unchanged. The change detection results are compared with those of several state-of-the-art methods. And the experimental results demonstrate that the proposed method yields superior performance.
{"title":"Multitemporal Images Change Detection Using Nonsubsampled Contourlet Transform and Kernel Fuzzy C-Means Clustering","authors":"Chao Wu, Yiquan Wu","doi":"10.1109/IPTC.2011.31","DOIUrl":"https://doi.org/10.1109/IPTC.2011.31","url":null,"abstract":"In this paper, an unsupervised change detection method for multitemporal remote sensing images is proposed. Firstly, the difference image is obtained from two multitemporal images acquired on the same geographical area but at different time instances. Then the difference image is decomposed by nonsubsampled contour let transform (NSCT). For each pixel in the difference image, a feature vector is extracted using the NSCT coefficients and the difference image itself which are in the same position. The final change map is achieved by clustering the feature vectors using kernel fuzzy c-means (KFCM) clustering algorithm into two classes: changed and unchanged. The change detection results are compared with those of several state-of-the-art methods. And the experimental results demonstrate that the proposed method yields superior performance.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124158624","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 presents a feature point based image watermarking scheme to achieve binary digital image's imbedded and blind extraction. Firstly, the stable image feature points are extracted from the host image by using image normalization and the scale-invariant feature transform, which can resist toward desynchronization attacks. Then Discrete Wavelet Transform (DWT) is used to the local feature regions(LFR). Finally, each LFR is embeds watermark. Experimental results show that the proposed image watermarking can resist both traditional signal processing attacks and geometric attacks.
{"title":"A Feature-Based Robust Digital Image Watermarking Scheme Using Image Normalization and Quantization","authors":"Jia Xu, Liu-Ping Feng","doi":"10.1109/IPTC.2011.24","DOIUrl":"https://doi.org/10.1109/IPTC.2011.24","url":null,"abstract":"This paper presents a feature point based image watermarking scheme to achieve binary digital image's imbedded and blind extraction. Firstly, the stable image feature points are extracted from the host image by using image normalization and the scale-invariant feature transform, which can resist toward desynchronization attacks. Then Discrete Wavelet Transform (DWT) is used to the local feature regions(LFR). Finally, each LFR is embeds watermark. Experimental results show that the proposed image watermarking can resist both traditional signal processing attacks and geometric attacks.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130880317","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}
MPEG-4 AAC audio coding is the most widely used audio coding at present, but the MPEG-4 AAC audio coding standard has high complexity, long time delay and huge computation, what's more, it is not beneficial for real-time applications. Psychoacoustic model is the core part of the audio encoder, so huge computation also exists. Through researching the masking expansion feature of psychoacoustic, the computation process of the spread function is improved, the psychoacoustic computation decreased, the coding time is reduced, and the experimental results are given, which has important practical meaning to the research of real-time audio coding.
{"title":"Optimization of Masking Expansion Algorithm in Psychoacoustic Models","authors":"Liu Hong-fu, Zhang Cong, Li Rui-fan","doi":"10.1109/IPTC.2011.48","DOIUrl":"https://doi.org/10.1109/IPTC.2011.48","url":null,"abstract":"MPEG-4 AAC audio coding is the most widely used audio coding at present, but the MPEG-4 AAC audio coding standard has high complexity, long time delay and huge computation, what's more, it is not beneficial for real-time applications. Psychoacoustic model is the core part of the audio encoder, so huge computation also exists. Through researching the masking expansion feature of psychoacoustic, the computation process of the spread function is improved, the psychoacoustic computation decreased, the coding time is reduced, and the experimental results are given, which has important practical meaning to the research of real-time audio coding.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130969758","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 three kinds of data, such as 3D Vertical Seismic Profile (VSP), multiple directional Walkaway VSP and full azimuth seismic data, the Vertical Transverse Isotropy (VTI) characteristics of plutonic igneous rock are studied, and an approach to calculate anisotropic parameter is presented. It is concluded that the target zone has apparent VTI characteristics. And then Addition of VTI anisotropic parameter can reduce the difference between forward move out and first break observation of reflection. It is also clearly that the anisotropic parameter estimated from multiple directional Walkaway VSP data is consistent with that from 3D VSP data.
{"title":"The Research on Anisotropic Parameter Estimation for Vertical Transerse Isotropy: Based on 3D VSP, Walkaway VSP and Full Azimuth Seismic Data","authors":"Xiang'e Sun, Y. Ling, Jun Gao","doi":"10.1109/IPTC.2011.41","DOIUrl":"https://doi.org/10.1109/IPTC.2011.41","url":null,"abstract":"Based on three kinds of data, such as 3D Vertical Seismic Profile (VSP), multiple directional Walkaway VSP and full azimuth seismic data, the Vertical Transverse Isotropy (VTI) characteristics of plutonic igneous rock are studied, and an approach to calculate anisotropic parameter is presented. It is concluded that the target zone has apparent VTI characteristics. And then Addition of VTI anisotropic parameter can reduce the difference between forward move out and first break observation of reflection. It is also clearly that the anisotropic parameter estimated from multiple directional Walkaway VSP data is consistent with that from 3D VSP data.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126305811","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 population migration algorithm is a very effective evolutionary algorithm to solve optimization problem, but there are little application in solving the multi-objective optimization problem. On the basis of vector evaluated method and Dynamic Weighted Aggregation combined those advantage, this paper presents a population migration algorithm based on vector evaluated method and Dynamic Weighted Aggregation for multi-objective optimization problems. At the same time, this paper population flow approach, which can more effective in local search. Experimental results show the algorithm is feasible.
{"title":"An Improved Multi-objective Population Migration Optimization Algorithm","authors":"Qian Zhao, Xueying Liu","doi":"10.1109/IPTC.2011.43","DOIUrl":"https://doi.org/10.1109/IPTC.2011.43","url":null,"abstract":"The population migration algorithm is a very effective evolutionary algorithm to solve optimization problem, but there are little application in solving the multi-objective optimization problem. On the basis of vector evaluated method and Dynamic Weighted Aggregation combined those advantage, this paper presents a population migration algorithm based on vector evaluated method and Dynamic Weighted Aggregation for multi-objective optimization problems. At the same time, this paper population flow approach, which can more effective in local search. Experimental results show the algorithm is feasible.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114645263","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 image segmentation is an important using in the computer image processing. This paper proposed a new method: the color components' exchanging on the different color spaces. Based the method and combine with other traditional image segmentation methods, try to use in the image segmentation, and get some results.
{"title":"The Color Components' Exchanging on Different Color Spaces and the Using for Image Segmentation","authors":"Xi Li, Hang Dai","doi":"10.1109/IPTC.2011.38","DOIUrl":"https://doi.org/10.1109/IPTC.2011.38","url":null,"abstract":"The image segmentation is an important using in the computer image processing. This paper proposed a new method: the color components' exchanging on the different color spaces. Based the method and combine with other traditional image segmentation methods, try to use in the image segmentation, and get some results.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114541781","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 cooperative relay system, relay nodes forward traffic will cause an increase of network loads, which will affect the system throughput. However, most existing cooperative schemes do not consider the impact of the network loads. In this paper, we propose a novel cooperative relay method called Cooperative communication based on offered load (CCBOL) for wireless networks, in which the relay method is the IEEE 802.11 DCF (Distribution Coordination Function) scheme. In CCBOL, we introduce the offered load to analyze the throughput performance for the proposed cooperative relay system. We utilize throughput performance as a metric to decide whether cooperation is adopted. The analysis and simulation results show that CCBOL can significantly improve the throughput comparing with the existing direct communication under some offered load networks.
{"title":"A Cooperative Relay Method and Performance for Wireless Networks","authors":"Yun Li, Shufang Song, M. Daneshmand, Weina Duan","doi":"10.1109/IPTC.2011.15","DOIUrl":"https://doi.org/10.1109/IPTC.2011.15","url":null,"abstract":"In cooperative relay system, relay nodes forward traffic will cause an increase of network loads, which will affect the system throughput. However, most existing cooperative schemes do not consider the impact of the network loads. In this paper, we propose a novel cooperative relay method called Cooperative communication based on offered load (CCBOL) for wireless networks, in which the relay method is the IEEE 802.11 DCF (Distribution Coordination Function) scheme. In CCBOL, we introduce the offered load to analyze the throughput performance for the proposed cooperative relay system. We utilize throughput performance as a metric to decide whether cooperation is adopted. The analysis and simulation results show that CCBOL can significantly improve the throughput comparing with the existing direct communication under some offered load networks.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121430988","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}
Jiangjiang Wu, Jie Zhou, Jun Ma, Songzhu Mei, Jiangchun Ren
Insider threat has become the main vector of data leakage. Existing research on it mainly focuses on sensing and detection without defense capabilities. Meanwhile, traditional technologies for data leakage prevention rely on the terminal or boundary control which is difficult for data leakage in distributed environment. This paper presents an active data leakage prevention model for insider threat that combines trusted storage with virtual isolation technologies and expresses the protection requirements from the aspect of data object. We also show an implementation framework and give formal description as well as security properties proof. Finally, we give implementation strategies of dynamic isolation mechanisms.
{"title":"An Active Data Leakage Prevention Model for Insider Threat","authors":"Jiangjiang Wu, Jie Zhou, Jun Ma, Songzhu Mei, Jiangchun Ren","doi":"10.1109/IPTC.2011.17","DOIUrl":"https://doi.org/10.1109/IPTC.2011.17","url":null,"abstract":"Insider threat has become the main vector of data leakage. Existing research on it mainly focuses on sensing and detection without defense capabilities. Meanwhile, traditional technologies for data leakage prevention rely on the terminal or boundary control which is difficult for data leakage in distributed environment. This paper presents an active data leakage prevention model for insider threat that combines trusted storage with virtual isolation technologies and expresses the protection requirements from the aspect of data object. We also show an implementation framework and give formal description as well as security properties proof. Finally, we give implementation strategies of dynamic isolation mechanisms.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127637089","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}
Researching on cavitation of propeller which is an important part of ship bubble wake has important signification for studying ship bubble wake. The three viscous flow field of a five-blade high-skew propeller was simulated with numerical method. Based on RANS method, SST turbulent model and Single full cavitation model were used to simulate and analyze the cavitation characteristics of the propeller in open water condition and behind ship wake, and the influence of wake on the propeller's characteristics. The results showed that the method and numerical model were feasible for the good accordance between numerical results and test data. At the same advanced velocity, the coefficients of torque and thrust in wake were all bigger than those in open water, and at the same cavitation number, the area of cavitation on propeller in wake was broader than that in open water.
{"title":"Numerical Simulation and Analysis of Cavitation Characteristics of Ship Propeller","authors":"Xun Pan, Jing-yuan Zhang, Cheng-jiang Liu","doi":"10.1109/IPTC.2011.53","DOIUrl":"https://doi.org/10.1109/IPTC.2011.53","url":null,"abstract":"Researching on cavitation of propeller which is an important part of ship bubble wake has important signification for studying ship bubble wake. The three viscous flow field of a five-blade high-skew propeller was simulated with numerical method. Based on RANS method, SST turbulent model and Single full cavitation model were used to simulate and analyze the cavitation characteristics of the propeller in open water condition and behind ship wake, and the influence of wake on the propeller's characteristics. The results showed that the method and numerical model were feasible for the good accordance between numerical results and test data. At the same advanced velocity, the coefficients of torque and thrust in wake were all bigger than those in open water, and at the same cavitation number, the area of cavitation on propeller in wake was broader than that in open water.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121357870","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 the problem of rational secret sharing, each player, who prefers to be the only one to learn the secret, acts rationally rather than merely honestly or maliciously in the traditional cryptographic settings. The core issue of rational secret sharing is to construct a mechanism so that all rational participants have incentive to provide their shares in the reconstruction phase. However, lack of enough incentive and how to achieve fairness in asynchronous model are always the hot potatoes for obtaining a deterministic protocol in this field. In this paper, we devote our attention to solving the above two difficulties in asynchronous model and succeed in obtaining a satisfactory result, 1/p-rational secret sharing protocol, in 2-out-of-2 case. Firstly, we apply the repeated interaction method to provide motivation so as to attract the players to participant in the collaboration and make it possible for a deterministic protocol. Secondly, inspired by 1/p-security of partial fairness, we propose a new concept, 1/p-advantage, to reduce the unavoidable probability of unfairness in asynchronous model to a satisfactory level. Besides, in order to perfect our protocol, we bring in the augmented perfect coin-tossing to determine the sending-order at the start of every round. Compared with previous ones, our protocol is applicable to the asynchronous model as well as the traditional synchronous model, which makes our protocol more practical. Furthermore, the new concept, 1/p-advantage, gives us a new perspective on rational secret sharing and makes our solution fresh.
{"title":"A Deterministic Protocol for Rational Secret Sharing in Asynchronous Model","authors":"Yi Sun, Hongxiang Sun, Q. Wen, Hua Zhang","doi":"10.1109/IPTC.2011.9","DOIUrl":"https://doi.org/10.1109/IPTC.2011.9","url":null,"abstract":"In the problem of rational secret sharing, each player, who prefers to be the only one to learn the secret, acts rationally rather than merely honestly or maliciously in the traditional cryptographic settings. The core issue of rational secret sharing is to construct a mechanism so that all rational participants have incentive to provide their shares in the reconstruction phase. However, lack of enough incentive and how to achieve fairness in asynchronous model are always the hot potatoes for obtaining a deterministic protocol in this field. In this paper, we devote our attention to solving the above two difficulties in asynchronous model and succeed in obtaining a satisfactory result, 1/p-rational secret sharing protocol, in 2-out-of-2 case. Firstly, we apply the repeated interaction method to provide motivation so as to attract the players to participant in the collaboration and make it possible for a deterministic protocol. Secondly, inspired by 1/p-security of partial fairness, we propose a new concept, 1/p-advantage, to reduce the unavoidable probability of unfairness in asynchronous model to a satisfactory level. Besides, in order to perfect our protocol, we bring in the augmented perfect coin-tossing to determine the sending-order at the start of every round. Compared with previous ones, our protocol is applicable to the asynchronous model as well as the traditional synchronous model, which makes our protocol more practical. Furthermore, the new concept, 1/p-advantage, gives us a new perspective on rational secret sharing and makes our solution fresh.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"336 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133280147","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
扫码关注我们
求助内容：
应助结果提醒方式：