Pub Date : 2014-10-13DOI: 10.1109/ICIST.2014.6920391
Qiufu Li, Derong Chen, Jiulu Gong
In order to improve the efficiency of algorithm, parameter optimization for hyperspectral image compression algorithm of maximum error controllable has been studied in this paper. Firstly, a mathematic optimal model for the hyperspectral image compression ratio was established. Secondly, we analyzed the model and simplified it by Gaussian function. Finally, some real hyperspectral images' compression ratios were estimated using the model. Experiments show the relative error between the estimations and the simulation results is less than 5%, and 31.25% of the both results are exactly the same. In addition, the optimal model saves 70% of running time. These illustrate the high effectiveness and practicability of the optimal model.
{"title":"Parameter optimization for hyperspectral image compression algorithm of maximum error controllable","authors":"Qiufu Li, Derong Chen, Jiulu Gong","doi":"10.1109/ICIST.2014.6920391","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920391","url":null,"abstract":"In order to improve the efficiency of algorithm, parameter optimization for hyperspectral image compression algorithm of maximum error controllable has been studied in this paper. Firstly, a mathematic optimal model for the hyperspectral image compression ratio was established. Secondly, we analyzed the model and simplified it by Gaussian function. Finally, some real hyperspectral images' compression ratios were estimated using the model. Experiments show the relative error between the estimations and the simulation results is less than 5%, and 31.25% of the both results are exactly the same. In addition, the optimal model saves 70% of running time. These illustrate the high effectiveness and practicability of the optimal model.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127840717","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}
With the development of science and technology, we have collected a lot of trajectory data. Obtaining useful pattern from these data is an important direction of the trajectory data mining. In order to find these models, a good distance measurement between trajectories of moving object may be necessary. In this paper, we propose a new method of distance measurement, the Grid-Based DTW (GDTW). The trajectory will be converted into continuous grid cell, then get the distance by Dynamic Time Warping (DTW) measurement. This method can more effectively measure the distance of two trajectory. Experiment results show the effectiveness of our proposed means.
{"title":"Using DTW to measure trajectory distance in grid space","authors":"Yushun Wang, Peng Lei, Hanhai Zhou, Xiaoping Wang, Min Ma, Xiaoyun Chen","doi":"10.1109/ICIST.2014.6920353","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920353","url":null,"abstract":"With the development of science and technology, we have collected a lot of trajectory data. Obtaining useful pattern from these data is an important direction of the trajectory data mining. In order to find these models, a good distance measurement between trajectories of moving object may be necessary. In this paper, we propose a new method of distance measurement, the Grid-Based DTW (GDTW). The trajectory will be converted into continuous grid cell, then get the distance by Dynamic Time Warping (DTW) measurement. This method can more effectively measure the distance of two trajectory. Experiment results show the effectiveness of our proposed means.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125430241","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920556
Chao Yang, Fang Liu, Zhan Song
Color coding is an important research topic in spatial encoded structured light sensing (SLS). In this study, we propose a novel graphical model based approach for the color pattern decoding task. For efficient color labeling, the color pattern is firstly decomposed into separate binary pattern images. With the labeled pattern elements, a unified probabilistic graphical framework is constructed to represent the pseudorandom pattern as a clique tree structure. The model contains two parts: the Conditional Random Field (CRF) is used to represent the dependences between these local decisions, and the Bayesian network (BN) is applied for the representation of background colors effect. A colorful target is experimented to demonstrate its feasibility. And the 3D reconstructed models based on the decoding results are also provided to show its robustness.
{"title":"A unified probabilistic graphical model based approach for the robust decoding of color structured light pattern","authors":"Chao Yang, Fang Liu, Zhan Song","doi":"10.1109/ICIST.2014.6920556","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920556","url":null,"abstract":"Color coding is an important research topic in spatial encoded structured light sensing (SLS). In this study, we propose a novel graphical model based approach for the color pattern decoding task. For efficient color labeling, the color pattern is firstly decomposed into separate binary pattern images. With the labeled pattern elements, a unified probabilistic graphical framework is constructed to represent the pseudorandom pattern as a clique tree structure. The model contains two parts: the Conditional Random Field (CRF) is used to represent the dependences between these local decisions, and the Bayesian network (BN) is applied for the representation of background colors effect. A colorful target is experimented to demonstrate its feasibility. And the 3D reconstructed models based on the decoding results are also provided to show its robustness.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114988809","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920380
Hui-dong Huangfu, Hongjin Zeng, Jun Zhong, Rui Cao, Haoliang Zhang
In this paper, the attenuation characteristics (attenuation vs microwave pulse power) of the microwave attenuator with wedge-type carbonyl iron (CI) under high power microwave (HPM) pulses are investigated. A reliable experimental platform was set up and used to measure the attenuation under HPM pulses. A database describing the attenuation dependence of the injected microwave pulse power (MPP) up to 100kW on various pulses width of 200ns to 1us and repeating frequency of 10Hz to 500Hz is created. The results indicate that (I) the attenuation decrease with the increasing of the injected MPP; (II) with the attenuation increasing, the variation of attenuation in whole injected MPP range increase; (III) the effects of different pulses width and repeating frequency on attenuation characteristics can be ignored.
{"title":"Research on attenuation characteristics of microwave attenuator under HPM pulses","authors":"Hui-dong Huangfu, Hongjin Zeng, Jun Zhong, Rui Cao, Haoliang Zhang","doi":"10.1109/ICIST.2014.6920380","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920380","url":null,"abstract":"In this paper, the attenuation characteristics (attenuation vs microwave pulse power) of the microwave attenuator with wedge-type carbonyl iron (CI) under high power microwave (HPM) pulses are investigated. A reliable experimental platform was set up and used to measure the attenuation under HPM pulses. A database describing the attenuation dependence of the injected microwave pulse power (MPP) up to 100kW on various pulses width of 200ns to 1us and repeating frequency of 10Hz to 500Hz is created. The results indicate that (I) the attenuation decrease with the increasing of the injected MPP; (II) with the attenuation increasing, the variation of attenuation in whole injected MPP range increase; (III) the effects of different pulses width and repeating frequency on attenuation characteristics can be ignored.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116019227","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920532
Huapeng Wu
Montgomery multiplication in finite fields has been paid more and more attention recently since it shows advantageous over regular multiplication in speeding up elliptic curve cryptography based network security protocols. In this paper, a most-significant-bit first bit-serial Montgomery multiplication algorithm in GF(2m) using weakly dual bases is proposed for the first time. Then a new bit-serial Montgomery multiplier architecture is proposed using a linear feedback shift register (LFSR). Complexity comparison has shown that the proposed multiplier is comparable to or has certain advantage over the best among the existing similar works found in the literature.
{"title":"Efficient bit-serial finite field montgomery multiplier in GF(2m)","authors":"Huapeng Wu","doi":"10.1109/ICIST.2014.6920532","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920532","url":null,"abstract":"Montgomery multiplication in finite fields has been paid more and more attention recently since it shows advantageous over regular multiplication in speeding up elliptic curve cryptography based network security protocols. In this paper, a most-significant-bit first bit-serial Montgomery multiplication algorithm in GF(2m) using weakly dual bases is proposed for the first time. Then a new bit-serial Montgomery multiplier architecture is proposed using a linear feedback shift register (LFSR). Complexity comparison has shown that the proposed multiplier is comparable to or has certain advantage over the best among the existing similar works found in the literature.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123436941","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920595
Yiding Hu, Weixin Ren
A method based on Hilbert Transform is presented to separate components or to extract the envelope from the non-stationary amplitude modulated signals in the product model where the non-stationary signal is the product of the non-stationary slowly-varying component and stationary fast component. Numerical examples are given to illustrate the efficiency of the presented method. It is demonstrated that the stationary part can be successfully separated from the non-stationary amplitude modulated signals in the product model.
{"title":"Separating the components of amplitude modulated non-stationary signal based on Hilbert transform","authors":"Yiding Hu, Weixin Ren","doi":"10.1109/ICIST.2014.6920595","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920595","url":null,"abstract":"A method based on Hilbert Transform is presented to separate components or to extract the envelope from the non-stationary amplitude modulated signals in the product model where the non-stationary signal is the product of the non-stationary slowly-varying component and stationary fast component. Numerical examples are given to illustrate the efficiency of the presented method. It is demonstrated that the stationary part can be successfully separated from the non-stationary amplitude modulated signals in the product model.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123551734","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920378
D. Hu, Jiajun Wang, Erxi Fang, W. Zhou, Yue Zhou
Full-scanned photoacoustic data of the sample are needed to achieve better quality of the reconstructed photoacoustic image with filtered back projection algorithm. However, such a requirement is usually difficult to be satisfied due to the restrictions of the hardware conditions and spatial size. To tackle such a problem, a compressed sensing based method was proposed to recover the full-scanned photoacoustic data from the incomplete measurements. The results from the numerical simulation demonstrates that both the mean squared error and the peak signal-to-noise ratio(PSNR) of the image can significantly improved with our proposed method.
{"title":"The application of compressed sensing method in photoacoustic image reconstruction","authors":"D. Hu, Jiajun Wang, Erxi Fang, W. Zhou, Yue Zhou","doi":"10.1109/ICIST.2014.6920378","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920378","url":null,"abstract":"Full-scanned photoacoustic data of the sample are needed to achieve better quality of the reconstructed photoacoustic image with filtered back projection algorithm. However, such a requirement is usually difficult to be satisfied due to the restrictions of the hardware conditions and spatial size. To tackle such a problem, a compressed sensing based method was proposed to recover the full-scanned photoacoustic data from the incomplete measurements. The results from the numerical simulation demonstrates that both the mean squared error and the peak signal-to-noise ratio(PSNR) of the image can significantly improved with our proposed method.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117233964","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 this paper, we present a hardware design which can support the inverse transform size from 32×32 in high efficiency video coding (HEVC) and is implemented by a using single 1-D IDCT core with a memory to low cost architecture. The proposed 1-D IDCT core employs two calculating paths to achieve a high throughput rate and is implemented by a 1-D inverse transform which can calculate 1st-D and 2nd-Ddata simultaneously in two parallel paths. The proposed 2-D transform core can implement a throughput rate of 332-Mpels/s with 129k gate area.
{"title":"Low-cost video transform for HEVC","authors":"Chieh-Yang Liu, Wen-Quan He, Yung-Ming Chang, Yuan-Ho Chen","doi":"10.1109/ICIST.2014.6920370","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920370","url":null,"abstract":"In this paper, we present a hardware design which can support the inverse transform size from 32×32 in high efficiency video coding (HEVC) and is implemented by a using single 1-D IDCT core with a memory to low cost architecture. The proposed 1-D IDCT core employs two calculating paths to achieve a high throughput rate and is implemented by a 1-D inverse transform which can calculate 1st-D and 2nd-Ddata simultaneously in two parallel paths. The proposed 2-D transform core can implement a throughput rate of 332-Mpels/s with 129k gate area.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124642197","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920543
Jing Gao, Jinkuan Wang, Bin Wang
One of the key technologies of orthogonal frequency division multiplexing (OFDM) systems is its large peak to average power ratio (PAPR) of the channel signals. Partial transmit sequences (PTS) is a kind of promising method that improves PAPR performance effectively with not distortion processing, the complexity of PTS algorithm increases quickly with the divided number of signal blocks. Therefore, a novel sub-optimal algorithm is proposed to reduce computational complexity in this paper, which use the bacterial foraging optimization to realize the search process of optimal phase factors. Simulation results demonstrate that the proposed method can obtain better balance between PAPR performance and computational complexity.
{"title":"Power control with suboptimal algorithm for wireless communication systems","authors":"Jing Gao, Jinkuan Wang, Bin Wang","doi":"10.1109/ICIST.2014.6920543","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920543","url":null,"abstract":"One of the key technologies of orthogonal frequency division multiplexing (OFDM) systems is its large peak to average power ratio (PAPR) of the channel signals. Partial transmit sequences (PTS) is a kind of promising method that improves PAPR performance effectively with not distortion processing, the complexity of PTS algorithm increases quickly with the divided number of signal blocks. Therefore, a novel sub-optimal algorithm is proposed to reduce computational complexity in this paper, which use the bacterial foraging optimization to realize the search process of optimal phase factors. Simulation results demonstrate that the proposed method can obtain better balance between PAPR performance and computational complexity.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412374","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920531
Huang Ji-jiang, Cao Jian-zhong, Yi Bo, Liu Chen
Discrete wavelet transform (DWT) is being broadly used in processing digital image, but the large requirement of memory and the time delay limit the DWT usage. For instance, when the image is processed in the space, the realtime processing, low power consumption, reduced complexity and low memory consumption are required. Lifting-based DWT is implemented to lessen complexity. And then the coefficients of the lifting filters are turned to be binary and the filters are therefore implemented efficiently without using any multiplier. In this way the frequency of DWT can be improved and the architecture is simplified. When 2-dimensional DWT is carried out, the line-based wavelet transform is able to save memory in a larger sense. The architecture of line-based wavelet can also be executed in a parallel way. Both horizontal transform and vertical transform can be executed at the same time. This paper takes 9/7 wavelet as an example and compares with others its architecture and performance. The advantages of this design include real-time performance improvement, memory reduction and architecture simplification.
{"title":"Low-memory-usage and high-speed image wavelet transform","authors":"Huang Ji-jiang, Cao Jian-zhong, Yi Bo, Liu Chen","doi":"10.1109/ICIST.2014.6920531","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920531","url":null,"abstract":"Discrete wavelet transform (DWT) is being broadly used in processing digital image, but the large requirement of memory and the time delay limit the DWT usage. For instance, when the image is processed in the space, the realtime processing, low power consumption, reduced complexity and low memory consumption are required. Lifting-based DWT is implemented to lessen complexity. And then the coefficients of the lifting filters are turned to be binary and the filters are therefore implemented efficiently without using any multiplier. In this way the frequency of DWT can be improved and the architecture is simplified. When 2-dimensional DWT is carried out, the line-based wavelet transform is able to save memory in a larger sense. The architecture of line-based wavelet can also be executed in a parallel way. Both horizontal transform and vertical transform can be executed at the same time. This paper takes 9/7 wavelet as an example and compares with others its architecture and performance. The advantages of this design include real-time performance improvement, memory reduction and architecture simplification.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130156130","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
扫码关注我们
求助内容：
应助结果提醒方式：