Pub Date : 2009-10-23DOI: 10.1109/PACRIM.2009.5291308
A. Ikhlef, J. Louveaux
In multiple-input multiple-output (MIMO) filter bank multicarrier modulation (FBMC) systems, the frequency selective transmission channel causes intersymbol interference (ISI), and intercarrier interference (ICI), and using multiple antennas creates interantenna interference (IAI). To mitigate these distortions we derive an MMSE equalizer which takes into account all of them. Assuming spatial multiplexing is used, we propose a successive interference cancellation (SIC) and Ordered SIC (OSIC) techniques to extract the transmitted streams. In order to further improve the performance we also introduce a two stage OSIC (TSOSIC) technique. Simulation results confirm the effectiveness of the proposed techniques over the classical one tap equalizer.
{"title":"Per subchannel equalization for MIMO FBMC/OQAM systems","authors":"A. Ikhlef, J. Louveaux","doi":"10.1109/PACRIM.2009.5291308","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291308","url":null,"abstract":"In multiple-input multiple-output (MIMO) filter bank multicarrier modulation (FBMC) systems, the frequency selective transmission channel causes intersymbol interference (ISI), and intercarrier interference (ICI), and using multiple antennas creates interantenna interference (IAI). To mitigate these distortions we derive an MMSE equalizer which takes into account all of them. Assuming spatial multiplexing is used, we propose a successive interference cancellation (SIC) and Ordered SIC (OSIC) techniques to extract the transmitted streams. In order to further improve the performance we also introduce a two stage OSIC (TSOSIC) technique. Simulation results confirm the effectiveness of the proposed techniques over the classical one tap equalizer.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132745294","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291268
S. Gillan, P. Agathoklis, M. S. Yasein
A new features based algorithm for face recognition is proposed. The algorithm is based on locating features on faces and finding the correspondence of these features between faces using an algorithm which is adopted from [16] [17]. The algorithm is using feature extraction through filtering with Mexican-hat wavelets and detection of correspondence of the feature points through comparison of Zernike moments. The transformation of the feature points between images is obtained using an iterative weighted least-squares algorithm which allows to eliminate outliers. The face recognition is based on the residual error between the feature points after transformation. The performance of the proposed method is evaluated using experiments with a face database and compared against existing techniques for face recognition. The results of experiments with varying pose and illumination conditions show that the proposed method performs well compared to existing feature based face recognition techniques.
{"title":"A feature based technique for face recognition using Mexican hat wavelets","authors":"S. Gillan, P. Agathoklis, M. S. Yasein","doi":"10.1109/PACRIM.2009.5291268","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291268","url":null,"abstract":"A new features based algorithm for face recognition is proposed. The algorithm is based on locating features on faces and finding the correspondence of these features between faces using an algorithm which is adopted from [16] [17]. The algorithm is using feature extraction through filtering with Mexican-hat wavelets and detection of correspondence of the feature points through comparison of Zernike moments. The transformation of the feature points between images is obtained using an iterative weighted least-squares algorithm which allows to eliminate outliers. The face recognition is based on the residual error between the feature points after transformation. The performance of the proposed method is evaluated using experiments with a face database and compared against existing techniques for face recognition. The results of experiments with varying pose and illumination conditions show that the proposed method performs well compared to existing feature based face recognition techniques.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129609828","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291406
Miyahara Hideo
First, I would like to look back over the past five decades, during which we have witnessed dramatic technological changes in information and communication technologies (ICT). I want then to share with you my thoughts on what role ICT should be playing in our society over the next 50 years. Then, from the view point of ICT, I will discuss several challenges we will face in developing a new generation network (NWGN), which is envisioned as a post IP network. In pursuing the NWGN program, I have come to believe that we need collaborative research with specialists from various fields. I will introduce, as an example, our interdisciplinary research project currently being pursued by NICT and Osaka University.
{"title":"Challenges for a new generation network","authors":"Miyahara Hideo","doi":"10.1109/PACRIM.2009.5291406","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291406","url":null,"abstract":"First, I would like to look back over the past five decades, during which we have witnessed dramatic technological changes in information and communication technologies (ICT). I want then to share with you my thoughts on what role ICT should be playing in our society over the next 50 years. Then, from the view point of ICT, I will discuss several challenges we will face in developing a new generation network (NWGN), which is envisioned as a post IP network. In pursuing the NWGN program, I have come to believe that we need collaborative research with specialists from various fields. I will introduce, as an example, our interdisciplinary research project currently being pursued by NICT and Osaka University.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133125233","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291379
Angela Irwin, R. Hunt
Conventional security mechanisms providing confidentiality, integrity and authentication are facing new challenges in modern wired and wireless networks. Deniable encryption allows encrypted data to be decrypted to different sensible plaintexts, depending on the key used or otherwise makes it impossible to prove the existence of the real message without the proper encryption key. This allows the sender to have plausible deniability if compelled to give up their encryption key. Deniable file systems allow for the creation of an encrypted volume on a hard disk and a second, hidden deniable file system created inside with access by a second password. The objective of this research is to establish whether or not evidence of a hidden volume can be found in deniable encryption tools using conventional forensic analysis. A testbed is developed using open source deniable encryption software and forensics tools with the objective of proving or disproving this claim.
{"title":"Forensic methods for detection of deniable encryption in mobile networks","authors":"Angela Irwin, R. Hunt","doi":"10.1109/PACRIM.2009.5291379","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291379","url":null,"abstract":"Conventional security mechanisms providing confidentiality, integrity and authentication are facing new challenges in modern wired and wireless networks. Deniable encryption allows encrypted data to be decrypted to different sensible plaintexts, depending on the key used or otherwise makes it impossible to prove the existence of the real message without the proper encryption key. This allows the sender to have plausible deniability if compelled to give up their encryption key. Deniable file systems allow for the creation of an encrypted volume on a hard disk and a second, hidden deniable file system created inside with access by a second password. The objective of this research is to establish whether or not evidence of a hidden volume can be found in deniable encryption tools using conventional forensic analysis. A testbed is developed using open source deniable encryption software and forensics tools with the objective of proving or disproving this claim.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133147691","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291344
Hassan El Maia, A. Hammouch, D. Aboutajdine
In this paper, we propose a new approach for the construction of a hybrid color-texture space by using mutual information. Feature extraction is done by the co-occurrence matrix with SVM (Support Vectors Machine) as a classifier. We apply our approach to the VisTex database and to the classification of a SPOT HRV (XS) image representing two forest areas in the region of Rabat in Morocco. We compare the result of classification obtained in this hybrid space with the one in the RGB color space.
{"title":"Color-texture analysis by mutual information for multispectral image classification","authors":"Hassan El Maia, A. Hammouch, D. Aboutajdine","doi":"10.1109/PACRIM.2009.5291344","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291344","url":null,"abstract":"In this paper, we propose a new approach for the construction of a hybrid color-texture space by using mutual information. Feature extraction is done by the co-occurrence matrix with SVM (Support Vectors Machine) as a classifier. We apply our approach to the VisTex database and to the classification of a SPOT HRV (XS) image representing two forest areas in the region of Rabat in Morocco. We compare the result of classification obtained in this hybrid space with the one in the RGB color space.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130023584","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291390
J. Rice
Classification of Boolean functions is a known problem in digital logic. There are far too many possible Boolean functions to examine each one, and so we attempt to classify similar functions together into groups, or classes. This paper continues work that uses the autocorrelation transform to determine a classification technique. Some new considerations are raised and additional analysis of the autocorrelation classes is presented.
{"title":"The autocorrelation transform and its application to the classification of Boolean functions","authors":"J. Rice","doi":"10.1109/PACRIM.2009.5291390","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291390","url":null,"abstract":"Classification of Boolean functions is a known problem in digital logic. There are far too many possible Boolean functions to examine each one, and so we attempt to classify similar functions together into groups, or classes. This paper continues work that uses the autocorrelation transform to determine a classification technique. Some new considerations are raised and additional analysis of the autocorrelation classes is presented.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130186207","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291283
Hao Zhang, A. Gulliver
In this paper, we propose a cross layer approach to wireless image transmission over fading channels. We first extract the key information from the image and transmit this information only when the channel is good to ensure that most errors occur in the less important image information. The relationship between the channel SNR and Peak SNR (PSNR) of the received image is examined. Performance results are given which show that the proposed approach can significantly improve transmitted image quality. For example, with SNR = 5dB and BPSK modulation in a Rayleigh flat fading channel, the PSNR of the received image with the proposed approach has a gain of 7dB over the previous solution.
{"title":"A channel selective approach to wireless image transmission over fading channels","authors":"Hao Zhang, A. Gulliver","doi":"10.1109/PACRIM.2009.5291283","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291283","url":null,"abstract":"In this paper, we propose a cross layer approach to wireless image transmission over fading channels. We first extract the key information from the image and transmit this information only when the channel is good to ensure that most errors occur in the less important image information. The relationship between the channel SNR and Peak SNR (PSNR) of the received image is examined. Performance results are given which show that the proposed approach can significantly improve transmitted image quality. For example, with SNR = 5dB and BPSK modulation in a Rayleigh flat fading channel, the PSNR of the received image with the proposed approach has a gain of 7dB over the previous solution.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114895913","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291235
A. A. Morgan, H. Elmiligi, M. El-Kharashi, F. Gebali
One of the challenging problems in Application-Specific Networks-on-Chip (ASNoC) design is customizing the topological structure of the on-chip network in order to meet the application requirements with the minimum possible cost. In this paper, the area cost of ASNoCs is reduced by using network partitioning techniques. Given the application core graph, the partitioning problem is formulated as an optimization one. Partitioning results in increasing the average delay, which is compensated for by adjusting the network bandwidth. A methodology is proposed for an area-aware custom topology generation employing network partitioning. As a proof of concept, our methodology is applied to three different applications with different number of cores. Results show that the proposed methodology is a promising way to reduce the ASNoC area compared to other standard and custom topology generation techniques.
{"title":"Area-aware topology generation for Application-Specific Networks-on-Chip using network partitioning","authors":"A. A. Morgan, H. Elmiligi, M. El-Kharashi, F. Gebali","doi":"10.1109/PACRIM.2009.5291235","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291235","url":null,"abstract":"One of the challenging problems in Application-Specific Networks-on-Chip (ASNoC) design is customizing the topological structure of the on-chip network in order to meet the application requirements with the minimum possible cost. In this paper, the area cost of ASNoCs is reduced by using network partitioning techniques. Given the application core graph, the partitioning problem is formulated as an optimization one. Partitioning results in increasing the average delay, which is compensated for by adjusting the network bandwidth. A methodology is proposed for an area-aware custom topology generation employing network partitioning. As a proof of concept, our methodology is applied to three different applications with different number of cores. Results show that the proposed methodology is a promising way to reduce the ASNoC area compared to other standard and custom topology generation techniques.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114956168","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291252
P. Sommen, K. Janse
Advances in hardware technology pave the way to small, low power wireless sensor devices, such as wireless microphones. This makes it possible to use a large number, i.e. thousands, of microphones at positions where it is not feasible to put wired microphones, creating an enormous potential for improved flexibility and performance within a trans-parent acoustic communication context. In order to reduce battery consumption, each of the wireless microphones has to be sampled much below the Nyquist sample rate. In this paper we will discuss some preliminary results and open research issues that are involved in such an Undersampled Wireless Acoustic Sensor (UWAS) network scenario.
{"title":"The undersampled wireless acoustic sensor network scenario: Some preliminary results and open research issues","authors":"P. Sommen, K. Janse","doi":"10.1109/PACRIM.2009.5291252","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291252","url":null,"abstract":"Advances in hardware technology pave the way to small, low power wireless sensor devices, such as wireless microphones. This makes it possible to use a large number, i.e. thousands, of microphones at positions where it is not feasible to put wired microphones, creating an enormous potential for improved flexibility and performance within a trans-parent acoustic communication context. In order to reduce battery consumption, each of the wireless microphones has to be sampled much below the Nyquist sample rate. In this paper we will discuss some preliminary results and open research issues that are involved in such an Undersampled Wireless Acoustic Sensor (UWAS) network scenario.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121848118","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291387
Akifumi Katsumata, T. Miura
In this investigation, we propose an algorithm for Spatial Approximate String Matching where k times of mismatch are allowed. There have been several algorithms proposed so far, but most of them examine the longest text strings, i.e., the longest one dimensional sequence of characters. In this approach, we examine spatial text strings, i.e., three dimensional space of characters by means of DP (dynamic programming) algorithm and discuss the efficiency.
{"title":"Spatial Approximate String Matching","authors":"Akifumi Katsumata, T. Miura","doi":"10.1109/PACRIM.2009.5291387","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291387","url":null,"abstract":"In this investigation, we propose an algorithm for Spatial Approximate String Matching where k times of mismatch are allowed. There have been several algorithms proposed so far, but most of them examine the longest text strings, i.e., the longest one dimensional sequence of characters. In this approach, we examine spatial text strings, i.e., three dimensional space of characters by means of DP (dynamic programming) algorithm and discuss the efficiency.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130100445","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
扫码关注我们
求助内容：
应助结果提醒方式：