IET Signal Process.最新文献

筛选
英文 中文
RIP based condition for support recovery with A* OMP in the presence of noise 基于RIP的条件下支持恢复与A* OMP在存在噪声
IET Signal Process. Pub Date : 2020-03-24 DOI: 10.1049/iet-spr.2019.0478
Haifeng Li, Wengu Chen
{"title":"RIP based condition for support recovery with A* OMP in the presence of noise","authors":"Haifeng Li, Wengu Chen","doi":"10.1049/iet-spr.2019.0478","DOIUrl":"https://doi.org/10.1049/iet-spr.2019.0478","url":null,"abstract":"A* orthogonal matching pursuit (A* OMP) aims at combination of best-first tree search with the OMP algorithm for the compressed sensing problem. In this study, the authors present a new analysis for the A* OMP algorithm using the restricted isometry property (RIP). The results show that if the sampling matrix A satisfies the RIP with δ K ⋆ < B / ( K + B ) ( K ⋆ = max { 2 K , K + B } ), then under some constraints on SNR, A* OMP accurately recovers the support of any K-sparse signal x from the samples y = A x + e , where B is the number of child paths for each candidate in the algorithm. In addition, the proposed condition is an optimal condition that guarantees the success of A* OMP in the noise-free case.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127659510","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}
引用次数: 3
Minimum mean squares error beamforming with cyclic sub-vector optimisation 循环子向量优化的最小均方误差波束形成
IET Signal Process. Pub Date : 2020-03-24 DOI: 10.1049/IET-SPR.2019.0164
Tuanning Liu, Yuanping Zhou, Yaoting Ma, Rongzhen Miao
{"title":"Minimum mean squares error beamforming with cyclic sub-vector optimisation","authors":"Tuanning Liu, Yuanping Zhou, Yaoting Ma, Rongzhen Miao","doi":"10.1049/IET-SPR.2019.0164","DOIUrl":"https://doi.org/10.1049/IET-SPR.2019.0164","url":null,"abstract":"A cyclic sub-vector optimisation (CSVO) beamforming approach is investigated. With the proposed algorithm, an array beamforming vector is partitioned into a number of sub-vectors of small sizes, allowing reduced-dimension processing. Then multiple optimisation cycles are carried out by the block coordinate descent method, which leads to an optimal beamforming vector. The proposed scheme still needs to compute the matrix inversion, but the size of the matrix can be flexibly chosen and the computational complexity is manageable. The proof of the convergence and complexity analysis is given. The simulation results demonstrate the effectiveness and fine features of the proposed algorithm. Although the convergence rate of the CSVO is slightly slower, the CSVO has lower computational complexity than that of the diagonal loading conjugate gradient applied to normal equations algorithm. In comparison with other sub-vector approaches, the proposed algorithm gains a faster convergence rate and improved stability.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125668952","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}
引用次数: 0
Adaptive multi-band filter structure-based far-end speech enhancement 基于自适应多频带滤波器结构的远端语音增强
IET Signal Process. Pub Date : 2020-03-19 DOI: 10.1049/iet-spr.2019.0226
P. ActlinJeevaM, Tushar Nagarajan, P. Vijayalakshmi
{"title":"Adaptive multi-band filter structure-based far-end speech enhancement","authors":"P. ActlinJeevaM, Tushar Nagarajan, P. Vijayalakshmi","doi":"10.1049/iet-spr.2019.0226","DOIUrl":"https://doi.org/10.1049/iet-spr.2019.0226","url":null,"abstract":"Speech signals degraded by noise tend to lose their quality and intelligibility. Therefore, the goal of speech enhancement algorithms is to restore these attributes of speech. The current work proposes a dynamic filter structure, dynamic over every utterance, that would vary simultaneously based on (i) the class of sound units in a given noisy/degraded signal, to improve intelligibility, and (ii) the noise components present, to improve quality. This filter structure is employed in the temporal-domain filtering-based multi-band speech enhancement algorithm, proposed by Jeeva et al.. The performance of the algorithm is evaluated subjectively and objectively, in terms of quality and intelligibility, and the algorithm is observed to successfully improve both attributes of degraded speech. Since the improvement in intelligibility depends on the effective restoration of sound units in the utterance, this process is language-specific. In this regard, an analysis is performed to study the influence of phone class distribution on the intelligibility improvement achieved for four Indian languages, namely Tamil, Hindi, Telugu, and Malayalam, and Indian English.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121720173","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}
引用次数: 4
Joint beamforming and admission control for cache-enabled Cloud-RAN with limited fronthaul capacity 联合波束形成和接收控制的缓存启用云- ran与有限的前传容量
IET Signal Process. Pub Date : 2020-03-03 DOI: 10.1049/iet-spr.2019.0247
Ashraf Bsebsu, G. Zheng, S. Lambotharan, K. Cumanan, Basil AsSadhan
{"title":"Joint beamforming and admission control for cache-enabled Cloud-RAN with limited fronthaul capacity","authors":"Ashraf Bsebsu, G. Zheng, S. Lambotharan, K. Cumanan, Basil AsSadhan","doi":"10.1049/iet-spr.2019.0247","DOIUrl":"https://doi.org/10.1049/iet-spr.2019.0247","url":null,"abstract":"Caching is a promising solution for the cloud radio access network (Cloud-RAN) to mitigate the traffic load problem in the fronthaul links. Multiuser downlink beamforming plays an important role for efficient utilization of spectrum and transmission power while satisfying the user’s quality of service (QoS) requirements. When the number of users exceeds the serving capacity of the network, certain users will have to be dropped or re-scheduled. This is normally achieved by appropriate admission control mechanisms. Introducing local storage or cache at the remote radio heads (RRHs) where some popular contents are cached, we propose beamforming and admission control technique for cache-enabled Cloud-RAN in the downlink. This minimizes the total network cost including power and fronthaul cost while admitting as many users as possible. We formulate this multi-objective optimization problem as a single objective optimization problem. The original problem which is mixed-integer non-linear program (MINLP) is first co verted to the mixed-integer second order cone programming form (MISOCP). Branch and Bound (BnB) algorithm is then used to determine the optimal and suboptimal solutions. Simulation study has been conducted to assess the performance of both methods.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132044740","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}
引用次数: 4
Improved RPCA method via non-convex regularisation for image denoising 基于非凸正则化的改进RPCA图像去噪方法
IET Signal Process. Pub Date : 2020-02-21 DOI: 10.1049/iet-spr.2019.0365
Sijie Wang, Ke-wen Xia, L. xilinx Wang, Jiangnan Zhang, Huaijin Yang
{"title":"Improved RPCA method via non-convex regularisation for image denoising","authors":"Sijie Wang, Ke-wen Xia, L. xilinx Wang, Jiangnan Zhang, Huaijin Yang","doi":"10.1049/iet-spr.2019.0365","DOIUrl":"https://doi.org/10.1049/iet-spr.2019.0365","url":null,"abstract":"The traditional robust principal component analysis (RPCA) model is based on the nuclear norm, which usually underestimates the singular values of the low-rank matrix. As a consequence, the restoration image experiences serious interference by Gaussian noise, and the image quality degenerates during the denoising process. Therefore, an improved RPCA method via non-convex regularisation terms is proposed to remedy the above shortcomings. First, in order to estimate the singular value of the low-rank matrix more accurately, the authors employ the non-convex penalty function and add a weight vector to it. Then, the regularisation with non-convex penalty function and its weighted version are used to replace the nuclear norm and entry-wise l\u0000 1\u0000 norm in original RPCA, respectively, to establish an improved model. Finally, an optimal solution algorithm is derived by developing the alternating direction multiplier method. Experimental results show that the proposed method has better performance in terms of both quantitative measurement and visual perception quality than other several state-of-the-art image denoising methods.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124415174","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}
引用次数: 18
New two-stage approach to ECG denoising 新的两阶段心电去噪方法
IET Signal Process. Pub Date : 2019-08-01 DOI: 10.1049/IET-SPR.2018.5458
N. Mourad
{"title":"New two-stage approach to ECG denoising","authors":"N. Mourad","doi":"10.1049/IET-SPR.2018.5458","DOIUrl":"https://doi.org/10.1049/IET-SPR.2018.5458","url":null,"abstract":"A new algorithm for denoising electrocardiogram (ECG) signals contaminated by additive white Gaussian noise is proposed in this study. In the proposed algorithm, a clean ECG signal is modelled as a combination of a smooth\u0000 signal representing the P-wave and the T-wave, and a group-sparse\u0000 (GS) signal representing the QRS-complex, where a GS signal is a sparse signal in which its non-zero entries tend to concentrate in groups. Accordingly, the proposed approach consists of two stages. In the first stage, an algorithm previously developed by the author is adapted to extract the GS signal representing the QRS-complex, while in the second stage a new algorithm is developed to smooth the remaining signal. Each one of these two algorithms depends on a regularisation parameter, which is selected automatically in the proposed algorithms. Simulation results on real and simulated ECG data show that the proposed algorithm can be successfully utilised to denoise ECG data. In addition, the proposed algorithm is also shown to produce significantly improved results compared to existing techniques used for performing similar tasks.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"32 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117457294","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}
引用次数: 4
Waveform covariance matrix design using Fourier series coefficients 用傅立叶级数系数设计波形协方差矩阵
IET Signal Process. Pub Date : 2019-04-16 DOI: 10.1049/IET-SPR.2019.0024
Mostafa Bolhasani, Esmaeil Kavousi Ghafi, S. Ghorashi, E. Mehrshahi
{"title":"Waveform covariance matrix design using Fourier series coefficients","authors":"Mostafa Bolhasani, Esmaeil Kavousi Ghafi, S. Ghorashi, E. Mehrshahi","doi":"10.1049/IET-SPR.2019.0024","DOIUrl":"https://doi.org/10.1049/IET-SPR.2019.0024","url":null,"abstract":"Multiple-input multiple-output (MIMO) radars may outperform other radar systems such as phased array radars, in terms of higher resolution, better detection probability in the presence of interferences, better parameter identifiability and more flexibility in beampattern design. Waveform covariance matrix design, because of its role in the beampattern synthesis process, is one of the most important problems in MIMO radar systems. In this study, the authors have proposed a closed-form solution based on Fourier series coefficients to design a covariance matrix. The resulting covariance matrix fulfils the practical constraints, i.e. positive semi-definiteness and the uniform elemental power constraint. It also provides performance similar to that of iterative methods, while requires lower computation time and provides better mean square error with respect to other existing closed-form methods. Eigenvalue decomposition is also utilised to convert the possible resulted pseudo-covariance matrices (pseudo-CM), which are not guaranteed to be positive semidefinite, into a covariance matrix. Simulation results show the performance of the proposed method.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"104 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"119964159","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}
引用次数: 6
Equivalent Markov models for filtering and smoothing of mining vehicle positions 采矿车辆位置滤波平滑的等效马尔可夫模型
IET Signal Process. Pub Date : 2019-04-11 DOI: 10.1049/IET-SPR.2018.5255
G. Einicke
{"title":"Equivalent Markov models for filtering and smoothing of mining vehicle positions","authors":"G. Einicke","doi":"10.1049/IET-SPR.2018.5255","DOIUrl":"https://doi.org/10.1049/IET-SPR.2018.5255","url":null,"abstract":"A linear state-space model is described whose second-order moments match that of a hidden Markov chain (HMC). This model enables a modified transition probability matrix to be employed within minimum-variance filters and smoothers. However, the ensuing filter/smoother designs can exhibit suboptimal performance because a previously reported transition-probability-matrix modification is conservative, and identified models can lack observability and reachability. This article describes a less-conservative transition-probability-matrix modification and a model-order-reduction procedure to enforce observability and reachability. An optimal minimum-variance predictor, filter, and smoother are derived to recover the Markov chain states from noisy measurements. The predictor is asymptotically stable provided that the problem assumptions are correct. It is shown that collapsing the model improves state-prediction performance. The filter and smoother recover the Markov states exactly when the measurement noise is negligible. A mining vehicle position tracking application is discussed in which performance benefits are demonstrated.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120086638","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}
引用次数: 0
Detection of epileptic seizure employing a novel set of features extracted from multifractal spectrum of electroencephalogram signals 从脑电图信号的多重分形谱中提取一组新的特征来检测癫痫发作
IET Signal Process. Pub Date : 2019-04-01 DOI: 10.1049/IET-SPR.2018.5258
R. Bose, S. Pratiher, S. Chatterjee
{"title":"Detection of epileptic seizure employing a novel set of features extracted from multifractal spectrum of electroencephalogram signals","authors":"R. Bose, S. Pratiher, S. Chatterjee","doi":"10.1049/IET-SPR.2018.5258","DOIUrl":"https://doi.org/10.1049/IET-SPR.2018.5258","url":null,"abstract":"Here, a technique for automated detection of epilepsy is proposed, based on a novel set of features derived from the multifractal spectrum of electroencephalogram (EEG) signals. In fractal geometry, multifractal detrended fluctuation analysis (MDFA) is a technique to examine the self-similarity of a non-linear, chaotic and noisy time series. EEG signals which are representatives of complex human brain dynamics can be effectively characterised by MDFA. Here, EEG signals representing healthy, interictal and seizure activities are acquired from an available dataset. The acquired signals are at first analysed using MDFA. Based on the multifractal analysis, 14 novel features are proposed in this study, to distinguish between different types of EEG signals. The statistical significance of the selected features is evaluated using Kruskal–Wallis test and is finally served as input feature vector to a support vector machines classifier for the classification of EEG signals. Four classification problems are presented in this work and it is observed that 100% classification accuracy is obtained for three problems which validate the efficacy of the proposed model for computer-aided diagnosis of epilepsy.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"119216287","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}
引用次数: 28
Extraction of acoustic features based on auditory spike code and its application to music genre classification 基于听觉脉冲码的声学特征提取及其在音乐类型分类中的应用
IET Signal Process. Pub Date : 2019-04-01 DOI: 10.1049/IET-SPR.2018.5158
Seong-Hyeon Shin, Ho-Won Yun, Woo-Jin Jang, Hochong Park
{"title":"Extraction of acoustic features based on auditory spike code and its application to music genre classification","authors":"Seong-Hyeon Shin, Ho-Won Yun, Woo-Jin Jang, Hochong Park","doi":"10.1049/IET-SPR.2018.5158","DOIUrl":"https://doi.org/10.1049/IET-SPR.2018.5158","url":null,"abstract":"A new method of extracting acoustic features based on auditory spike code is proposed. An auditory spike code represents the acoustic activities created by the signal, similar to sound encoding of the human auditory system. In the proposed method, an auditory spike code of the signal is computed using a 64-band Gammatone filterbank as the kernel functions. Then, for each spectral band, the sum and non-zero counts of the auditory spike code are determined, and the features corresponding to the population and occurrence rate of the acoustic activities for each band are computed. In addition, the distribution of the acoustic activities on a time axis is analysed based on the histogram of time intervals between the adjacent acoustic activities, and the features for expressing temporal properties of the signal are extracted. The reconstruction accuracy of the auditory spike code is also measured as the features. Different from most conventional features obtained by complex statistical modelling or learning, the features by the proposed method can directly show specific acoustic characteristics contained in the signal. These features are applied to a music genre classification, and it is confirmed that they provide a performance comparable to state-of-the-art features.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120324881","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}
引用次数: 15
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信