Pub Date : 2013-12-01DOI: 10.1109/ICICS.2013.6782891
H. H. Dam, Dedi Rimantho, S. Nordholm
This paper extends the design of frequency invariant beamformer by incorporating robustness in the design formulation to cater for array element mismatches and other non-ideal characteristics. In this approach, a 2-norm constraint on the filter weight is imposed into the design optimization problem. The constraints limit the norm of the beamformer coefficients and thus reduce the sensitivity of the beamformer towards the non-ideal characteristics of the microphones. Design examples and comparisons are presented to illustrate the effectiveness of our approach.
{"title":"Frequency invariant beamformer robust against array element mismatch","authors":"H. H. Dam, Dedi Rimantho, S. Nordholm","doi":"10.1109/ICICS.2013.6782891","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782891","url":null,"abstract":"This paper extends the design of frequency invariant beamformer by incorporating robustness in the design formulation to cater for array element mismatches and other non-ideal characteristics. In this approach, a 2-norm constraint on the filter weight is imposed into the design optimization problem. The constraints limit the norm of the beamformer coefficients and thus reduce the sensitivity of the beamformer towards the non-ideal characteristics of the microphones. Design examples and comparisons are presented to illustrate the effectiveness of our approach.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"1 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":"130672525","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.6782941
S. Xie, S. Rahardja
This paper presents a novel balanced-compound regularization approach for solving the frame-based image deblurring. The proposed balanced-compound regularization employs two different frames as synthesis and analysis operators, and it is formulated as a minimization problem involving an ℓ2 data-fidelity term, an ℓ1 regularizer on sparsity of synthesis frame coefficients, an ℓ1 regularizer on sparsity of analysis frame operator, and a penalty on distance of sparse synthesis frame coefficients to the range of the frame operator. Thus the proposed regularization consists of a synthesis-analysis compound regularizer and a balanced regularizer. Then the balanced-compound optimal problem is solved based on a variable splitting strategy and the classical alternating direction method of multiplier (ADMM). Numerical simulations show that the proposed balanced-compound approach can achieve less coefficient estimated error than the hybrid synthesis-analysis approach under comparable qualities in image deblurring problem. This improvement is due to the added balanced term. Moreover, by exploiting the related fast tight Parseval frames and the special structure of the observation matrix, the regularized Hessian matrix can perform efficiently for the frame-based image deblurring.
{"title":"Frame-based image deblurring with balanced-compound regularization","authors":"S. Xie, S. Rahardja","doi":"10.1109/ICICS.2013.6782941","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782941","url":null,"abstract":"This paper presents a novel balanced-compound regularization approach for solving the frame-based image deblurring. The proposed balanced-compound regularization employs two different frames as synthesis and analysis operators, and it is formulated as a minimization problem involving an ℓ2 data-fidelity term, an ℓ1 regularizer on sparsity of synthesis frame coefficients, an ℓ1 regularizer on sparsity of analysis frame operator, and a penalty on distance of sparse synthesis frame coefficients to the range of the frame operator. Thus the proposed regularization consists of a synthesis-analysis compound regularizer and a balanced regularizer. Then the balanced-compound optimal problem is solved based on a variable splitting strategy and the classical alternating direction method of multiplier (ADMM). Numerical simulations show that the proposed balanced-compound approach can achieve less coefficient estimated error than the hybrid synthesis-analysis approach under comparable qualities in image deblurring problem. This improvement is due to the added balanced term. Moreover, by exploiting the related fast tight Parseval frames and the special structure of the observation matrix, the regularized Hessian matrix can perform efficiently for the frame-based image deblurring.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"299 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":"132333087","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.6782976
Miin-Jong Hao, Wen-Cheng Kao
Despite the rapid development of wireless communication and broadband applications for multimedia service, the 2 Mbps downlink data rate of the present 3G communication system cannot satisfy demand for a fast and high quality packet data service. The use of the HSDPA (High Speed Downlink Packet Access) air interface can upgrade the downlink packet data rate by 10.7~14.4 Mbps. This paper presents a mobile backhaul planning process and proposes a network reliability analysis of the ROADM design for next generation transport network. The term mobile backhaul refers to the fixed wire-line and/or wireless interconnections of mobile service base stations, and their connection to the core telecommunications network. We examine the NGSDH+OXC systems in the fixed wire-line for the HSDPA offload. The traffic statistics of the cell and the HSDPA area's measurement results of its communication quality show that the planning is successful and satisfy the QoS standard.
{"title":"Reliability analysis and loading application in circuits for next generation transport networks","authors":"Miin-Jong Hao, Wen-Cheng Kao","doi":"10.1109/ICICS.2013.6782976","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782976","url":null,"abstract":"Despite the rapid development of wireless communication and broadband applications for multimedia service, the 2 Mbps downlink data rate of the present 3G communication system cannot satisfy demand for a fast and high quality packet data service. The use of the HSDPA (High Speed Downlink Packet Access) air interface can upgrade the downlink packet data rate by 10.7~14.4 Mbps. This paper presents a mobile backhaul planning process and proposes a network reliability analysis of the ROADM design for next generation transport network. The term mobile backhaul refers to the fixed wire-line and/or wireless interconnections of mobile service base stations, and their connection to the core telecommunications network. We examine the NGSDH+OXC systems in the fixed wire-line for the HSDPA offload. The traffic statistics of the cell and the HSDPA area's measurement results of its communication quality show that the planning is successful and satisfy the QoS standard.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"65 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":"130979576","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.6782954
Yu-Cheng Fan, W. Ting, Chun-Hung Wang
In this paper, we proposed chip design of three dimensional interactive video system based on the DTHI (Dynamic Tracking of Historical Images) technology. The main part of this paper focus on the DTHI system architecture design. Implementing gesture recognition and control instruction which could be simulated with three dimensional images database is achieved in this paper. In order to design chip, we using the DTHI technology and trade-off scan. The approach integrates interactive remote technology and 3D image display technology and provides consumer an interesting 3D display and interactive environment.
{"title":"DTHI based three dimensional interactive multimedia chip and system design","authors":"Yu-Cheng Fan, W. Ting, Chun-Hung Wang","doi":"10.1109/ICICS.2013.6782954","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782954","url":null,"abstract":"In this paper, we proposed chip design of three dimensional interactive video system based on the DTHI (Dynamic Tracking of Historical Images) technology. The main part of this paper focus on the DTHI system architecture design. Implementing gesture recognition and control instruction which could be simulated with three dimensional images database is achieved in this paper. In order to design chip, we using the DTHI technology and trade-off scan. The approach integrates interactive remote technology and 3D image display technology and provides consumer an interesting 3D display and interactive environment.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"22 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":"127963320","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.6782837
R. V. C. Gimeno, Antonio García Celda, Marta Pla-Castells, J. M. Plume
The use of Anisotropic Magneto-Resistive (AMR) sensors for road traffic monitoring has gained popularity in recent years. The Earth magnetic field variations caused by vehicles passing over this kind of sensors can be measured and used for various purposes, including vehicle re-identification at different sensing zones. AMR sensors provide data that allow the calculation of traffic parameters by using simple signal processing techniques. But when vehicle re-identification is the objective, it is not clear which is the best method to compare the signals from different sensors in order to know whether or not they belong to the same vehicle. This paper presents an experimental study with the objective of determining the optimal similarity measure function for AMR sensors signals when used for vehicle re-identification.
{"title":"Improving similarity measures for re-identification of vehicles using AMR sensors","authors":"R. V. C. Gimeno, Antonio García Celda, Marta Pla-Castells, J. M. Plume","doi":"10.1109/ICICS.2013.6782837","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782837","url":null,"abstract":"The use of Anisotropic Magneto-Resistive (AMR) sensors for road traffic monitoring has gained popularity in recent years. The Earth magnetic field variations caused by vehicles passing over this kind of sensors can be measured and used for various purposes, including vehicle re-identification at different sensing zones. AMR sensors provide data that allow the calculation of traffic parameters by using simple signal processing techniques. But when vehicle re-identification is the objective, it is not clear which is the best method to compare the signals from different sensors in order to know whether or not they belong to the same vehicle. This paper presents an experimental study with the objective of determining the optimal similarity measure function for AMR sensors signals when used for vehicle re-identification.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"9 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":"125577547","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.6782781
Ngo Truong Giang, Ngo Quoc Tao, N. D. Dung, Nguyen Trong The
Shape matching is a very important issue and challenging task in computer vision. In this paper, the problem of finding a matching between two shapes is addressed by establishing correspondences between two their skeleton graphs based on random walk framework. We first propose a novel skeleton graph model in which nodes represent end-nodes of skeleton while edges describe relations between two end-nodes. Matching between two skeletons is then formulated as graph matching, which is solved by ranking on an association graph via random walks. By applying the random walks with reweighting jumps on the association skeleton graph, the proposed method can collect potential matches, eliminating the unreliable matches, which are affected by noise and distortion. Comparative experiments on several benchmark data sets show that the proposed method produces more accurate results than the previous works.
{"title":"Skeleton based shape matching using reweighted random walks","authors":"Ngo Truong Giang, Ngo Quoc Tao, N. D. Dung, Nguyen Trong The","doi":"10.1109/ICICS.2013.6782781","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782781","url":null,"abstract":"Shape matching is a very important issue and challenging task in computer vision. In this paper, the problem of finding a matching between two shapes is addressed by establishing correspondences between two their skeleton graphs based on random walk framework. We first propose a novel skeleton graph model in which nodes represent end-nodes of skeleton while edges describe relations between two end-nodes. Matching between two skeletons is then formulated as graph matching, which is solved by ranking on an association graph via random walks. By applying the random walks with reweighting jumps on the association skeleton graph, the proposed method can collect potential matches, eliminating the unreliable matches, which are affected by noise and distortion. Comparative experiments on several benchmark data sets show that the proposed method produces more accurate results than the previous works.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"76 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":"126214353","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.6782848
Mu Cheng, Xiaohui Huang, Ma Yan
Detecting and identification the network traffic attracts many attentions in recent years. Statistical approach using the machining learning algorithm can classify the network traffic efficiently without detecting the payload of every packet. At the same time, the accuracy depends on the statistical features of the training set. However, the traditional process without pre-treatment of the statistical features can lead to the misidentification in many scenarios. In this paper, an improved method is proposed based on the PCA (Principle Component Analysis) algorithm for pre-treatment of the statistical features, which is able to refine the results of traffic identification. Extensive experiments have been done and the results show that the accuracy rate of traffic classification based on the improved statistical method is improved.
{"title":"Using PCA algorithm to refine the results of internet traffic identification","authors":"Mu Cheng, Xiaohui Huang, Ma Yan","doi":"10.1109/ICICS.2013.6782848","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782848","url":null,"abstract":"Detecting and identification the network traffic attracts many attentions in recent years. Statistical approach using the machining learning algorithm can classify the network traffic efficiently without detecting the payload of every packet. At the same time, the accuracy depends on the statistical features of the training set. However, the traditional process without pre-treatment of the statistical features can lead to the misidentification in many scenarios. In this paper, an improved method is proposed based on the PCA (Principle Component Analysis) algorithm for pre-treatment of the statistical features, which is able to refine the results of traffic identification. Extensive experiments have been done and the results show that the accuracy rate of traffic classification based on the improved statistical method is improved.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"46 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018126","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.6782772
Chuan-Yu Chang, Yi-Ping Chang
In our living environment, there are various types of sounds. According to the uniqueness of sounds, people can further comprehend the surrounding by the sense of hearing. Nowadays, voice recognition had been widely applied in various applications. In this paper, we proposed an abnormal sound recognition system for monitoring indoor sounds. Twenty-four features were extracted from each sound frame. The sequential floating forward selection (SFFS) was then adopted to select high discriminative features. The support vector machine (SVM) was finally used to classify the sounds into six categories (screaming, infants' crying, coughing, glass breaking, laughing and doorbell ringing). From the experiment results, the proposed system can effectively recognize different kinds of abnormal sounds with a high recognition rate.
{"title":"Application of abnormal sound recognition system for indoor environment","authors":"Chuan-Yu Chang, Yi-Ping Chang","doi":"10.1109/ICICS.2013.6782772","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782772","url":null,"abstract":"In our living environment, there are various types of sounds. According to the uniqueness of sounds, people can further comprehend the surrounding by the sense of hearing. Nowadays, voice recognition had been widely applied in various applications. In this paper, we proposed an abnormal sound recognition system for monitoring indoor sounds. Twenty-four features were extracted from each sound frame. The sequential floating forward selection (SFFS) was then adopted to select high discriminative features. The support vector machine (SVM) was finally used to classify the sounds into six categories (screaming, infants' crying, coughing, glass breaking, laughing and doorbell ringing). From the experiment results, the proposed system can effectively recognize different kinds of abnormal sounds with a high recognition rate.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"17 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":"127678724","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.6782961
Yan-Tsung Peng, Bing-Chuan Tsai, S. Ruan
Histogram equalization (HE) is widely used in image contrast enhancement. It basically equalizes the image histogram to improve the contrast of the input image. In this paper, we propose a Sub-Image Edge Preservation (SIEP) method applied to HE-based contrast enhancement algorithms to further preserve edges in the histogram-equalized images and enhance local contrast. In this method, the input image is partitioned into different sub-images and in turn, the local transform function of each sub-image is generated respectively by applying a HE-based contrast enhancement method. Moreover, it exploits the total of gradients in each sub-image to weigh each local transform function for generating a global transform function to enhance overall image contrast while preserving edges. Experimental results show the efficacy of our method for a better edge preserving rate.
{"title":"A Sub-Image Edge Preservation method for histogram equalization","authors":"Yan-Tsung Peng, Bing-Chuan Tsai, S. Ruan","doi":"10.1109/ICICS.2013.6782961","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782961","url":null,"abstract":"Histogram equalization (HE) is widely used in image contrast enhancement. It basically equalizes the image histogram to improve the contrast of the input image. In this paper, we propose a Sub-Image Edge Preservation (SIEP) method applied to HE-based contrast enhancement algorithms to further preserve edges in the histogram-equalized images and enhance local contrast. In this method, the input image is partitioned into different sub-images and in turn, the local transform function of each sub-image is generated respectively by applying a HE-based contrast enhancement method. Moreover, it exploits the total of gradients in each sub-image to weigh each local transform function for generating a global transform function to enhance overall image contrast while preserving edges. Experimental results show the efficacy of our method for a better edge preserving rate.","PeriodicalId":184544,"journal":{"name":"2013 9th International Conference on Information, Communications & Signal Processing","volume":"623 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":"132786418","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.6782866
V. Reddy, B. Ng, Andy W. H. Khong
The problem of direction-of-arrival (DOA) estimation in dispersive medium is considered in this work. For accurate localization of the sources in seismic and underwater acoustic applications, speed profile is estimated and employed. In contrast to this approach, we propose a new algorithm for wideband DOA estimation with unknown speed profile across the source bandwidth. This insensitivity to dispersion is accomplished by incorporating soft derivative constraint into the optimization problem. The presented simulations exhibit the effectiveness of the proposed algorithm in estimating the source directions in dispersive medium.
{"title":"Wideband DOA estimation in dispersive medium","authors":"V. Reddy, B. Ng, Andy W. H. Khong","doi":"10.1109/ICICS.2013.6782866","DOIUrl":"https://doi.org/10.1109/ICICS.2013.6782866","url":null,"abstract":"The problem of direction-of-arrival (DOA) estimation in dispersive medium is considered in this work. For accurate localization of the sources in seismic and underwater acoustic applications, speed profile is estimated and employed. In contrast to this approach, we propose a new algorithm for wideband DOA estimation with unknown speed profile across the source bandwidth. This insensitivity to dispersion is accomplished by incorporating soft derivative constraint into the optimization problem. The presented simulations exhibit the effectiveness of the proposed algorithm in estimating the source directions in dispersive medium.","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":"133972514","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
扫码关注我们
求助内容：
应助结果提醒方式：