Tissue characterization in intravascular ultrasound images

Intravascular ultrasound (IVUS) imaging permits direct visualization of vascular pathology. It has been used to evaluate lumen and plaque in coronary arteries and its clinical significance for guidance of coronary interventions is increasingly recognized. Conventional manual evaluation is tedious and time-consuming. This paper describes a highly automated approach to segmentation of coronary wall and plaque, and determination of plaque composition in individual IVUS images and pullback image sequences. The determined regions of plaque were classified in one of three classes: soft plaque, hard plaque, or hard plaque shadow. The method's performance was assessed in vitro and in vivo in comparison with observer-defined independent standards. In the analyzed images and image sequences, the mean border positioning error of the wall and plaque borders ranged from 0.13-0.17 mm. Plaque classification correctness was 90%.     

Ghost cancellation algorithms for MRI images

Ghost cancellation algorithms for restoring magnetic resonance imaging (MRI) images in medical applications are described. The approach is to model the effect of the time delays and the asymmetry of the sinusoidal readout gradient for even and odd lines with two phase functions relating the actual object density to even and odd parts of the observed image. A priori information about the phase functions is exploited in order to estimate the true object density. Examples of applying this ghost cancellation approach to liver and heart images is presented.     

ROC analysis of ultrasound tissue characterization classifiers for breast cancer diagnosis

Breast cancer diagnosis through ultrasound tissue characterization was studied using receiver operating characteristic (ROC) analysis of combinations of acoustic features, patient age, and radiological findings. A feature fusion method was devised that operates even if only partial diagnostic data are available. The ROC methodology uses ordinal dominance theory and bootstrap resampling to evaluate A(z) and confidence intervals in simple as well as paired data analyses. The combined diagnostic feature had an A(z) of 0.96 with a confidence interval of at a significance level of 0.05. The combined features show statistically significant improvement over prebiopsy radiological findings. These results indicate that ultrasound tissue characterization, in combination with patient record and clinical findings, may greatly reduce the need to perform biopsies of benign breast lesions.     

Median-based robust algorithms for tracing neurons from noisy confocal microscope images

This paper presents a method to exploit rank statistics to improve fully automatic tracing of neurons from noisy digital confocal microscope images. Previously proposed exploratory tracing (vectorization) algorithms work by recursively following the neuronal topology, guided by responses of multiple directional correlation kernels. These algorithms were found to fail when the data was of lower quality (noisier, less contrast, weak signal, or more discontinuous structures). This type of data is commonly encountered in the study of neuronal growth on microfabricated surfaces. We show that by partitioning the correlation kernels in the tracing algorithm into multiple subkernels, and using the median of their responses as the guiding criterion improves the tracing precision from 41% to 89% for low-quality data, with a 5% improvement in recall. Improved handling was observed for artifacts such as discontinuities and/or hollowness of structures. The new algorithms require slightly higher amounts of computation, but are still acceptably fast, typically consuming less than 2 seconds on a personal computer (Pentium III, 500 MHz, 128 MB). They produce labeling for all somas present in the field, and a graph-theoretic representation of all dendritic/axonal structures that can be edited. Topological and size measurements such as area, length, and tortuosity are derived readily. The efficiency, accuracy, and fully-automated nature of the proposed method makes it attractive for large-scale applications such as high-throughput assays in the pharmaceutical industry, and study of neuron growth on nano/micro-fabricated structures. A careful quantitative validation of the proposed algorithms is provided against manually derived tracing, using a performance measure that combines the precision and recall metrics.     

Evaluation of three-dimensional segmentation algorithms for the identification of luminal and medial-adventitial borders in intravascular ultrasound images

Intravascular ultrasound (IVUS) provides direct depiction of coronary artery anatomy, including plaque and vessel area, which is important in quantitative studies on the progression or regression of coronary artery disease. Traditionally, these studies have relied on manual evaluation, which is laborious, time consuming, and subject to large interobserver and intraobserver variability. A new technique, called active surface segmentation, alleviates these limitations and makes strides toward routine analyses. However, for three-dimensional (3-D) plaque assessment or 3-D reconstruction to become a clinical reality, methods must be developed which can analyze many images quickly. Presented is a comparison between two active surface techniques for three-dimensional segmentation of luminal and medial-adventitial borders. The force-acceleration technique and the neighborhood-search technique accurately detected both borders in vivo (r2 = 0.95 and 0.99, Williams' index = 0.67 and 0.65, and r2 = 0.95 and 0.99, WI = 0.67 and 0.70, respectively). However, the neighborhood-search technique was significantly faster and required less computation. Volume calculations for both techniques (r2 = 0.99 and r2 = 0.99) also agreed with a known-volume phantom. Active surface segmentation allows 3-D assessment of coronary morphology and further developments with this technology will provide clinical analysis tools.     

Comparison of algorithms for combining X-ray angiography images

Using a one-dimensional convective-dispersive model of contrast agent flow in a blood vessel, we optimized and compared algorithms for combining a temporal sequence of X-ray angiography images, each with incomplete arterial filling, into a single-output image with fully opacified arteries. The four algorithms were: maximum opacity (MO) with a maximum over time at each spatial location; matched filtering (MAT); recursive filtering (REC) with a maximum opacity; and an approximate matched filter (AMF) consisting of a correlation with a kernel that approximates the matched filter kernel followed by a maximum opacity operation. Based on the contrast-to-noise ratio (CNR), MAT is theoretically the best algorithm. However, with spatially varying clinical images, a poorly matched MAT kernel greatly degraded CNR to the point of even inverting artery contrast. The practical AMF method maintained uniform CNR values over the entire field of view and gave >90% of the theoretical limit set by MAT. REC and MO created fully opacified arteries, but provided little CNR enhancement. By holding CNR at a nominal reference value, simulations predicted that AMF could be used with a contrast agent volume reduced by as much as 66%. Alternatively, X-ray exposure rate could be lowered. Although MO and REC are more easily implemented, the contrast enhancement with AMF makes it attractive for processing diagnostic angiography images acquired with a reduced contrast agent dose.     

Multiplication-free approximate algorithms for compressed-domainlinear operations on images

We propose a method for devising approximate multiplication-free algorithms for compressed-domain linear operations on images, e.g., downsampling, translation, filtering, etc. We demonstrate that the approximate algorithms give output images that are perceptually nearly equivalent to those of the exact processing, while the computational complexity is significantly reduced.     

场景统计类红外图像非均匀性校正算法研究

场景统计类非均匀性校正算法对场景分布进行假定,获得探测单元接收红外能量的一、二阶矩,进而估计探测单元的响应参数,校正非均匀性。分析比较了现有的场景统计类非均匀性校正算法,并应用交互多模(IMM)算法校正非均匀性,实验结果表明以连续图像序列作为观测数据时,能够有效地校正非均匀性,扩展了卡尔曼滤波法的适用范围。对各种方法进行仿真,表明删算法具有较好的收敛特性。     

A novel algorithm for computer-assisted measurement of cervical length from transvaginal ultrasound images

The cervical length measured by transvaginal ultrasound is a proven clinical tool for predicting premature birth. The standard manual measurement of the cervix is limited by variability in the technique. In this research, we develop the first computer algorithm that is able to identify the anatomic landmarks of the cervix on a transvaginal ultrasound image and determine the standard cervical length. The system is composed of four stages: The first stage is adaptive speckle suppression using variable length sticks algorithm. The second stage is the location of the internal cervical opening or "os" using a region-based segmentation. The third stage is delineation of the cervical canal. The fourth stage uses gray level summation patterns and prior knowledge to first localize the tissue boundary of the external cervix, and then use a template to determine the specific location of the external os. The cervical length is determined and calculated to image scale. To validate the proposed algorithm, 101 cervical ultrasound images were selected from a series of 37 examinations performed on 17 patients over an eight-month period. Repeated measurements of cervical length using the computer-assisted method were compared with those carried out by two experienced sonographers. The median intraobserver variability for the 101 images using the computer-assisted method was significantly smaller than that of the manual method by either sonographer. In a pairwise comparison, the mean cervical length for the computer method matches with the mean manual cervical length.     

Rayleigh-maximum-likelihood filtering for speckle reduction of ultrasound images

Speckle is a multiplicative noise that degrades ultrasound images. Recent advancements in ultrasound instrumentation and portable ultrasound devices necessitate the need for more robust despeckling techniques, for both routine clinical practice and teleconsultation. Methods previously proposed for speckle reduction suffer from two major limitations: 1) noise attenuation is not sufficient, especially in the smooth and background areas; 2) existing methods do not sufficiently preserve or enhance edges--they only inhibit smoothing near edges. In this paper, we propose a novel technique that is capable of reducing the speckle more effectively than previous methods and jointly enhancing the edge information, rather than just inhibiting smoothing. The proposed method utilizes the Rayleigh distribution to model the speckle and adopts the robust maximum-likelihood estimation approach. The resulting estimator is statistically analyzed through first and second moment derivations. A tuning parameter that naturally evolves in the estimation equation is analyzed, and an adaptive method utilizing the instantaneous coefficient of variation is proposed to adjust this parameter. To further tailor performance, a weighted version of the proposed estimator is introduced to exploit varying statistics of input samples. Finally, the proposed method is evaluated and compared to well-accepted methods through simulations utilizing synthetic and real ultrasound data.     

Generation of synthetic-focus images from pulse-echo ultrasound using difference equations

To produce a complete-dataset, pulse-echo image requires a knowledge of the time of flight (TOF) from each source to each sensor in the transducer array for each site to be imaged. Increasing the speed of TOF calculation is important in adaptive-focus schemes. The authors determined TOF more rapidly than via direct calculation by representing TOF surfaces by two-dimensional (2-D), positive-integer-degree polynomials implemented in their forward-difference form. Errors which accumulate due to the use of a difference equation depend on the degree of the polynomial and on the size of the image. The number of bits needed to address echo samples in backscatter memory and the allowable error define the minimum precision needed for accurate values of TOF, Accurate calculation of TOF, expressed as 10-b addresses in backscatter memory, for each pixel in a 512x512 image with a second-degree difference equation requires 44 b of precision, Using the complete dataset from a 32-element array and a second-degree approximation to TOF on a typical graphics workstation reduced generation time of a 512x512 image from 702 to 239 s. Parallel formulation of both the TOF calculation and the retrieval and summation of echo samples resulted in significant further reduction in image-generation time. Parallel implementation on a SIMD array with 4096 processors, each of which had an indirect-addressing mode, allowed the generation of a 512x512 image in 16.3 s.     

面向图像的绝缘子自爆缺陷检测算法综述

绝缘子自爆缺陷检测对于保障输电线路的安全具有十分重要的作用,准确快速检测算法能够帮助运维人员快速定位自爆缺陷绝缘子的位置,并及时更换.传统的人工检测方法已无法满足检测的要求,面向图像的绝缘子自爆缺陷检测算法在其检测的准确性和快速性上仍面临着极大挑战,必须进一步对算法进行改进.本文首先介绍了绝缘子自爆缺陷图像的预处理过程...     

无人机视频图像运动目标检测算法综述

运动目标检测是实现目标跟踪、交通监控、行为分析等任务的基础。但在无人机获取的视频图像中,无人机运动、旋翼震动或外界风力等客观因素使图像出现较为明显的背景、光照等变化,会对运动目标的检测产生影响。因此,如何降低干扰、提高检测精度,让无人机在运动目标检测领域发挥作用在信息时代具有相当重要的意义。无人机视频图像的运动目标检测相比传统运动目标检测,检测思路基本一致,但干扰因素众多。本文以此为切入点,分类综述了适用于无人机视频图像运动目标检测的算法及其改进,主要包括运动估计算法、帧间差法、背景建模法、光流法等传统算法和近年出现的新型算法;通过对无人机运动状态的划分探讨比较了上述方法的优缺点及适用场景。帧间差法更适合处理无人机悬停状态的数据,背景建模法、光流法及新型算法对无人机悬停及巡航状态的数据均可处理;上述算法均不能很好解决光照变化造成误检、漏检现象。所以处理无人机视频数据时,要根据其运动信息及数据特点选择合适的算法,才能获得好的检测结果。     

A methodology for evaluation of boundary detection algorithms onmedical images

Image segmentation is the partition of an image into a set of nonoverlapping regions whose union is the entire image. The image is decomposed into meaningful parts which are uniform with respect to certain characteristics, such as gray level or texture. In this paper, we propose a methodology for evaluating medical image segmentation algorithms wherein the only information available is boundaries outlined by multiple expert observers. In this case, the results of the segmentation algorithm can be evaluated against the multiple observers' outlines. We have derived statistics to enable us to find whether the computer-generated boundaries agree with the observers' hand-outlined boundaries as much as the different observers agree with each other. We illustrate the use of this methodology by evaluating image segmentation algorithms on two different applications in ultrasound imaging. In the first application, we attempt to find the epicardial and endocardial boundaries from cardiac ultrasound images, and in the second application, our goal is to find the fetal skull and abdomen boundaries from prenatal ultrasound images     

2-D locally regularized tissue strain estimation from radio-frequency ultrasound images: theoretical developments and results on experimental data

In this paper, a 2-D locally regularized strain estimation method for imaging deformation of soft biological tissues from radio-frequency (RF) ultrasound (US) data is introduced. Contrary to most 2-D techniques that model the compression-induced local displacement as a 2-D shift, our algorithm also considers a local scaling factor in the axial direction. This direction-dependent model of tissue motion and deformation is induced by the highly anisotropic resolution of RF US images. Optimal parameters are computed through the constrained maximization of a similarity criterion defined as the normalized correlation coefficient. Its value at the solution is then used as an indicator of estimation reliability, the probability of correct estimation increasing with the correlation value. In case of correlation loss, the estimation integrates an additional constraint, imposing local continuity within displacement and strain fields. Using local scaling factors and regularization increase the method's robustness with regard to decorrelation noise, resulting in a wider range of precise measurements. Results on simulated US data from a mechanically homogeneous medium subjected to successive uniaxial loadings demonstrate that our method is theoretically able to accurately estimate strains up to 17%. Experimental strain images of phantom and cut specimens of bovine liver clearly show the harder inclusions.     

Segmentation of prostate boundaries from ultrasound images using statistical shape model

This paper presents a statistical shape model for the automatic prostate segmentation in transrectal ultrasound images. A Gabor filter bank is first used to characterize the prostate boundaries in ultrasound images in both multiple scales and multiple orientations. The Gabor features are further reconstructed to be invariant to the rotation of the ultrasound probe and incorporated in the prostate model as image attributes for guiding the deformable segmentation. A hierarchical deformation strategy is then employed, in which the model adaptively focuses on the similarity of different Gabor features at different deformation stages using a multiresolution technique, i.e., coarse features first and fine features later. A number of successful experiments validate the algorithm.     

Estimating the keratoconus index from ultrasound images of the human cornea

The keratoconus index (KI) is a new biometric parameter to make diagnosis and to follow the development of the keratoconus in human eyes. Using images from an ultrasound biomicroscope, we show a semi-automatic method to speed up the computation of the KI.     

Assessment of diffuse coronary artery disease by quantitative analysis of coronary morphology based upon 3-D reconstruction from biplane angiograms

Quantitative evaluations on coronary vessel systems are of increasing importance in cardiovascular diagnosis, therapy planning, and surgical verification. Whereas local evaluations, such as stenosis analysis, are already available with sufficient accuracy, global evaluations of vessel segments or vessel subsystems are not yet common. Especially for the diagnosis of diffuse coronary artery diseases, the authors combined a 3D reconstruction system operating on biplane angiograms with a length/volume calculation. The 3D reconstruction results in a 3D model of the coronary vessel system, consisting of the vessel skeleton and a discrete number of contours. To obtain an utmost accurate model, the authors focussed on exact geometry determination. Several algorithms for calculating missing geometric parameters and correcting remaining geometry errors were implemented and verified. The length/volume evaluation can be performed either on single vessel segments, on a set of segments, or on subtrees. A volume model based on generalized elliptical conic sections is created for the selected segments. Volumes and lengths (measured along the vessel course) of those elements are summed up. In this way, the morphological parameters of a vessel subsystem can be set in relation to the parameters of the proximal segment supplying it. These relations allow objective assessments of diffuse coronary artery diseases.     

Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images.

This paper presents novel coding algorithms based on tree-structured segmentation, which achieve the correct asymptotic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise polynomials, by using an R-D based prune and join scheme. For the one-dimensional case, our scheme is based on binary-tree segmentation of the signal. This scheme approximates the signal segments using polynomial models and utilizes an R-D optimal bit allocation strategy among the different signal segments. The scheme further encodes similar neighbors jointly to achieve the correct exponentially decaying R-D behavior (D(R) - c(o)2(-c1R)), thus improving over classic wavelet schemes. We also prove that the computational complexity of the scheme is of O(N log N). We then show the extension of this scheme to the two-dimensional case using a quadtree. This quadtree-coding scheme also achieves an exponentially decaying R-D behavior, for the polygonal image model composed of a white polygon-shaped object against a uniform black background, with low computational cost of O(N log N). Again, the key is an R-D optimized prune and join strategy. Finally, we conclude with numerical results, which show that the proposed quadtree-coding scheme outperforms JPEG2000 by about 1 dB for real images, like cameraman, at low rates of around 0.15 bpp.