Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747536
Shijun Wang, Ruifeng Ding
This paper decomposes a controlled autoregressive autoregressive moving average (CARARMA) system into two subsystems, uses the data filtering technique to drive a multi-innovation stochastic gradient algorithm for identifying the parameters of each subsystems. The basic idea is to replace the unknown variables in the information vectors with their corresponding estimates. The simulation example shows that the proposed algorithms can work well.
{"title":"A multi-innovation stochastic gradient parameter estimation algorithm for controlled autoregressive ARMA systems based on the data filtering","authors":"Shijun Wang, Ruifeng Ding","doi":"10.1109/ICIST.2013.6747536","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747536","url":null,"abstract":"This paper decomposes a controlled autoregressive autoregressive moving average (CARARMA) system into two subsystems, uses the data filtering technique to drive a multi-innovation stochastic gradient algorithm for identifying the parameters of each subsystems. The basic idea is to replace the unknown variables in the information vectors with their corresponding estimates. The simulation example shows that the proposed algorithms can work well.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130623223","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747849
Songzhao Xie, Chengyou Wang, Chao Cui
This paper studies the statistical properties and distributed properties of the coefficients after the image is decomposed at different scales by using the wavelet transform. The different quantization and coding scheme for each subimage are carried out in accordance with its statistical properties and distributed properties of the coefficients. The wavelet coefficients in low frequency subimages are compressed by using Differential Pulse Code Modulation (DPCM). The wavelet coefficients in high frequency subimages are compressed and vector quantized by using Kohonen neural network on Self-Organizing Feature Mapping (SOFM) algorithm. In addition, an improved SOFM algorithm is used in vector quantization in order to shorten the encoding and decoding time. Using these compression techniques, we can obtain rather satisfactory compression ratio as well as shorten the encoding and decoding time while achieving superior reconstructed images.
{"title":"Vector quantization image coding based on biorthogonal wavelet transform and improved SOFM","authors":"Songzhao Xie, Chengyou Wang, Chao Cui","doi":"10.1109/ICIST.2013.6747849","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747849","url":null,"abstract":"This paper studies the statistical properties and distributed properties of the coefficients after the image is decomposed at different scales by using the wavelet transform. The different quantization and coding scheme for each subimage are carried out in accordance with its statistical properties and distributed properties of the coefficients. The wavelet coefficients in low frequency subimages are compressed by using Differential Pulse Code Modulation (DPCM). The wavelet coefficients in high frequency subimages are compressed and vector quantized by using Kohonen neural network on Self-Organizing Feature Mapping (SOFM) algorithm. In addition, an improved SOFM algorithm is used in vector quantization in order to shorten the encoding and decoding time. Using these compression techniques, we can obtain rather satisfactory compression ratio as well as shorten the encoding and decoding time while achieving superior reconstructed images.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116939631","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747586
Benchi Li, C. Dang, Jinjin Zheng
In this paper, a distributed implementation of Dang's iterative method [1] is proposed to solve the airline disruption problems caused by the airport closures. The problem consists of two subproblems, and the solution domain of the first subproblem is divided into several segments by the initial seeds cluster division method. Dang's method [1] is applied to solve the first subproblem in each segment simultaneously in a distributed computation network, and the obtained feasible flight routes are used to solve the second subproblem. Numerical results show that the proposed method is better than CPLEX and Liu et al. [2].
{"title":"Solving the large airline disruption problems using a distributed computation approach to integer programming","authors":"Benchi Li, C. Dang, Jinjin Zheng","doi":"10.1109/ICIST.2013.6747586","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747586","url":null,"abstract":"In this paper, a distributed implementation of Dang's iterative method [1] is proposed to solve the airline disruption problems caused by the airport closures. The problem consists of two subproblems, and the solution domain of the first subproblem is divided into several segments by the initial seeds cluster division method. Dang's method [1] is applied to solve the first subproblem in each segment simultaneously in a distributed computation network, and the obtained feasible flight routes are used to solve the second subproblem. Numerical results show that the proposed method is better than CPLEX and Liu et al. [2].","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132640776","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747825
Yubo Wang, Chenggui Wang, Chao Li, Ducheng Wu
In this paper, we present an improved strategy of channel probing and transmission scheduling in a multi-rate wireless system. We consider a fixed data time model, where time is slotted and channel states do not change within one slot. In a multichannel wireless system, a transmitter can opportunistically use channels with high-quality conditions. In order to make better decisions and find out the channel with the maximum transmission rate, the transmitter should probe individual channels by sending control packets, which will consume time and energy, thus reduce effective time for actual data transmission. In fact, the coherence time of the channel may be much larger than the duration of one slot. We can send multiple back-to-back packets if the channel are always in good conditions. Leveraging the absorbing Markov chain model, we propose a strategy for opportunistic spectral usage, in which both time and frequency domain process are taken into account.
{"title":"Improved strategy of time-frequency opportunistic spectral usage for multi-rate wireless systems","authors":"Yubo Wang, Chenggui Wang, Chao Li, Ducheng Wu","doi":"10.1109/ICIST.2013.6747825","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747825","url":null,"abstract":"In this paper, we present an improved strategy of channel probing and transmission scheduling in a multi-rate wireless system. We consider a fixed data time model, where time is slotted and channel states do not change within one slot. In a multichannel wireless system, a transmitter can opportunistically use channels with high-quality conditions. In order to make better decisions and find out the channel with the maximum transmission rate, the transmitter should probe individual channels by sending control packets, which will consume time and energy, thus reduce effective time for actual data transmission. In fact, the coherence time of the channel may be much larger than the duration of one slot. We can send multiple back-to-back packets if the channel are always in good conditions. Leveraging the absorbing Markov chain model, we propose a strategy for opportunistic spectral usage, in which both time and frequency domain process are taken into account.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132787985","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747720
Hui Wang, Ting-Zhu Huang
In this paper, an efficient active contour with Gaussian distribution fitting energy is proposed for image segmentation. We introduce the Gaussian distribution to construct the fitting energy, which drives the active contour toward the object boundaries. In order to protect the smoothness property and the stability, a reaction diffusion approach is borrowed to design a two-stage scheme, which eliminates the procedure of re-initialization of traditional level set methods and improves the segmentation quality effectively.
{"title":"An efficient active contour with Gaussian distribution fitting energy","authors":"Hui Wang, Ting-Zhu Huang","doi":"10.1109/ICIST.2013.6747720","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747720","url":null,"abstract":"In this paper, an efficient active contour with Gaussian distribution fitting energy is proposed for image segmentation. We introduce the Gaussian distribution to construct the fitting energy, which drives the active contour toward the object boundaries. In order to protect the smoothness property and the stability, a reaction diffusion approach is borrowed to design a two-stage scheme, which eliminates the procedure of re-initialization of traditional level set methods and improves the segmentation quality effectively.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128164416","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747764
Lei Fang, Yu Zhang, Jun Zhu, Jianxin Yang
RS(255,223) code is used in concatenated code system for its strong error-correcting ability for burst error. The most important problem of the design of RS decoder is the key equation solution (KES). In this paper, BM iterative decoding algorithms for KES is introduced, and its implementation structure is also described. Simulation shows that the designed RS(255,223) has suffi ciently met the requirement of throughput in the concatenated decoder.
{"title":"Research on RS(255,223) code in concatenated decoder system","authors":"Lei Fang, Yu Zhang, Jun Zhu, Jianxin Yang","doi":"10.1109/ICIST.2013.6747764","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747764","url":null,"abstract":"RS(255,223) code is used in concatenated code system for its strong error-correcting ability for burst error. The most important problem of the design of RS decoder is the key equation solution (KES). In this paper, BM iterative decoding algorithms for KES is introduced, and its implementation structure is also described. Simulation shows that the designed RS(255,223) has suffi ciently met the requirement of throughput in the concatenated decoder.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128453782","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747844
Xiangyang Xu, W. Luo, Huawei Song, Lizhi Zhang
This paper studies physical-layer security without knowing the eavesdropper's channel state information. The use of ill-posed theory to protect wireless transmissions is proposed. Firstly, the problem of randomized transmission is translated to that of solving ill-posed equation to guarantee wireless transmissions with inherent low-probability-of interception (LPI). Secondly, by exploiting the nonunique or instable solutions of an ill-posed problem, two mechanisms are proposed that satisfy the given security requirement while achieving good throughput performance. Our results show that ill-posed problem is not always nasty. We hope that by identifying ill-posed problem inversely, a theoretical framework of enhancing physical-layer security can be constructed eventually.
{"title":"Enhancing wireless security with theory of ill-posed problem: A novel physical-layer encryption mechanism","authors":"Xiangyang Xu, W. Luo, Huawei Song, Lizhi Zhang","doi":"10.1109/ICIST.2013.6747844","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747844","url":null,"abstract":"This paper studies physical-layer security without knowing the eavesdropper's channel state information. The use of ill-posed theory to protect wireless transmissions is proposed. Firstly, the problem of randomized transmission is translated to that of solving ill-posed equation to guarantee wireless transmissions with inherent low-probability-of interception (LPI). Secondly, by exploiting the nonunique or instable solutions of an ill-posed problem, two mechanisms are proposed that satisfy the given security requirement while achieving good throughput performance. Our results show that ill-posed problem is not always nasty. We hope that by identifying ill-posed problem inversely, a theoretical framework of enhancing physical-layer security can be constructed eventually.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"543 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132229518","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747780
Songzhao Xie, Chengyou Wang, Zhiqiang Yang
In recent years, the algorithm of Bayer patterned image compression based on “structure separation” has achieved better image quality. On the basis of previous work, the algorithm based on the All Phase Inverse Discrete Cosine Biorthogonal Transform (APIDCBT) and All Phase IDCT (APIDCT) interpolation is proposed in this paper. Instead of the conventional Discrete Cosine Transform (DCT), the APIDCBT is applied to the JPEG image compression (APIDCBT-JPEG), which significantly reduces complex multiplications and makes the quantization table simpler. Two kinds of interpolation methods to the decompressed image data are also discussed in this paper, including bilinear interpolation and the novel interpolation method based on APIDCT. Experimental results show that the proposed algorithm outperforms the algorithm based on “structure separation”; and the APIDCT interpolation performs close to the bilinear interpolation method and behaves better than it at high bit rates.
{"title":"Bayer patterned image compression based on APIDCBT-JPEG and all phase IDCT interpolation","authors":"Songzhao Xie, Chengyou Wang, Zhiqiang Yang","doi":"10.1109/ICIST.2013.6747780","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747780","url":null,"abstract":"In recent years, the algorithm of Bayer patterned image compression based on “structure separation” has achieved better image quality. On the basis of previous work, the algorithm based on the All Phase Inverse Discrete Cosine Biorthogonal Transform (APIDCBT) and All Phase IDCT (APIDCT) interpolation is proposed in this paper. Instead of the conventional Discrete Cosine Transform (DCT), the APIDCBT is applied to the JPEG image compression (APIDCBT-JPEG), which significantly reduces complex multiplications and makes the quantization table simpler. Two kinds of interpolation methods to the decompressed image data are also discussed in this paper, including bilinear interpolation and the novel interpolation method based on APIDCT. Experimental results show that the proposed algorithm outperforms the algorithm based on “structure separation”; and the APIDCT interpolation performs close to the bilinear interpolation method and behaves better than it at high bit rates.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134105201","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747830
Mingliang Li, Kaizhi Huang, Zhou Zhong
The projection of the random multi-antenna weighted vector structured with spatial scrambling is of constant modulus on the main channel, Eavesdropper can take the advantage of multi-antenna to intercept private information. To solve this problem, we design a kind of physical-layer secrecy method based on the joint scrambling with spatial and frequency resource. Based on the parallel transmission nature of OFDM, we construct a random multiple antenna weighted vector in the each subcarrier, the projection of which on the main channel is equal to a dynamic reference variable. The legitimate user can correctly demodulate the receive signal by this reference variable obtained from the estimation of the reference subcarrier. Meanwhile, because of the difference between the main channel and eavesdropper channel, eavesdropper can't obtain the useful information. The simulation results show that, when the legitimate users can correctly demodulate the received signal, the eavesdropper can't intercept the private information using whether blind equalization or MUSIC-like method.
{"title":"Physical-layer security based on joint scrambling with spatial and frequency resource","authors":"Mingliang Li, Kaizhi Huang, Zhou Zhong","doi":"10.1109/ICIST.2013.6747830","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747830","url":null,"abstract":"The projection of the random multi-antenna weighted vector structured with spatial scrambling is of constant modulus on the main channel, Eavesdropper can take the advantage of multi-antenna to intercept private information. To solve this problem, we design a kind of physical-layer secrecy method based on the joint scrambling with spatial and frequency resource. Based on the parallel transmission nature of OFDM, we construct a random multiple antenna weighted vector in the each subcarrier, the projection of which on the main channel is equal to a dynamic reference variable. The legitimate user can correctly demodulate the receive signal by this reference variable obtained from the estimation of the reference subcarrier. Meanwhile, because of the difference between the main channel and eavesdropper channel, eavesdropper can't obtain the useful information. The simulation results show that, when the legitimate users can correctly demodulate the received signal, the eavesdropper can't intercept the private information using whether blind equalization or MUSIC-like method.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133483824","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747750
S. Xiong, Changjiang Chen, Jinhua Huang
This paper first introduces the conception of grid community with respect to the existing problems in education resource management and based on its characteristics, the construction and internal structure of a grid community are discussed. Then, according to the resource distribution in grid, the information sharing mechanism among communities is proposed and the procedure realization is also given, all this will result in the effective sharing of education resource in a high degree.
{"title":"The study to realize effective sharing for education resource based on grid technology","authors":"S. Xiong, Changjiang Chen, Jinhua Huang","doi":"10.1109/ICIST.2013.6747750","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747750","url":null,"abstract":"This paper first introduces the conception of grid community with respect to the existing problems in education resource management and based on its characteristics, the construction and internal structure of a grid community are discussed. Then, according to the resource distribution in grid, the information sharing mechanism among communities is proposed and the procedure realization is also given, all this will result in the effective sharing of education resource in a high degree.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133946922","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
扫码关注我们
求助内容：
应助结果提醒方式：