Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920581
Ping Lai, Ruimin Lu, Yunzhi Liu
In the traditional Space-Time Adaptive Processing (STAP), adaptive algorithms require signal information so that lack real-time performance and the array processing techniques are not only of high complexity but also suffer from inadequate anti-jammer capability. In order to solve these problems, a subband blind adaptive array processing algorithm is proposed in this paper, which applies the space-time interference suppression technology to Direct Sequence Spread Spectrum (DSSS) system. For one thing, compared to the pure space-domain processing, Sub-band adaptive array (SBAA) greatly increases the freedoms of degree. For another, it also simplifies algorithm complexity relative to Tapped-delay-line adaptive array (TDLAA) structure of traditional STAP. The proposed sub-band blind adaptive array algorithm can provide higher convergence speed and better convergence accuracy with low algorithm complexity. Furthermore, the novel algorithm doesn't need training sequences, increasing the ability of tracing signal changes in real time. Simulation results show that the novel space-time interference suppression scheme exhibits a better anti-jamming performance.
{"title":"Space-time interference suppression technology based on sub-band blind adaptive array processing","authors":"Ping Lai, Ruimin Lu, Yunzhi Liu","doi":"10.1109/ICIST.2014.6920581","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920581","url":null,"abstract":"In the traditional Space-Time Adaptive Processing (STAP), adaptive algorithms require signal information so that lack real-time performance and the array processing techniques are not only of high complexity but also suffer from inadequate anti-jammer capability. In order to solve these problems, a subband blind adaptive array processing algorithm is proposed in this paper, which applies the space-time interference suppression technology to Direct Sequence Spread Spectrum (DSSS) system. For one thing, compared to the pure space-domain processing, Sub-band adaptive array (SBAA) greatly increases the freedoms of degree. For another, it also simplifies algorithm complexity relative to Tapped-delay-line adaptive array (TDLAA) structure of traditional STAP. The proposed sub-band blind adaptive array algorithm can provide higher convergence speed and better convergence accuracy with low algorithm complexity. Furthermore, the novel algorithm doesn't need training sequences, increasing the ability of tracing signal changes in real time. Simulation results show that the novel space-time interference suppression scheme exhibits a better anti-jamming performance.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"397 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126756832","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}
Tone-mapping technique which can convert high dynamic range (HDR) to low dynamic range (LDR) images provides accurately visualization of HDR images on standard LDR displays. Most of the existing tone-mapping method could not realize real time processing while preserving good visualization. Utilizing an adaptive three-section lookup table, this paper proposes an effective, high quality, real time technique to convert 12-bit images to 8-bit image which can preserve abundant details and high contrast simultaneously. Experiment results show that this method can improve the weak signals of the image greatly, and the low luminance details can be observed distinctly on an 8-bit monitor.
{"title":"A novel real-time method for high dynamic range image tone mapping","authors":"Qingquan Wu, Zuofeng Zhou, Hanbing Leng, Jianzhong Cao, Jihong Wang, Zhendong Gong, Xinming Fan, Huinan Guo","doi":"10.1109/ICIST.2014.6920510","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920510","url":null,"abstract":"Tone-mapping technique which can convert high dynamic range (HDR) to low dynamic range (LDR) images provides accurately visualization of HDR images on standard LDR displays. Most of the existing tone-mapping method could not realize real time processing while preserving good visualization. Utilizing an adaptive three-section lookup table, this paper proposes an effective, high quality, real time technique to convert 12-bit images to 8-bit image which can preserve abundant details and high contrast simultaneously. Experiment results show that this method can improve the weak signals of the image greatly, and the low luminance details can be observed distinctly on an 8-bit monitor.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122286458","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.6920407
Bo Lu, X. Duan, Cun-rui Wang
Image classification is an important task in content-based image retrieval, which can be regarded as an intermediate component to handle large-scale image datasets for improving the accuracy of image retrieval. Traditional image classification methods generally utilize Support Vector Machines (SVM) as image classifier. However, there are several drawbacks of using SVM, such as the high computational cost and large number of parameters to be optimized. In this paper we propose an Extreme Learning Machine (ELM) based Multi-modality Classifier Combination Framework (MCCF) to improve the accuracy of image classification. In this framework: (i) three ELM classifiers are trained by exploring three kinds of visual features respectively, (ii) a probability based fusion method is then proposed to combine the prediction results of each ELM classifier. Experiments on the widely used TRECVID datasets demonstrate that our approach can effectively improve the accuracy of image classification and achieve performance at extremely high speed.
{"title":"A novel approach for image classification based on extreme learning machine","authors":"Bo Lu, X. Duan, Cun-rui Wang","doi":"10.1109/ICIST.2014.6920407","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920407","url":null,"abstract":"Image classification is an important task in content-based image retrieval, which can be regarded as an intermediate component to handle large-scale image datasets for improving the accuracy of image retrieval. Traditional image classification methods generally utilize Support Vector Machines (SVM) as image classifier. However, there are several drawbacks of using SVM, such as the high computational cost and large number of parameters to be optimized. In this paper we propose an Extreme Learning Machine (ELM) based Multi-modality Classifier Combination Framework (MCCF) to improve the accuracy of image classification. In this framework: (i) three ELM classifiers are trained by exploring three kinds of visual features respectively, (ii) a probability based fusion method is then proposed to combine the prediction results of each ELM classifier. Experiments on the widely used TRECVID datasets demonstrate that our approach can effectively improve the accuracy of image classification and achieve performance at extremely high speed.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116695417","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.6920592
Dihong Gong, Na Li, Zhifeng Li, Y. Qiao
Biometric person recognition has received a lot of attention in recent years due to the growing security demands in commercial and law enforcement applications. However, using a single biometric has several problems. In order to alleviate these problems, multi-modal biometric systems are proposed by combining various biometric modalities to improve the robustness of person authentication. A typical application is to combine both audio and face for multimodal person recognition, since either face or voice is among the most natural biometrics that people use to identify each other. In this paper, a novel approach called multi-feature subspace analysis (MFSA) is proposed for audio-video based biometric person recognition. In the MFSA framework, each face sequence or utterance is represented with a fix-length feature vector, and then subspace analysis method is performed on a collection of random subspaces to construct an ensemble of classifiers for robust recognition. Experiments on the XM2VTSDB corpus sufficiently validate the feasibility and effectiveness of our new approach.
{"title":"Multi-feature subspace analysis for audio-vidoe based multi-modal person recognition","authors":"Dihong Gong, Na Li, Zhifeng Li, Y. Qiao","doi":"10.1109/ICIST.2014.6920592","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920592","url":null,"abstract":"Biometric person recognition has received a lot of attention in recent years due to the growing security demands in commercial and law enforcement applications. However, using a single biometric has several problems. In order to alleviate these problems, multi-modal biometric systems are proposed by combining various biometric modalities to improve the robustness of person authentication. A typical application is to combine both audio and face for multimodal person recognition, since either face or voice is among the most natural biometrics that people use to identify each other. In this paper, a novel approach called multi-feature subspace analysis (MFSA) is proposed for audio-video based biometric person recognition. In the MFSA framework, each face sequence or utterance is represented with a fix-length feature vector, and then subspace analysis method is performed on a collection of random subspaces to construct an ensemble of classifiers for robust recognition. Experiments on the XM2VTSDB corpus sufficiently validate the feasibility and effectiveness of our new approach.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116739591","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.6920579
Huimin Wang, Qian Geng, Zhaowei Qiao
Particle swarm optimization (PSO) has made significant progress and has been widely applied to computer science and engineering. Since its introduction, the parameter tuning of PSO has always been a hot topic. As a robust design method, the Taguchi method is known as a good tool in designing parameters. Thus the Taguchi method is adopted to analyze the effect of inertia weight, acceleration coefficients, population size, fitness evaluations, and population topology on PSO, and to identify the best settings of them for different optimization problems. The results of benchmark functions show that the optimum parameter settings depend on the benchmarks, and all the functions obtain their optimum solutions after parameter tuning. Good result are also achieved when dealing with the optimization design of a Halbach permanent magnet motor, which indicates that the PSO with best parameter settings identified by the Taguchi method is more suitable to such actual engineering problem.
{"title":"Parameter tuning of particle swarm optimization by using Taguchi method and its application to motor design","authors":"Huimin Wang, Qian Geng, Zhaowei Qiao","doi":"10.1109/ICIST.2014.6920579","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920579","url":null,"abstract":"Particle swarm optimization (PSO) has made significant progress and has been widely applied to computer science and engineering. Since its introduction, the parameter tuning of PSO has always been a hot topic. As a robust design method, the Taguchi method is known as a good tool in designing parameters. Thus the Taguchi method is adopted to analyze the effect of inertia weight, acceleration coefficients, population size, fitness evaluations, and population topology on PSO, and to identify the best settings of them for different optimization problems. The results of benchmark functions show that the optimum parameter settings depend on the benchmarks, and all the functions obtain their optimum solutions after parameter tuning. Good result are also achieved when dealing with the optimization design of a Halbach permanent magnet motor, which indicates that the PSO with best parameter settings identified by the Taguchi method is more suitable to such actual engineering problem.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020560","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.6920334
S. Wibowo, S. Grandhi
This research work demonstrates a performance-based approach to evaluate the quality performance of group buying websites under uncertainty. Linguistic variables are assigned with values using triangular fuzzy numbers approach for effectively modeling the vagueness and imprecision of the decision making process. An effective algorithm grounded on the deviation degree and absolute area of a fuzzy number is developed for generating a general performance index for each alternative. This would help companies understand the performance quality level of their group buying websites. A group buying website quality performance evaluation example demonstrates how performance based approach can be used to assess the quality.
{"title":"A performance-based approach for assessing the quality of group buying websites","authors":"S. Wibowo, S. Grandhi","doi":"10.1109/ICIST.2014.6920334","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920334","url":null,"abstract":"This research work demonstrates a performance-based approach to evaluate the quality performance of group buying websites under uncertainty. Linguistic variables are assigned with values using triangular fuzzy numbers approach for effectively modeling the vagueness and imprecision of the decision making process. An effective algorithm grounded on the deviation degree and absolute area of a fuzzy number is developed for generating a general performance index for each alternative. This would help companies understand the performance quality level of their group buying websites. A group buying website quality performance evaluation example demonstrates how performance based approach can be used to assess the quality.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130120979","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.6920330
Jianzhao Zhang, Hang-sheng Zhao, Yongxiang Liu, Long Cao
Cognitive radio (CR) is a promising technology that enables opportunistic using of the unused spectrum to alleviate the spectrum scarcity problem. However, as the interference to licensed spectrum owners needs to be strictly controlled, CR enabled users (CRs) should vacate the using channel immediately on detecting licensed users activity and the end to end performance may be seriously degraded. In this paper, we propose a robust routing scheme for cognitive radio ad hoc networks that can accommodate to the spectrum availability variation and keep stable to guarantee the end to end performance of CRs. The path stability is modeled considering both available channel numbers and channel characteristic along the path. The paths beyond a robust threshold are regarded to be feasible and the one with maximal throughput is chosen for transmission. Simulation results show that the proposed scheme performs much better than other existing protocols in terms of route throughput and stability maintenance.
{"title":"Maximal throughput routing with stablility constraint in cognitive radio ad hoc networks","authors":"Jianzhao Zhang, Hang-sheng Zhao, Yongxiang Liu, Long Cao","doi":"10.1109/ICIST.2014.6920330","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920330","url":null,"abstract":"Cognitive radio (CR) is a promising technology that enables opportunistic using of the unused spectrum to alleviate the spectrum scarcity problem. However, as the interference to licensed spectrum owners needs to be strictly controlled, CR enabled users (CRs) should vacate the using channel immediately on detecting licensed users activity and the end to end performance may be seriously degraded. In this paper, we propose a robust routing scheme for cognitive radio ad hoc networks that can accommodate to the spectrum availability variation and keep stable to guarantee the end to end performance of CRs. The path stability is modeled considering both available channel numbers and channel characteristic along the path. The paths beyond a robust threshold are regarded to be feasible and the one with maximal throughput is chosen for transmission. Simulation results show that the proposed scheme performs much better than other existing protocols in terms of route throughput and stability maintenance.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124755323","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.6920352
L. Yin, Z. Bai, Renqing Yang
With the development and popularity of powerful video editing tools, it tends to be increasingly easier to create digital synthesized videos. A novel passive video inter-frame forgery detection method based on nonnegative tensor factorization (NTF) is presented in this work. It is based on the finding that inter-frame forgery will disturb the consistency of time-dimension factor. In this method, the video is factorized by using NTF first and then the time-dimension factor is extracted. By comparing the correlation between the elements of the factor, the video forgery can be detected. According to the experimental results, it shows that the proposed scheme is able to expose frame deletion and insertion forgery effectively.
{"title":"Video forgery detection based on nonnegative tensor factorization","authors":"L. Yin, Z. Bai, Renqing Yang","doi":"10.1109/ICIST.2014.6920352","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920352","url":null,"abstract":"With the development and popularity of powerful video editing tools, it tends to be increasingly easier to create digital synthesized videos. A novel passive video inter-frame forgery detection method based on nonnegative tensor factorization (NTF) is presented in this work. It is based on the finding that inter-frame forgery will disturb the consistency of time-dimension factor. In this method, the video is factorized by using NTF first and then the time-dimension factor is extracted. By comparing the correlation between the elements of the factor, the video forgery can be detected. According to the experimental results, it shows that the proposed scheme is able to expose frame deletion and insertion forgery effectively.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134344194","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 radio frequency identification (RFID) systems with dense mobile RFID readers, reader collision is one of the main issues of interest. The existing anti-collision method called neighbor-friendly reader anti-collision (NFRA) algorithm is simple and easy to make readers aware of neighbors for minimizing reader collision. However, the simple backoff mechanism impairs the utilization rate of mobile readers. To resolve the aforementioned shortage, this paper attempts to propose an enhanced neighbor-friendly reader anti-collision (ENFRA) algorithm. For the sake of comparison, a series of numerical experiments are arranged. The simulation results demonstrate that the proposed ENFRA algorithm is more efficient in obtaining the utilization rate of mobile readers than the canonical NFRA algorithm.
{"title":"An enhanced neighbor-friendly reader anti-collision algorithm in mobile RFID networks","authors":"Zhonghua Li, Hanpei Yang, Jianming Li, Chunhui He, Jieying Zhou","doi":"10.1109/ICIST.2014.6920374","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920374","url":null,"abstract":"In radio frequency identification (RFID) systems with dense mobile RFID readers, reader collision is one of the main issues of interest. The existing anti-collision method called neighbor-friendly reader anti-collision (NFRA) algorithm is simple and easy to make readers aware of neighbors for minimizing reader collision. However, the simple backoff mechanism impairs the utilization rate of mobile readers. To resolve the aforementioned shortage, this paper attempts to propose an enhanced neighbor-friendly reader anti-collision (ENFRA) algorithm. For the sake of comparison, a series of numerical experiments are arranged. The simulation results demonstrate that the proposed ENFRA algorithm is more efficient in obtaining the utilization rate of mobile readers than the canonical NFRA algorithm.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133730330","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.6920324
Jiazhi Dong, Yuwen Wang, Xiaofu Shang, Zhili Wang
In this paper, we briefly analyzed the advantages of passive distance measurement based on Wireless Fidelity (WiFi). Based on the analysis of the principle of traditional interferometer direction finding, we derived the equations which are suitable for indoor distance measurement. Through theoretical analysis and simulation, we prove the correctness of the equations. Finally, we analyze and conclude the conditions of using the method, the scope of distance measurement, and the main influencing parameters of system accuracy.
{"title":"Indoor passive ranging based on WiFi","authors":"Jiazhi Dong, Yuwen Wang, Xiaofu Shang, Zhili Wang","doi":"10.1109/ICIST.2014.6920324","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920324","url":null,"abstract":"In this paper, we briefly analyzed the advantages of passive distance measurement based on Wireless Fidelity (WiFi). Based on the analysis of the principle of traditional interferometer direction finding, we derived the equations which are suitable for indoor distance measurement. Through theoretical analysis and simulation, we prove the correctness of the equations. Finally, we analyze and conclude the conditions of using the method, the scope of distance measurement, and the main influencing parameters of system accuracy.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133825154","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
扫码关注我们
求助内容：
应助结果提醒方式：