Pub Date : 2013-12-01DOI: 10.1109/ICICS.2013.6782779
Xin Feng, B. Li, Yongxin Ge, Jiaxing Tan
The task of visual vocabulary construction plays an important role in the bag-of-words based pattern analysis and robotic applications. A discriminative vocabulary generation in unsupervised case is an open issue for reducing perceptual aliasing in image matching based applications. In this paper, we present a scheme to evaluate the discriminative power of each visual word quantitatively in terms of Mahalanobis separability, and a discriminative visual vocabulary is obtained through adaptively updating the poor discriminative visual words in an unsupervised manner. The effectiveness of our metric is demonstrated in the experiment of loop-closure detection under strong perceptual aliasing condition in both indoor and outdoor image sequences.
{"title":"A quantitative metric of visual-words separability for a more discriminative visual vocabulary in an unsupervised manner","authors":"Xin Feng, B. Li, Yongxin Ge, Jiaxing Tan","doi":"10.1109/ICICS.2013.6782779","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782779","url":null,"abstract":"The task of visual vocabulary construction plays an important role in the bag-of-words based pattern analysis and robotic applications. A discriminative vocabulary generation in unsupervised case is an open issue for reducing perceptual aliasing in image matching based applications. In this paper, we present a scheme to evaluate the discriminative power of each visual word quantitatively in terms of Mahalanobis separability, and a discriminative visual vocabulary is obtained through adaptively updating the poor discriminative visual words in an unsupervised manner. The effectiveness of our metric is demonstrated in the experiment of loop-closure detection under strong perceptual aliasing condition in both indoor and outdoor image sequences.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131133043","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-12-01DOI: 10.1109/ICICS.2013.6782916
K. Imamura, H. Kuroda, M. Fujimura
An efficient two-stage image search method for the extraction of illegal copies on the Internet has been proposed in our previous paper. In the present paper, we propose a criterial image preparation method for more efficient searching in the pre-search stage. It is possible to accelerate searching without omission because the criterial image preparation method provides a criterial image set for the various attacks involving changes to known pixel values. In addition, we propose an improved pre-search algorithm that includes the extraction of a GIF-compression-attacked image involving color number transformation. The performance of the improved pre-search method is evaluated through computer simulation.
{"title":"Criterial image preparation for a search method for digital watermarking image using correlation coefficient between pixel value histograms","authors":"K. Imamura, H. Kuroda, M. Fujimura","doi":"10.1109/ICICS.2013.6782916","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782916","url":null,"abstract":"An efficient two-stage image search method for the extraction of illegal copies on the Internet has been proposed in our previous paper. In the present paper, we propose a criterial image preparation method for more efficient searching in the pre-search stage. It is possible to accelerate searching without omission because the criterial image preparation method provides a criterial image set for the various attacks involving changes to known pixel values. In addition, we propose an improved pre-search algorithm that includes the extraction of a GIF-compression-attacked image involving color number transformation. The performance of the improved pre-search method is evaluated through computer simulation.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127657767","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-12-01DOI: 10.1109/ICICS.2013.6782812
Shi Yan, Yanyan Wei, Li Xu, Qinglin Zhao
This paper presents a state-space formulation of two-dimensional (2-D) frequency transformation for 2-D digital filters based on the Fornasini-Marchesini second (FM II) model. It will be shown that the FM II model can be interpreted as an equivalent model which has a similar form to the Roesser model. Then based on such a new equivalent model, the state-space formulation of the 2-D frequency transformation based on FM II model is derived by investigating the substantial input and output relations of the prototype filter, all-pass filters and the transformed filter such that the FM II model of the transformed filter can be directly obtained without using any realization approach. Moreover, it turns out that the resultant formulation owns a elegant and general expression so that it can be viewed as a natural extension of its counterpart in Roesser model. A non-trivial example is given to show the effectiveness of the proposed formulation.
{"title":"State-space formulation of 2-D frequency transformation base on Fornasini-Marchesini second model","authors":"Shi Yan, Yanyan Wei, Li Xu, Qinglin Zhao","doi":"10.1109/ICICS.2013.6782812","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782812","url":null,"abstract":"This paper presents a state-space formulation of two-dimensional (2-D) frequency transformation for 2-D digital filters based on the Fornasini-Marchesini second (FM II) model. It will be shown that the FM II model can be interpreted as an equivalent model which has a similar form to the Roesser model. Then based on such a new equivalent model, the state-space formulation of the 2-D frequency transformation based on FM II model is derived by investigating the substantial input and output relations of the prototype filter, all-pass filters and the transformed filter such that the FM II model of the transformed filter can be directly obtained without using any realization approach. Moreover, it turns out that the resultant formulation owns a elegant and general expression so that it can be viewed as a natural extension of its counterpart in Roesser model. A non-trivial example is given to show the effectiveness of the proposed formulation.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115328408","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-12-01DOI: 10.1109/ICICS.2013.6782896
Hieu Nguyen, Y. Guan, L. Tuan
In this paper, we propose a sub-optimal technique to solve problem of power allocation in cognitive radio (CR) OFDM-based system. This technique called full-filling based on windowing the CR user's signal and maximizing the power allocation at good sub-carrier positions of CR user. Thank to the interference reduction of windowing technique, the complexity of power allocation optimization problem with burden of computation can be reduced by using full-filling power allocation. The simulation results show that full-filling method outperforms the previous methods such as uniform allocation and interference inversion allocation. In the high tolerable interference range to primary user, full-filling method can achieve the optimal capacity performance.
{"title":"Full-filling algorithm for power allocation in OFDM-based cognitive radio systems","authors":"Hieu Nguyen, Y. Guan, L. Tuan","doi":"10.1109/ICICS.2013.6782896","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782896","url":null,"abstract":"In this paper, we propose a sub-optimal technique to solve problem of power allocation in cognitive radio (CR) OFDM-based system. This technique called full-filling based on windowing the CR user's signal and maximizing the power allocation at good sub-carrier positions of CR user. Thank to the interference reduction of windowing technique, the complexity of power allocation optimization problem with burden of computation can be reduced by using full-filling power allocation. The simulation results show that full-filling method outperforms the previous methods such as uniform allocation and interference inversion allocation. In the high tolerable interference range to primary user, full-filling method can achieve the optimal capacity performance.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124326687","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-12-01DOI: 10.1109/ICICS.2013.6782814
Dongye Zhang, Zhiping Lin, Achanna Anil Kumar, S. G. Razul, C. See
We propose a method on location estimation of stationary emitters using power measurements from a single antenna. The antenna completes the rotation of one cycle at different positions and from each position, the direction of arrivals (DOAs) of the emitters are estimated. The intersections of the lines of DOAs are then used to estimate the emitters' locations. For multiple emitters, we propose to use three antenna positions to overcome the problem of ambiguity. Simulation results show that the proposed method is effective to estimate the locations of emitters.
{"title":"Location estimation from a single mobile rotated antenna","authors":"Dongye Zhang, Zhiping Lin, Achanna Anil Kumar, S. G. Razul, C. See","doi":"10.1109/ICICS.2013.6782814","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782814","url":null,"abstract":"We propose a method on location estimation of stationary emitters using power measurements from a single antenna. The antenna completes the rotation of one cycle at different positions and from each position, the direction of arrivals (DOAs) of the emitters are estimated. The intersections of the lines of DOAs are then used to estimate the emitters' locations. For multiple emitters, we propose to use three antenna positions to overcome the problem of ambiguity. Simulation results show that the proposed method is effective to estimate the locations of emitters.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114791903","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-12-01DOI: 10.1109/ICICS.2013.6782873
Chun-Hsin Wu, Chia-Wei Li
Broadcasting is one of the most important operations for wireless ad hoc networks. A conventional broadcast method is to flood packets where each node rebroadcasts received packets. This approach is simple and reliable, but it suffers from the problems of network congestion, resource contention and signal collision. In this paper we propose new approaches to improve broadcast efficiency by stamping the information of visited nodes and their neighbor knowledge along the broadcasted packets. The live packet information is utilized intelligently to reduce broadcast redundancy in wireless ad hoc networks. Several stamping schemes are evaluated and the simulation results show that they can improve broadcast efficiency very significantly.
{"title":"Intelligent broadcast in wireless ad hoc networks using live packet information","authors":"Chun-Hsin Wu, Chia-Wei Li","doi":"10.1109/ICICS.2013.6782873","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782873","url":null,"abstract":"Broadcasting is one of the most important operations for wireless ad hoc networks. A conventional broadcast method is to flood packets where each node rebroadcasts received packets. This approach is simple and reliable, but it suffers from the problems of network congestion, resource contention and signal collision. In this paper we propose new approaches to improve broadcast efficiency by stamping the information of visited nodes and their neighbor knowledge along the broadcasted packets. The live packet information is utilized intelligently to reduce broadcast redundancy in wireless ad hoc networks. Several stamping schemes are evaluated and the simulation results show that they can improve broadcast efficiency very significantly.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115031276","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-12-01DOI: 10.1109/ICICS.2013.6782970
M. Lim, W. Goh
Driven by its renowned near-capacity performance over a wide spectrum of channels, the capitalization of quasi-cyclic low-density parity-check (QC-LDPC) codes is irrefutably the focal point of research and solution to virtually all communication systems of the next generation. Steered towards non-volatile memory (NVM) storage applications, we introduce a modernistic approach to LDPC decoding in this paper, known as the dual-shift stochastic-detection (DSSD). Weaving two novel ideas: dual-shift cyclic generation and stochastic-detection of local minima, our proposed DSSD decoder achieves throughput gains (~ 300%) by minimizing its overall computational delay and maximizing its operational frequency. Along with the amalgamation of our spearheading mirror-paradigm, the DSSD QC-LDPC decoder acquires yet another dimension of gain in throughput while relinquishing a cluster of its address generation counters, which elicits a wide expanse for its application.
{"title":"High-throughput dual-shift stochastic-detection quasi-cyclic LDPC decoder","authors":"M. Lim, W. Goh","doi":"10.1109/ICICS.2013.6782970","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782970","url":null,"abstract":"Driven by its renowned near-capacity performance over a wide spectrum of channels, the capitalization of quasi-cyclic low-density parity-check (QC-LDPC) codes is irrefutably the focal point of research and solution to virtually all communication systems of the next generation. Steered towards non-volatile memory (NVM) storage applications, we introduce a modernistic approach to LDPC decoding in this paper, known as the dual-shift stochastic-detection (DSSD). Weaving two novel ideas: dual-shift cyclic generation and stochastic-detection of local minima, our proposed DSSD decoder achieves throughput gains (~ 300%) by minimizing its overall computational delay and maximizing its operational frequency. Along with the amalgamation of our spearheading mirror-paradigm, the DSSD QC-LDPC decoder acquires yet another dimension of gain in throughput while relinquishing a cluster of its address generation counters, which elicits a wide expanse for its application.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117294326","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-12-01DOI: 10.1109/ICICS.2013.6782871
Ramtin Rabiee, K. H. Li
Cognitive radio (CR) has been proposed as a promising solution to overcome the spectrum scarcity problem. Many works have been reported to improve spectrum sensing performance of secondary users (SUs) as an essential step to design a CR network (CRN). Spectrum sensing optimization is able to improve spectral efficiency and protect a primary user (PU) from interference. Among different detection techniques, energy detection (ED) has been investigated widely as it is an efficient detection method, especially in the case of a CRN, in which SUs have no prior information of the primary signal most of the time. Transmission throughput of a secondary network is one of the performance criteria in a CRN. In this paper, we analyze the throughput performance of different ED schemes such as improved ED (IED) and double-threshold based IED, with several detection constraints, in both cases of perfect and imperfect reporting channels. The double-threshold based IED scheme is found to achieve the highest achievable throughput over imperfect reporting channels as compared with other ED methods.
{"title":"Throughput optimization of double-threshold based improved energy detection in cooperative sensing over imperfect reporting channels","authors":"Ramtin Rabiee, K. H. Li","doi":"10.1109/ICICS.2013.6782871","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782871","url":null,"abstract":"Cognitive radio (CR) has been proposed as a promising solution to overcome the spectrum scarcity problem. Many works have been reported to improve spectrum sensing performance of secondary users (SUs) as an essential step to design a CR network (CRN). Spectrum sensing optimization is able to improve spectral efficiency and protect a primary user (PU) from interference. Among different detection techniques, energy detection (ED) has been investigated widely as it is an efficient detection method, especially in the case of a CRN, in which SUs have no prior information of the primary signal most of the time. Transmission throughput of a secondary network is one of the performance criteria in a CRN. In this paper, we analyze the throughput performance of different ED schemes such as improved ED (IED) and double-threshold based IED, with several detection constraints, in both cases of perfect and imperfect reporting channels. The double-threshold based IED scheme is found to achieve the highest achievable throughput over imperfect reporting channels as compared with other ED methods.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121966127","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-12-01DOI: 10.1109/ICICS.2013.6782855
Xiaoying Hong, Ruijie Zhao, Xiaoping Lai
Conventional algorithms for constrained least-squares (CLS) designs of two-dimensional (2-D) FIR filters vectorize the filters' impulse response coefficients. Recently, an efficient algorithm exploiting the matrix nature of the impulse response is proposed for the CLS design of quadrantally symmetric 2-D linear-phase FIR filters. This paper extends the matrix-based algorithm to the CLS design of 2-D nonlinear-phase FIR filters with low group delay. A design example is presented to illustrate the effectiveness and efficiency of the proposed algorithm.
{"title":"A matrix-based algorithm for constrained least-squares design of two-dimensional FIR filters with low group delay","authors":"Xiaoying Hong, Ruijie Zhao, Xiaoping Lai","doi":"10.1109/ICICS.2013.6782855","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782855","url":null,"abstract":"Conventional algorithms for constrained least-squares (CLS) designs of two-dimensional (2-D) FIR filters vectorize the filters' impulse response coefficients. Recently, an efficient algorithm exploiting the matrix nature of the impulse response is proposed for the CLS design of quadrantally symmetric 2-D linear-phase FIR filters. This paper extends the matrix-based algorithm to the CLS design of 2-D nonlinear-phase FIR filters with low group delay. A design example is presented to illustrate the effectiveness and efficiency of the proposed algorithm.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127440981","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-12-01DOI: 10.1109/ICICS.2013.6782875
Xinhuai Wang, Xinyong Dong, Yan Zhou, K. Ni, Jia Cheng, Zhemin Chen
A novel hot-wire anemometer based on a silver-coated optical fiber Bragg grating (FBG) is proposed and experimentally demonstrated with the assistance of a short length of no-core fiber (NCF). Experimental results reveal that highest resolution of ~0.0017 m/s is achieved and the measurement range covers 0-13.7 m/s.
{"title":"Fiber optic anemometer based on metal-coated fiber Bragg grating","authors":"Xinhuai Wang, Xinyong Dong, Yan Zhou, K. Ni, Jia Cheng, Zhemin Chen","doi":"10.1109/ICICS.2013.6782875","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782875","url":null,"abstract":"A novel hot-wire anemometer based on a silver-coated optical fiber Bragg grating (FBG) is proposed and experimentally demonstrated with the assistance of a short length of no-core fiber (NCF). Experimental results reveal that highest resolution of ~0.0017 m/s is achieved and the measurement range covers 0-13.7 m/s.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127048933","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
扫码关注我们
求助内容：
应助结果提醒方式：