Automated extraction of serial myocardial borders from M-mode echocardiograms

A method is presented for the automated extraction of myocardial borders in M-mode echocardiograms. The successive steps of processing are: preprocessing for noise reduction, enhancement of border characteristics using a set of suitably chosen matched filters, and final extraction of border points by searching for optimal paths along the time axis. During the last step of processing, the contribution of each elementary border element is characterised by a normalized correlation coefficient. The optimal path, defined as the one that maximizes the sum of all elementary contributions, is determined efficiently using dynamic programming. An alternative approach uses a maximum tracking procedure whose performances are improved by utilizing a local model to predict the position of the next border point. Experimental examples are presented and the performance of both border extraction algorithms are compared.     

Matched filter identification of left-ventricular endocardial borders in transesophageal echocardiograms

The use of one-dimensional spatial matched filtering for identifying the left ventricular endocardial borders in human transesophageal echocardiograms recorded during surgery is investigated. A maximum-likelihood method was used to choose the endocardial intensity profiles centered within the ventricle. The computer-generated border points were compared to those identified by an experienced ultrasonographer. A 16-pixel step template located 63.2% of the border points within 2 mm of the manual border. Median prefiltering of the images reduced detection accuracy by 3% to 6%. No statistically significant difference in accuracy was found between longer and shorter templates or between data-derived and step templates. Compared to manual estimates, computer generated cross-sectional area determinations were correlated with a coefficient of 0.93. Matched filtering executes rapidly, does not require prefiltering, and performs as well as other reported methods in estimating ventricular area.     

Statistical probability based algorithm for extracting feature points in 2-dimensional image

An algorithm for automatically extracting feature points is developed after the area of feature points in 2-dimensional (2D) image being located by probability theory, correlated methods and criterion for abnormity. Feature points in 2D image can be extracted only by calculating standard deviation of gray within sampled pixels area in our approach statically. While extracting feature points, the limitation to confirm threshold by tentative method according to some a priori information on processing image can be avoided. It is proved that the proposed algorithm is valid and reliable by extracting feature points on actual natural images with abundant and weak texture, including multi-object with complex background, respectively. It can meet the demand of extracting feature points of 2D image automatically in machine vision system.     

一种从低分辨率图像序列获取高分辨率图像的算法

在某些应用领域,常常需要得到目标的高分辨率图像,考虑到在这些应用场合中,往往可以获得对同一景物或目标的多帧图像,本文提出了一种基于亚像素级图像配准与类似于中值滤波插值的从多幅低分辨率(LR)图像中获取一幅高分辨率(HR)图像的算法。算法首先采用梯度方法计算出LR图像之间的位移量,经过图像配准后,每个HR像素点被赋予其作用域内所有LR像点值的中值。仿真结果表明,该算法简单有效,既能提高图像分辨率,又能较好地去除非线性噪声。     

A power-efficient 2-dimensional on-chip eye-opening monitor for Gbps serial links

This paper investigates the drawbacks of widely used rectangular eye-opening monitors (EOMs) and proposes a new power-efficient half hexagon EOM for Gbps serial links. The proposed EOM outperforms rectangular EOMs by providing a better control of data jitter at the edge of data eyes and by eliminating unnecessary errors flagged by rectangular EOMs. The effectiveness of the proposed EOM is evaluated using a serial link implemented in IBM 130 nm 1.2 V CMOS technology. For purpose of comparison, rectangular EOMs with the same data link are also designed and evaluated. The data links are analyzed using Spectre from Cadence Design Systems with BSIM 4 device models. Simulation results demonstrate that the proposed EOM provides a better detection of the violation of the minimum eye-opening mask over temperature range ?20 to 80 °C and at all process corners as compared with rectangular EOM, with 50 % reduction in power and silicon consumption.     

Practical 2-dimensional bipolar-transistor-analysis algorithm

Extensions to a 2-dimensional bipolar-transistor-modelling algorithm are described. They enable practical high-frequency silicon devices to be analysed in a time appreciably shorter than previously reported schemes. This allows device properties to be economically explored over a wide range of bias currents and voltages.     

Comparison of numerical-solution methods for 2-dimensional bipolar-transistor-analysis algorithm

Numerical methods of solution to linear equations are dicussed with reference to a bipolar-transistor model. Results are presented that show the advantages of using a strongly implicit procedure (s.i.p.). A new technique for applying iteration parametrers to s.i.p. is proposed. This method is compared with both direct and other iterative methods.     

一种高效的基音估计算法

分析已有的一些基音估计算法,对比其优缺点,提出一种可大大提高计算速度的高效基音估计算法.该算法是利用平均幅度差(MAMDF)法提取若干个可能峰值点,再利用计算精度较高的循环平均幅度差(CAMDF)法对这几个点进行验证,选取数值最小的点作为基音周期.由于只对几个点求CAMDF函数,因此运算量大大减小.     

高性能空时二维角度估计改进算法

干扰角度估计是数字阵列雷达抗干扰的基础,本文针对实际数字阵列天线阵元间距大于半波长导致大角度估计时阵元相位出现模糊问题,提出一种新的基于时空DOA矩阵的多目标高性能二维角度估计算法。该算法首先计算时空DOA矩阵并进行特征值分解,接着利用空时矩阵特征向量与来波导向矢量匹配特性,对估计得到的各导向矢量分别进行相位解模糊,进而利用导向矢量联立方程组,得到各来波角度信息的最小二乘解。相位解模糊过程主要通过计算多组模糊解对应的导向矢量与实际估计得到的导向矢量的相关性,选取相关值最大的一组模糊解作为真实解来实现。仿真与数字阵列天线实测结果表明,与时空DOA矩阵法相比,本文算法具有更高的测角精度和更加稳健的输出性能。      

一种并行磁共振成像伪影消除方法

多线圈采集技术与并行成像算法通过降低磁共振成像所必需的梯度编码步数有效提高了成像的扫描速度.但是在数据采集过程中,运动常常会使线圈数据发生异常,从而对最终重建图像质量产生很大影响.本文提出了一种新的重建算法去消除重建图像中产生的伪影.算法把破坏数据看成观测数据样本中的异常值,应用了AM鲁棒估计进行数据修正,很好的抑制了异常值对数据集造成的影响.本研究分别对多线圈并行采集的体模数据与真实脑部数据进行了实验,结果显示算法可以有效消除破坏数据在重建图像中产生的伪影,并通过对比实验充分显示了本算法的优越性.     

一种快速有效的自适应算术编码

介绍了算术编码的原理和基于模型的自适应算术编码算法，并利用二进制索引树这样一个高效率的数据结构对传统的0阶自适应算术编码进行了改进。实验表明，无论对于高度集中的数据集还是对于分布较为均匀的数据集，在运行时间上新算法都有较大的改进。     

局部自适应序列图像拼接算法

在数字摄影测量等应用中需要对航空拍摄的序列图像数据进行拼接才能得到对应地面的全景图像。讨论了帧与帧之间存在相对旋转或几何畸变的情况下,用多帧图像进行拼接产生地面全景图的方法。该方法在相邻帧图像之间采用基于控制点的局部自适应方法进行定位,再采用淡入淡出的方法进行拼接和数据融合,重建地面全场景图像。实验结果表明本方法能够有效地解决图像拼接中帧间旋转或几何畸变问题,并避免了图像的平滑失真。     

LDPC码串行解码算法建模

消息传递机制是影响LDPC码解码性能的重要因素。简要介绍了Gallager提出的LDPC码和基于洪水消息传递机制的和积解码算法。在此基础上引入基于校验节点的串行消息传递机制并提出具体可实现的解码算法模型。该串行解码算法按照校验节点一定的顺序进行消息处理和传递,保证更新的消息能够马上进入迭代过程,从而改善消息传递的收敛特性;同时充分利用消息间相互关联的特点,融合消息传递步骤,可以降低所需的存储容量,简化解码复杂度。分别应用洪水解码算法和串行解码算法在AWGN信道下进行性能仿真。仿真结果表明串行解码算法使解码性能得到明显提高。     

Transition from 2-dimensional line analysis to 1-dimensional model

The transition from 2-dimensional line analysis to the 1-dimensional model is examined on the basis of a suitable series expansion of the voltage equation. It is shown that 1-dimensional equations can be derived from a 2-dimensional analysis with proper approximations for certain operators. A consistence procedure is outlined and applied to an exponential taper.     

一种有效的自适应语音降噪算法及实现

提出了一种改进的基于离散Hartley变换(DHT)自适应滤波算法(DHT—LMS)，将其应用于电话通信噪声抵消系统，并进行了实验研究，其结果表明，将该算法应用于自适应语音降噪系统，能获得较好的降噪效果，且基于信号处理器TMS320LF2407上开发实现简单，系统结构紧凑、可靠性高。     

New serial architecture for the Berlekamp-Massey algorithm

We propose a new efficient serial architecture to implement the Berlekamp-Massey (1968, 1969) algorithm, which is frequently used in BCH and Reed-Solomon (1960) decoders. An inversionless Berlekamp-Massey algorithm is adopted which not only eliminates the finite-field inverter but also introduces additional parallelism. We discover a clever scheduling of three finite-field multipliers to implement the algorithm very efficiently. Compared to a previously proposed serial Berlekamp-Massey architecture, our technique significantly reduces the latency     

一种修正平面近场测量中探头位置误差的有效算法

该文提出了一种修正平面近场测量中探头位置误差的算法,并进行了计算机模拟。计算结果表明,所提出的修正算法收敛速度快、数值稳定性好、计算精度高,是一种实用而有效的修正平面近场测量中探头位置误差的方法。     

An effective and efficient compression algorithm for ECG signals with irregular periods

This paper presents an effective and efficient preprocessing algorithm for two-dimensional (2-D) electrocardiogram (ECG) compression to better compress irregular ECG signals by exploiting their inter- and intra-beat correlations. To better reveal the correlation structure, we first convert the ECG signal into a proper 2-D representation, or image. This involves a few steps including QRS detection and alignment, period sorting, and length equalization. The resulting 2-D ECG representation is then ready to be compressed by an appropriate image compression algorithm. We choose the state-of-the-art JPEG2000 for its high efficiency and flexibility. In this way, the proposed algorithm is shown to outperform some existing arts in the literature by simultaneously achieving high compression ratio (CR), low percent root mean squared difference (PRD), low maximum error (MaxErr), and low standard derivation of errors (StdErr). In particular, because the proposed period sorting method rearranges the detected heartbeats into a smoother image that is easier to compress, this algorithm is insensitive to irregular ECG periods. Thus either the irregular ECG signals or the QRS false-detection cases can be better compressed. This is a significant improvement over existing 2-D ECG compression methods. Moreover, this algorithm is not tied exclusively to JPEG2000. It can also be combined with other 2-D preprocessing methods or appropriate codecs to enhance the compression performance in irregular ECG cases.     

A new method for extracting the effective channel length of MOSFETs

A new and simple method to extract the effective channel length L_eff of metal-oxide superconductor field effect transistor (MOSFET)s is presented. The method, which is developed based on an auxiliary integral function, has the advantage of determining the value of L_eff not influenced by the series resistances of the MOSFET. The method is tested in the environments of device simulation and measurements. In addition, comparison is made between the results obtained from the present method and a widely used L_eff extraction method.     

Improved formulation of Gummel's algorithm for solving the 2-dimensional current-flow equations in semiconductor devices

By a transformation of variables, the equations of Gummel's algorithm achieve a form which avoids the recurrent calculation of exponentials that usually characterises the method. The transformation results in tractable equations and a reduction in computational labour compared with previous methods.