A novel and simple technique to allow detection of the position of the R-waves from intraventricular pressure waveforms: application to the conductance catheter method

A simple and novel technique that utilizes the zero-crossing points of the first time derivative of intra-ventricular pressure (dP/dt) to mark systole, is proposed. Discrete differentiation of the sampled pressure waveform is calculated using a difference equation. Filtration of high-frequency noise in dP/dt is achieved using a low-pass Butterworth filter of order 4 and a cutoff frequency of 10 Hz. The filter is realized digitally using infinite impulse response filter stages. Double filtering of discrete dP/dt is used to eliminate time shifts. The methods are evaluated on data obtained from six large, white, anaesthetised and open chest pigs, instrumented with a conductance catheter. The zero-crossing points of the filtered dP/dt compare very well with the R-waves of the electrocardiogram (ECG) as markers of systole. The mean error is 1.3% of the duration of the heartcycle. Significantly, our results provide a solution to a problem often encountered with multiuse pressure-volume catheters when an ECG signal cannot be obtained. In this situation, the zero-crossing points of dP/dt, rather than the R-waves of the ECG, can be used as a marker of systole, thus enabling the construction of end-systolic pressure-volume relations to assess cardiac contractility.     

A Device for the Calculation of dP/dt/P with Internal Calibration

An analog method for the calculation of dP/dt/P is described that in-corporates a means for internal calibration. Engineering tests of this device are reported as well as tests using pressures from the left ventricle of swine (20-25 Kgm). Interventions included inflation of a balloon in the inferior vena cava (peak pressure reduced by 50 percent), occlusion of the aorta (peak pressure increased by 100 percent), and pacing (from 150 to 210 beats/min). dP/dt/P (P denotes left-ventricular pressure) calculated from the analog device agreed within the noise level when compared with the calculation based on pressure alone using an A-D converter and digital computer.     

基于生成对抗网络的动态心电信号QRS波检测

心电信号分析是预防心血管疾病的重要举措,QRS波的精确检测不仅是心电信号处理的关键步骤且对心率计算和异常情况分析具有重要作用.针对动态心电信号存在信号质量差或异常节奏波形导致常用QRS波检测方法精度较低的问题,本文提出了 一种基于生成对抗网络新型QRS波检测算法.该算法以Pix2Pix网络为基础,生成网络采用U-Net...     

基于集合经验模态分解和信号结构分析的心电信号R波识别算法

R波作为确定心电信号各波段的重要参考,是心电自动分析的前提。针对大多数R波识别算法的预处理过程影响识别准确度和耗时问题,该文提出一种基于集合经验模态分解(EEMD)和信号结构分析的算法对带噪心电信号(ECG)的R波直接进行识别。首先通过EEMD将带噪声的心电信号分解成一系列本征模态分量,然后对分解后的各模态分量作独立成分分析以提取出R波特征最明显的成分,对该成分进行结构分析,从而实现对R波的准确定位。仿真结果表明,该文算法对带噪声心电信号的R波识别具有更优性能,对异常心电信号的R波识别也具有明显效果。     

非高斯条件下基于粒子滤波的T波交替检测算法

针对动态心电图中非稳态、非线性和非高斯T波交替检测（T-wave alternans,TWA）的稳健检测问题,本文首先提出了一个TWA的非线性、拉普拉斯噪声的状态空间模型,然后采用粒子滤波方法对动态心电信号中的T波交替幅值进行估计,实现了心电信号中T波交替的定性和定量分析.仿真结果表明,在加入高斯噪声和非高斯噪声情况下,与经典的SM和MMA方法进行对比,本文提出的算法准确度和稳健性表现最好,并且本文算法能准确地实时地跟踪非稳态的TWA现象.     

Li-Zr替代对β-BZN陶瓷介电性能的研究

采用固相反应制备(Bi_(2-x)Li_x)(Zn_(2/3)Nb_(1.183 3)Zr_(0.15))O_7陶瓷,研究了Li~+替代Bi~(3+)对(Bi_(2-x)Li_x)(Zn_(2/3)Nb_(1.183 3)Zr_(0.15))O_7陶瓷样品相结构和介电性能的影响.结果表明,当替代量x≤0.1(摩尔分数)时,相结构保持单一的单斜焦绿石相,介电损耗出现明显的弛豫现象,运用缺陷偶极子模型解释了这一现象.随着Li替代量的增加,介电弛豫峰值温度向高温方向移动,与x(Li)=0.025、0.05、0.075和0.1时相对应的介电损耗峰值温度为47 ℃、112 ℃、115 ℃、120 ℃.介电弛豫峰不对称性符合A.K.Jonscher的普适弛豫定律.     

QoS Supporting Algorithms for Optical Internet Based on Optical Burst Switching

In this paper, we propose a protocol architecture and quality of service (QoS) supporting algorithms for optical Internet based on optical burst switching (OBS) technology. Firstly, the function of each layer of the protocol architecture and the formats of control packets are defined in order to adopt GMPLS to the control plane of OBS. Then, the offset time decision (OTD) algorithm to cooperate with the proposed protocol architecture is designed for optical Internet. A new burst loss formula taking into account the effect of offset time is introduced to design the OTD algorithm. This algorithm can decide on the appropriate priority-offset time according to the required QoS by using the reversed equation of the so-called heuristic loss formula (HLF) which is approximated as a proportional equation of our new loss formula. Finally, we propose a CAC algorithm based on the OTD algorithm for the purpose of increasing the availability of wavelength resources and supporting the QoS of established connections in optical Internet. The performance of the proposed algorithms is evaluated in terms of burst loss rate and the number of connections through simulation.     

任意长度离散Hartley变换的快速算法

本文把长为plq(p为奇数,q为任意自然数)的DHT转化为Pl个长为q的DHT的计算及其附加运算,附加运算只涉及P点cos-DFT和sin-DFT的计算;对长度(P1l,1,Psls 2l (p1, , ps为奇素数)的DHT,用同样的递归技术得到其快速算法,因而可计算任意长度的DHT;文中还论证了计算长为N的DHT所需的乘法和加法运算量不超过O(Nlog2N)。当长度为N=pl时,本文算法的乘法量比其他已知算法更少。     

子集和问题的量子中间相遇搜索算法

子集和问题是NP完全问题,该问题是背包公钥的基础.现有最优的经典算法求解规模为n的子集和问题需要O(n2n/2)步运算.本文提出了基于时空折衷思想的量子中间相遇搜索算法,该算法可以在O(n2n/3)步求解规模为n的子集和问题,其存储复杂性为O(2n/3).由于NP完全问题可以在多项式时间内可相互归约,所以,在存储复杂性...     

Nonlinear wavelet image processing: variational problems,compression, and noise removal through wavelet shrinkage

This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of variational problems; in particular, we show that wavelet shrinkage can be considered the exact minimizer of the following problem. Given an image F defined on a square I, minimize over all g in the Besov space B(1)(1)(L (1)(I)) the functional |F-g|(L2)(I)(2)+lambda|g|(B(1)(1 )(L(1(I)))). We use the theory of nonlinear wavelet image compression in L(2)(I) to derive accurate error bounds for noise removal through wavelet shrinkage applied to images corrupted with i.i.d., mean zero, Gaussian noise. A new signal-to-noise ratio (SNR), which we claim more accurately reflects the visual perception of noise in images, arises in this derivation. We present extensive computations that support the hypothesis that near-optimal shrinkage parameters can be derived if one knows (or can estimate) only two parameters about an image F: the largest alpha for which FinB(q)(alpha )(L(q)(I)),1/q=alpha/2+1/2, and the norm |F|B(q)(alpha)(L(q)(I)). Both theoretical and experimental results indicate that our choice of shrinkage parameters yields uniformly better results than Donoho and Johnstone's VisuShrink procedure; an example suggests, however, that Donoho and Johnstone's (1994, 1995, 1996) SureShrink method, which uses a different shrinkage parameter for each dyadic level, achieves a lower error than our procedure.     

Cardiac Output Monitoring by Impedance Cardiography During Treadmill Exercise

We have modified impedance cardiography for monitoring cardiac output during stress tests. We adapted an ensemble-averaging technique for eliminating motion artifacts. We applied an array consisting of four spot ECG electrodes for impedance cardiogram (ICG) monitoring and compared it to conventional encircling band electrodes. We tested ten normal adults, compared the cardiac output obtained by our ICG monitoring system to that simultaneously obtained by the carbon dioxide (CO2) rebreathing method at rest and during three levels of treadmill exercise. The results show that the correlation coefficient between the spot electrode ICG and the CO2 rebreathing method is r = 0.90, and between the band electrode ICG and the CO2 rebreathing method is r = 0.96. If we use the peak-to-valley height of dz/dt instead of the peak height of dZ/dt in computing cardiac output, the correlation coefficient between the spot electrode ICG and the CO2 rebreathing method can be improved to r = 0.95.     

Maximum likelihood reconstruction for emission tomography

Previous models for emission tomography (ET) do not distinguish the physics of ET from that of transmission tomography. We give a more accurate general mathematical model for ET where an unknown emission density lambda = lambda(x, y, z) generates, and is to be reconstructed from, the number of counts n(*)(d) in each of D detector units d. Within the model, we give an algorithm for determining an estimate lambdainsertion mark of lambda which maximizes the probability p(n(*)|lambda) of observing the actual detector count data n(*) over all possible densities lambda. Let independent Poisson variables n(b) with unknown means lambda(b), b = 1, ..., B represent the number of unobserved emissions in each of B boxes (pixels) partitioning an object containing an emitter. Suppose each emission in box b is detected in detector unit d with probability p(b, d), d = 1, ..., D with p(b,d) a one-step transition matrix, assumed known. We observe the total number n(*) = n(*)(d) of emissions in each detector unit d and want to estimate the unknown lambda = lambda(b), b = 1, ..., B. For each lambda, the observed data n(*) has probability or likelihood p(n(*)|lambda). The EM algorithm of mathematical statistics starts with an initial estimate lambda(0) and gives the following simple iterative procedure for obtaining a new estimate lambdainsertion mark(new), from an old estimate lambdainsertion mark(old), to obtain lambdainsertion mark(k), k = 1, 2, ..., lambdainsertion mark(new)(b)= lambdainsertion mark(old)(b)Sum of (n(*)p(b,d) from d=1 to D/Sum of lambdainsertion mark()old(b('))p(b('),d) from b(')=1 to B), b=1,...B.     

Concepts of exact QoS routing algorithms

The underlying concepts of an exact QoS routing algorithm are explained. We show that these four concepts, namely 1) nonlinear definition of the path length; 2) a /spl kappa/-shortest path approach; 3) nondominance; and 4) look-ahead, are fundamental building blocks of a multiconstrained routing algorithm. The main reasons to consider exact multiconstrained routing algorithms are as follows. First, the NP-complete behavior seems only to occur in specially constructed graphs, which are unlikely to occur in realistic communication networks. Second, there exist exact algorithms that are equally complex as heuristics in algorithmic structure and in running time on topologies that do not induce NP-complete behavior. Third, by simply restricting the number /spl kappa/ of paths explored during the path computation, the computational complexity can be decreased at the expense of possibly loosing exactness. The presented four concepts are incorporated in SAMCRA, a self-adaptive multiple constraints routing algorithm.     

ECG signal compression using analysis by synthesis coding

In this paper, an elecrocardiogram (ECG) compression algorithm, called analysis by synthesis ECG compressor (ASEC), is introduced. The ASEC algorithm is based on analysis by synthesis coding, and consists of a beat codebook, long and short-term predictors, and an adaptive residual quantizer. The compression algorithm uses a defined distortion measure in order to efficiently encode every heartbeat, with minimum bit rate, while maintaining a predetermined distortion level. The compression algorithm was implemented and tested with both the percentage rms difference (PRD) measure and the recently introduced weighted diagnostic distortion (WDD) measure. The compression algorithm has been evaluated with the MIT-BIH Arrhythmia Database. A mean compression rate of approximately 100 bits/s (compression ratio of about 30:1) has been achieved with a good reconstructed signal quality (WDD below 4% and PRD below 8%). The ASEC was compared with several well-known ECG compression algorithms and was found to be superior at all tested bit rates. A mean opinion score (MOS) test was also applied. The testers were three independent expert cardiologists. As in the quantitative test, the proposed compression algorithm was found to be superior to the other tested compression algorithms.     

Design and implementation of a new efficient median filteringalgorithm

A new bit-level algorithm for median-type filters, based on the concept of majority, and a new hardware implementation suitable for VLSI implementation are introduced. The proposed structure has an area complexity of O(N(N+w)) and a time complexity of O(w). Compared with other existing algorithms, the new algorithm exhibits reduced hardware requirements and better processing speed. In addition, a new application of median filtering in electrocardiograms (EGG) is presented. The new method uses the concept of median filtering to restore the baseline of an ECG signal, which is, in most cases, unstable due to artifacts, e.g. a patient's movement or breathing     

An Efficient Algorithm for Computing the Reliability of Consecutive-$k$-Out-Of-$n$:F Systems

Many algorithms for computing the reliability of linear or circular consecutive-k-out-of-n:F systems appeared in this Transactions. The best complexity estimate obtained for solving this problem is O(k³ log(n/k)) operations in the case of i.i.d. components. Using fast algorithms for computing a selected term of a linear recurrence with constant coefficients, we provide an algorithm having arithmetic complexity O(k log (k) log(log(k)) log(n)+k^omega) where 2相似文献   

Faster Algorithms for Construction of Recovery Trees Enhancing QoP and QoS

Medard et al. proposed an elegant recovery scheme (known as the MFBG scheme) using red/blue recovery trees for multicast path protection against single link or node failures. Xue et al. extended the MFBG scheme and introduced the concept of quality of protection (QoP) as a metric for multifailure recovery capabilities of single failure recovery schemes. They also presented polynomial time algorithms to construct recovery trees with good QoP and quality of service (QoS). In this paper, we present faster algorithms for constructing recovery trees with good QoP and QoS performance. For QoP enhancement, our O(n + m) time algorithm has comparable performance with the previously best O(n²(n + m)) time algorithm, where n and m denote the number of nodes and the number of links in the network, respectively. For cost reduction, our O(n + m) time algorithms have comparable performance with the previously best O(n²(n + m)) time algorithms. For bottleneck bandwidth maximization, our O(m log n) time algorithms improve the previously best O(nm) time algorithms. Simulation results show that our algorithms significantly outperform previously known algorithms in terms of running time, with comparable QoP or QoS performance.     

Nonlinear transforms of ECG signals for digital QRS detection: aquantitative analysis

A class of algorithms has been developed which detects QRS complexes in the electrocardiogram (ECG). The algorithms employ nonlinear transforms derived from multiplication of backward differences (MOBD). The algorithms are evaluated with the American Heart Association ECG database, and comparisons are made with the algorithms reported by Okada (1979) and by Hamilton and Tompkins (1986). The MOBD algorithms provide a good performance tradeoff between accuracy and response time, making this type of algorithm desirable for real-time microprocessor-based implementation     

Fitted Elmore delay: a simple and accurate interconnect delay model

In this brief, we present a new interconnect delay model called fitted Elmore delay (FED). FED is generated by approximating HSPICE delay data using a curve fitting technique. The functional form used in curve fitting is derived based on the Elmore delay (ED) model. Thus, our model has all the advantages of the ED model. It has a closed-form expression as simple as the ED model and is extremely efficient to compute. Interconnect optimization with respect to design parameters can also be done as easily as in the ED model. In fact, most previous algorithms and programs based on ED model can use our model without much change. Most importantly, FED is significantly more accurate than the ED model. The maximum error in delay estimation is at most 2% for our model, compared to 8.5% for the scaled ED model. The average error is less than 0.8%. We also show that FED can be more than 10 times more accurate than the ED model when applied to wire sizing.     

Removal of CPR artifacts from the ventricular fibrillation ECG by adaptive regression on lagged reference signals

BACKGROUND AND OBJECTIVE: Removing cardiopulmonary resuscitation (CPR)-related artifacts from human ventricular fibrillation (VF) electrocardiogram (ECG) signals provides the possibility to continuously detect rhythm changes and estimate the probability of defibrillation success. This could reduce "hands-off" analysis times which diminish the cardiac perfusion and deteriorate the chance for successful defibrillations. METHODS AND RESULTS: Our approach consists in estimating the CPR part of a corrupted signal by adaptive regression on lagged copies of a reference signal which correlate with the CPR artifact signal. The algorithm is based on a state-space model and the corresponding Kalman recursions. It allows for stochastically changing regression coefficients. The residuals of the Kalman estimation can be identified with the CPR-filtered ECG signal. In comparison with ordinary least-squares regression, the proposed algorithm shows, for low signal-to-noise ratio (SNR) corrupted signals, better SNR improvements and yields better estimates of the mean frequency and mean amplitude of the true VF ECG signal. CONCLUSIONS: The preliminary results from a small pool of human VF and animal asystole CPR data are slightly better than the results of comparable previous studies which, however, not only used different algorithms but also different data pools. The algorithm carries the possibility of further optimization.