Pub Date : 2013-12-01DOI: 10.1109/ICICS.2013.6782841
Beng Soon Tan, K. C. Teh, K. H. Li
In slow frequency hopping systems, it is critical to detect, classify, and mitigate interference, as it degrades the system performance. Generalized likelihood ratio test algorithm was proposed for the detection of interference. However, it could not classify the type of interference. In this paper, we propose algorithms to classify between follower/stationary interference and multitone interference/partial-band noise interference. Classification of interference in various types of modulation schemes is performed based on a ratio-testing approach, where the ratio is compared with a predetermined threshold value. It is critical to set the threshold at an optimal value in order to achieve a good classification performance. The optimal value and classification performance are obtained through simulation results.
{"title":"Classification of follower/stationary interference and multitone interference/partial-band interference in slow frequency-hopping systems","authors":"Beng Soon Tan, K. C. Teh, K. H. Li","doi":"10.1109/ICICS.2013.6782841","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782841","url":null,"abstract":"In slow frequency hopping systems, it is critical to detect, classify, and mitigate interference, as it degrades the system performance. Generalized likelihood ratio test algorithm was proposed for the detection of interference. However, it could not classify the type of interference. In this paper, we propose algorithms to classify between follower/stationary interference and multitone interference/partial-band noise interference. Classification of interference in various types of modulation schemes is performed based on a ratio-testing approach, where the ratio is compared with a predetermined threshold value. It is critical to set the threshold at an optimal value in order to achieve a good classification performance. The optimal value and classification performance are obtained through simulation results.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"253 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":"122769667","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.6782928
Xiaojun Yu, Gaoxi Xiao, T. Cheng
With the rising popularity of multicasting services in meshed wavelength division multiplexing (WDM) networks, protecting dynamic sub-wavelength granularity multicast requests against network failures becomes an important issue in network operation process. This paper investigates survivable dynamic multicast traffic grooming problem in WDM networks, and a connection-level segment shared protection (CL-SSP) algorithm is proposed to protect multicast requests against single link failure in dynamic traffic grooming process. Specifically, to improve network resource sharing in traffic grooming process, a lightpath-fragmentation (LPF) method is adopted to fragment primary/backup lightpaths into segments upon setup in the physical layer routing process. Extensive numerical simulations are carried out to study the blocking performance of CL-SSP scheme in different cases. Influences of LPF method on CL-SSP blocking performance are also evaluated.
{"title":"Connection level segment shared protection for dynamic multicast traffic grooming","authors":"Xiaojun Yu, Gaoxi Xiao, T. Cheng","doi":"10.1109/ICICS.2013.6782928","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782928","url":null,"abstract":"With the rising popularity of multicasting services in meshed wavelength division multiplexing (WDM) networks, protecting dynamic sub-wavelength granularity multicast requests against network failures becomes an important issue in network operation process. This paper investigates survivable dynamic multicast traffic grooming problem in WDM networks, and a connection-level segment shared protection (CL-SSP) algorithm is proposed to protect multicast requests against single link failure in dynamic traffic grooming process. Specifically, to improve network resource sharing in traffic grooming process, a lightpath-fragmentation (LPF) method is adopted to fragment primary/backup lightpaths into segments upon setup in the physical layer routing process. Extensive numerical simulations are carried out to study the blocking performance of CL-SSP scheme in different cases. Influences of LPF method on CL-SSP blocking performance are also evaluated.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"56 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":"126373253","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.6782933
Gan Huang, P. Xiao, Li Hu, Y. Hung, Zhiguo Zhang
Single-trial detection of evoked brain potentials is essential for many research topics in neural engineering and neuroscience. In present study, a novel approach, which combines common spatial pattern (CSP) and multiple linear regression (MLR), is proposed to for single-trial detection of pain-related laser-evoked potentials (LEPs). The CSP method is effective in separating laser-evoked EEG response from ongoing EEG activity, while MLR makes an automatic and reliable estimation of the amplitudes and latencies of N2 and P2 from single-trial LEP waveforms. The MLR coefficients are further used for the prediction of pain perception, which is of great importance for both basic and clinical applications. The prediction is performed with both binary (classification of low pain and high pain) and continuous (regression on a continuous scale from 0 to 10) outcomes. The results show that the proposed methods could provide reliable performance at both with- and cross-individual levels.
{"title":"A new approach for single-trial detection of laser-evoked potentials and its application to pain prediction","authors":"Gan Huang, P. Xiao, Li Hu, Y. Hung, Zhiguo Zhang","doi":"10.1109/ICICS.2013.6782933","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782933","url":null,"abstract":"Single-trial detection of evoked brain potentials is essential for many research topics in neural engineering and neuroscience. In present study, a novel approach, which combines common spatial pattern (CSP) and multiple linear regression (MLR), is proposed to for single-trial detection of pain-related laser-evoked potentials (LEPs). The CSP method is effective in separating laser-evoked EEG response from ongoing EEG activity, while MLR makes an automatic and reliable estimation of the amplitudes and latencies of N2 and P2 from single-trial LEP waveforms. The MLR coefficients are further used for the prediction of pain perception, which is of great importance for both basic and clinical applications. The prediction is performed with both binary (classification of low pain and high pain) and continuous (regression on a continuous scale from 0 to 10) outcomes. The results show that the proposed methods could provide reliable performance at both with- and cross-individual levels.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"767 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":"126946675","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}
Although JPEG2000 is powerful for image compression, since it requires a large buffer size, it is not as popular as JPEG. In industry, less buffer size requirement is an important issue in image compression because in many embedded systems and mobile devices, such as cell phones, TV, and digital cameras, the buffer sizes are usually very small. A large buffer size means large space requirement and high hardware cost. In this paper, a new compression method that is the hybrid of the discrete cosine transform and the discrete wavelet transform is proposed. The proposed algorithm combines the advantages of JPEG and JPEG2000 and adopts predictive coding techniques. Its buffer size requirement is the same as that of JPEG but the compression ability is much higher.
{"title":"Less buffer sized efficienct compression algorithm based on column DCTs, Row DWTs, and predictive coding","authors":"Ying-Wun Huang, Guan-Chen Pan, Jian-Jiun Ding, Hsin-Hui Chen","doi":"10.1109/ICICS.2013.6782942","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782942","url":null,"abstract":"Although JPEG2000 is powerful for image compression, since it requires a large buffer size, it is not as popular as JPEG. In industry, less buffer size requirement is an important issue in image compression because in many embedded systems and mobile devices, such as cell phones, TV, and digital cameras, the buffer sizes are usually very small. A large buffer size means large space requirement and high hardware cost. In this paper, a new compression method that is the hybrid of the discrete cosine transform and the discrete wavelet transform is proposed. The proposed algorithm combines the advantages of JPEG and JPEG2000 and adopts predictive coding techniques. Its buffer size requirement is the same as that of JPEG but the compression ability is much higher.","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":"127271705","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.6782924
T. Chan, M. A. Tebbi, C. Sung
Extending Delsarte's linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.
{"title":"Linear programming bounds for storage codes","authors":"T. Chan, M. A. Tebbi, C. Sung","doi":"10.1109/ICICS.2013.6782924","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782924","url":null,"abstract":"Extending Delsarte's linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"34 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":"130441300","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.6782926
Xuan Luo, Pengfei Zhang, Tong Ye, Yaohui Jin, Jianping Wang
Among all SLAs(Service Level Agreements) about network resources in the cloud, a critical problem would be achieving bandwidth guarantee under all communication environment (e.g., when misbehaved VMs exist) while keeping acceptable bandwidth utility and system scalability. In this paper, we present an architecture of dynamic bandwidth allocation and guarantee on resource fairness, to provide network performance isolation and protocol independent bandwidth guarantees. In this paper, we first discuss the business model of bandwidth guarantee for Infrastructure-as-a-Service (IaaS) cloud, and a bandwidth allocation algorithm based on redefined fairness model is proposed and realized under the novel architecture, and finally experiment shows satisfying results under various communication scenarios.
{"title":"Dynamic bandwidth allocation& guarantee for virtualized networks in cloud","authors":"Xuan Luo, Pengfei Zhang, Tong Ye, Yaohui Jin, Jianping Wang","doi":"10.1109/ICICS.2013.6782926","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782926","url":null,"abstract":"Among all SLAs(Service Level Agreements) about network resources in the cloud, a critical problem would be achieving bandwidth guarantee under all communication environment (e.g., when misbehaved VMs exist) while keeping acceptable bandwidth utility and system scalability. In this paper, we present an architecture of dynamic bandwidth allocation and guarantee on resource fairness, to provide network performance isolation and protocol independent bandwidth guarantees. In this paper, we first discuss the business model of bandwidth guarantee for Infrastructure-as-a-Service (IaaS) cloud, and a bandwidth allocation algorithm based on redefined fairness model is proposed and realized under the novel architecture, and finally experiment shows satisfying results under various communication scenarios.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"15 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":"133581612","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.6782786
S. A. Jayasuriya, Alan Wee-Chung Liew
In this paper, we present a novel modified Fuzzy C-means algorithm with symmetry information to reduce the effect of noise in brain tissue segmentation in magnetic resonance image (MRI). We integrate brain's bilateral symmetry into the conventional Fuzzy C-means (FCM) as an additional term. In experiments, some synthetic images, and both simulated and real brain images were used to investigate the robustness of the method against noise. Finally, the method was compared with the conventional FCM algorithm. Results show the viability of the approach and the preliminary investigation appears promising.
{"title":"A modified Fuzzy C-means algorithm with symmetry information for MR brain image segmentation","authors":"S. A. Jayasuriya, Alan Wee-Chung Liew","doi":"10.1109/ICICS.2013.6782786","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782786","url":null,"abstract":"In this paper, we present a novel modified Fuzzy C-means algorithm with symmetry information to reduce the effect of noise in brain tissue segmentation in magnetic resonance image (MRI). We integrate brain's bilateral symmetry into the conventional Fuzzy C-means (FCM) as an additional term. In experiments, some synthetic images, and both simulated and real brain images were used to investigate the robustness of the method against noise. Finally, the method was compared with the conventional FCM algorithm. Results show the viability of the approach and the preliminary investigation appears promising.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"29 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":"134044270","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.6782849
J. Matsumoto, W. Zhong
A real-time imbalance between demand and supply by consumers' unforeseen activity or wide penetration of renewable energy resources in the near future would considerably affect the power quality. Demand Response (DR) management in smart grid is imperative, as it can effectively shape the total load from the demand-side. This paper presents a new DR architecture by indirectly controlling smart devices in each home. The proposed architecture offers the advantages of less communication data, scalability, and being user friendly. The simulation results show that the proposed DR architecture is very effective in stabilization of power quality by reducing the change rate of total load.
{"title":"New demand response architecture for stabilization of power quality in smart grid","authors":"J. Matsumoto, W. Zhong","doi":"10.1109/ICICS.2013.6782849","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782849","url":null,"abstract":"A real-time imbalance between demand and supply by consumers' unforeseen activity or wide penetration of renewable energy resources in the near future would considerably affect the power quality. Demand Response (DR) management in smart grid is imperative, as it can effectively shape the total load from the demand-side. This paper presents a new DR architecture by indirectly controlling smart devices in each home. The proposed architecture offers the advantages of less communication data, scalability, and being user friendly. The simulation results show that the proposed DR architecture is very effective in stabilization of power quality by reducing the change rate of total load.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"221 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":"132583526","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.6782906
Jing Chen, Yang Hong, Zixiong Wang, Changyuan Yu
Multiple input multiple output (MIMO) technology appears attractive for indoor visible light communication (VLC) systems as multiple light-emitting diodes (LED) sources are typically deployed for indoor environment. Most of current indoor MIMO VLC systems utilize single user terminal scenario to investigate the performance of the system. However, typical arrangement of a practical indoor environment is comprised of multiple user terminals, which makes it complicated for signal processing. However, reduction of the complexity of a mobile terminal is advantageous to its signal processing capability and battery life extension. This paper investigated the precoded multi-user (MU) MIMO indoor VLC system. Since the main difficulty of MU-MIMO VLC system is to distinguish the received data for decentralized user terminals, precoding method is introduced to eliminate multi-user interference (MUI) in the transmitter of a VLC system, which leads to the reduction of complexity and power consumption of user terminals. Based on a 4 × {2, 2} indoor VLC system at 100 Mbit/s, the proposed system can perform well through numerical simulations.
{"title":"Precoded visible light communications","authors":"Jing Chen, Yang Hong, Zixiong Wang, Changyuan Yu","doi":"10.1109/ICICS.2013.6782906","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782906","url":null,"abstract":"Multiple input multiple output (MIMO) technology appears attractive for indoor visible light communication (VLC) systems as multiple light-emitting diodes (LED) sources are typically deployed for indoor environment. Most of current indoor MIMO VLC systems utilize single user terminal scenario to investigate the performance of the system. However, typical arrangement of a practical indoor environment is comprised of multiple user terminals, which makes it complicated for signal processing. However, reduction of the complexity of a mobile terminal is advantageous to its signal processing capability and battery life extension. This paper investigated the precoded multi-user (MU) MIMO indoor VLC system. Since the main difficulty of MU-MIMO VLC system is to distinguish the received data for decentralized user terminals, precoding method is introduced to eliminate multi-user interference (MUI) in the transmitter of a VLC system, which leads to the reduction of complexity and power consumption of user terminals. Based on a 4 × {2, 2} indoor VLC system at 100 Mbit/s, the proposed system can perform well through numerical simulations.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"19 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":"132697321","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.6782960
Chia-Chen Li, Pei-Chen Wu, C. Lin
Pedestrian detection is an important research field in advanced driver assistance system (ADAS). This paper puts forward a pedestrian detection framework based on both heuristic statistics and machine learning. First, a restriction of region of interest (ROI) is set on the captured image. Second, the template matching coarsely detects candidate pedestrians by using a set of template images, the edge image of the current frame, and the difference image from previous and current frames. Next, the histogram analysis again roughly filters out the candidate pedestrians. Finally, Histogram of Oriented Gradients (HOG) combined with library support vector machine (LIBSVM) is used to verify those candidate pedestrians. The experimental results show that the proposed method can run in real-time, where the false negative rate is 1.43%, and the false positive rate is 0.16%.
{"title":"Pedestrian detection using heuristic statistics and machine learning","authors":"Chia-Chen Li, Pei-Chen Wu, C. Lin","doi":"10.1109/ICICS.2013.6782960","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782960","url":null,"abstract":"Pedestrian detection is an important research field in advanced driver assistance system (ADAS). This paper puts forward a pedestrian detection framework based on both heuristic statistics and machine learning. First, a restriction of region of interest (ROI) is set on the captured image. Second, the template matching coarsely detects candidate pedestrians by using a set of template images, the edge image of the current frame, and the difference image from previous and current frames. Next, the histogram analysis again roughly filters out the candidate pedestrians. Finally, Histogram of Oriented Gradients (HOG) combined with library support vector machine (LIBSVM) is used to verify those candidate pedestrians. The experimental results show that the proposed method can run in real-time, where the false negative rate is 1.43%, and the false positive rate is 0.16%.","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":"132918733","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}