PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Clustering Algorithms”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,153 records · Page 64Linked to original sources
PubMed1998

Tissue viability by multispectral near infrared imaging: a fuzzy C-means clustering analysis.

Clinically, skin color, temperature, and capillary perfusion are used to assess tissue viability following microvascular tissue transfer. However, clinical signs that arise as a consequence of poor perfusion become evident only after several hours of compromised perfusion. This study demonstrates the potential usefulness of optical/infrared multispectral imaging in the prognosis of tissue viability immediately post-surgery. Multispectral images of a skin flap model acquired within 1 h of surgical elevation are analyzed in comparison to the final 72-h clinical outcome with a high degree of correlation. Regional changes in tissue perfusion and oxygenation present immediately following surgery are differentiated using fuzzy clustering and image processing algorithms. These methodologies reduce the intersubject variability inherent in infrared imaging methods such that the changes in perfusion are reproducible and clearly distinguishable across all subjects. Clinically, an early prognostic indicator of viability such as this would allow for a more timely intervention following surgery in the event of compromised microvasculature.

Algorithms↗
PubMed2002

Exploratory analysis of the spatio-temporal deformation of the myocardium during systole from tagged MRI.

Myocardial contractile function is, with perfusion, one of the main affected factors in ischemic heart diseases. In this paper, we propose an original framework based on functional data analysis for the quantitative study of spatio-temporal parameters related to the myocardial contraction mechanics. The mechanical strains in the left-ventricular (LV) myocardium are computed from tagged magnetic resonance imaging cardiac sequences. A statistical functional model of the normal contractile function of the LV is build from the study of eight examinations on healthy subjects. We show that it is possible to detect abnormal strain patterns comparatively to this model, by generating distance maps at rest and under pharmacological stress. We demonstrate the consistency of the results for the circumferential deformation parameter on healthy and pathological data sets.

Algorithms↗
PubMed2004

Automatic detection of voice impairments by means of short-term cepstral parameters and neural network based detectors.

It is well known that vocal and voice diseases do not necessarily cause perceptible changes in the acoustic voice signal. Acoustic analysis is a useful tool to diagnose voice diseases being a complementary technique to other methods based on direct observation of the vocal folds by laryngoscopy. Through the present paper two neural-network based classification approaches applied to the automatic detection of voice disorders will be studied. Structures studied are multilayer perceptron and learning vector quantization fed using short-term vectors calculated accordingly to the well-known Mel Frequency Coefficient cepstral parameterization. The paper shows that these architectures allow the detection of voice disorders--including glottic cancer--under highly reliable conditions. Within this context, the Learning Vector quantization methodology demonstrated to be more reliable than the multilayer perceptron architecture yielding 96% frame accuracy under similar working conditions.

Algorithms↗
PubMed2004

The Goodman-Kruskal coefficient and its applications in genetic diagnosis of cancer.

Increasing interest in new pattern recognition methods has been motivated by bioinformatics research. The analysis of gene expression data originated from microarrays constitutes an important application area for classification algorithms and illustrates the need for identifying important predictors. We show that the Goodman-Kruskal coefficient can be used for constructing minimal classifiers for tabular data, and we give an algorithm that can construct such classifiers.

Algorithms↗
PubMedDate not supplied

Biclustering models for structured microarray data.

Microarrays have become a standard tool for investigating gene function and more complex microarray experiments are increasingly being conducted. For example, an experiment may involve samples from several groups or may investigate changes in gene expression over time for several subjects, leading to large three-way data sets. In response to this increase in data complexity, we propose some extensions to the plaid model, a biclustering method developed for the analysis of gene expression data. This model-based method lends itself to the incorporation of any additional structure such as external grouping or repeated measures. We describe how the extended models may be fitted and illustrate their use on real data.

Algorithms↗
PubMed2004

Power optimization of wireless media systems with space-time block codes.

We present analytical and numerical solutions to the problem of power control in wireless media systems with multiple antennas. We formulate a set of optimization problems aimed at minimizing total power consumption of wireless media systems subject to a given level of QoS and an available bit rate. Our formulation takes into consideration the power consumption related to source coding, channel coding, and transmission of multiple-transmit antennas. In our study, we consider Gauss-Markov and video source models, Rayleigh fading channels along with the Bernoulli/Gilbert-Elliott loss models, and space-time block codes.

Algorithms↗
PubMed2004

Efficient energies and algorithms for parametric snakes.

Parametric active contour models are one of the preferred approaches for image segmentation because of their computational efficiency and simplicity. However, they have a few drawbacks which limit their performance. In this paper, we identify some of these problems and propose efficient solutions to get around them. The widely-used gradient magnitude-based energy is parameter dependent; its use will negatively affect the parametrization of the curve and, consequently, its stiffness. Hence, we introduce a new edge-based energy that is independent of the parameterization. It is also more robust since it takes into account the gradient direction as well. We express this energy term as a surface integral, thus unifying it naturally with the region-based schemes. The unified framework enables the user to tune the image energy to the application at hand. We show that parametric snakes can guarantee low curvature curves, but only if they are described in the curvilinear abscissa. Since normal curve evolution do not ensure constant arc-length, we propose a new internal energy term that will force this configuration. The curve evolution can sometimes give rise to closed loops in the contour, which will adversely interfere with the optimization algorithm. We propose a curve evolution scheme that prevents this condition.

Algorithms↗
PubMed2004

Noise removal using smoothed normals and surface fitting.

In this work, we use partial differential equation techniques to remove noise from digital images. The removal is done in two steps. We first use a total-variation filter to smooth the normal vectors of the level curves of a noise image. After this, we try to find a surface to fit the smoothed normal vectors. For each of these two stages, the problem is reduced to a nonlinear partial differential equation. Finite difference schemes are used to solve these equations. A broad range of numerical examples are given in the paper.

Algorithms↗
PubMed2005

Pixelwise-adaptive blind optical flow assuming nonstationary statistics.

In this paper, we address some of the major issues in optical flow within a new framework assuming nonstationary statistics for the motion field and for the errors. Problems addressed include the preservation of discontinuities, model/data errors, outliers, confidence measures, and performance evaluation. In solving these problems, we assume that the statistics of the motion field and the errors are not only spatially varying, but also unknown. We, thus, derive a blind adaptive technique based on generalized cross validation for estimating an independent regularization parameter for each pixel. Our formulation is pixelwise and combines existing first- and second-order constraints with a new second-order temporal constraint. We derive a new confidence measure for an adaptive rejection of erroneous and outlying motion vectors, and compare our results to other techniques in the literature. A new performance measure is also derived for estimating the signal-to-noise ratio for real sequences when the ground truth is unknown.

Algorithms↗
PubMed2005

Predictive fine granularity successive elimination for fast optimal block-matching motion estimation.

Given the number of checking points, the speed of block motion estimation depends on how fast the block matching is. In this paper, a new framework, fine granularity successive elimination (FGSE), is proposed for fast optimal block matching in motion estimation. The FGSE features providing a sequence of nondecreasing fine-grained boundary levels to reject a checking point using as little computation as possible, where block complexity is utilized to determine the order of partitioning larger sub-blocks into smaller subblocks in the creation of the fine-grained boundary levels. It is shown that the well-known successive elimination algorithm (SEA) and multilevel successive elimination algorithm (MSEA) are just two special cases in the FGSE framework. Moreover, in view that two adjacent checking points (blocks) share most of the block pixels with just one pixel shifting horizontally or vertically, we develop a scheme to predict the rejection level for a candidate by exploiting the correlation of matching errors between two adjacent checking points. The resulting predictive FGSE algorithm can further reduce computation load by skipping some redundant boundary levels. Experimental results are presented to verify substantial computational savings of the proposed algorithm in comparison with the SEA/MSEA.

Algorithms↗
PubMed2005

A compressed domain scheme for classifying block edge patterns.

Detecting and classifying edge components in images find a wide range of applications from perceptually improved coding schemes to content-based searches. In this paper, a fast and systematic scheme is proposed to classify the edge orientation of each block in discrete cosine transform (DCT)-compressed images. Derived from a simple, but acceptable, pixel-domain algorithm, the proposed scheme performs directly on DCT coefficient domain and, thus, saves the arithmetic operations by a considerable amount. The performance of the proposed method is validated by the experiments against various natural images.

Algorithms↗
PubMed2005

Segmenting a low-depth-of-field image using morphological filters and region merging.

We propose a novel algorithm to partition an image with low depth-of-field (DOF) into focused object-of-interest (OOI) and defocused background. The proposed algorithm unfolds into three steps. In the first step, we transform the low-DOF image into an appropriate feature space, in which the spatial distribution of the high-frequency components is represented. This is conducted by computing higher order statistics (HOS) for all pixels in the low-DOF image. Next, the obtained feature space, which is called HOS map in this paper, is simplified by removing small dark holes and bright patches using a morphological filter by reconstruction. Finally, the OOI is extracted by applying region merging to the simplified image and by thresholding. Unlike the previous methods that rely on sharp details of OOI only, the proposed algorithm complements the limitation of them by using morphological filters, which also allows perfect preservation of the contour information. Compared with the previous methods, the proposed method yields more accurate segmentation results, supporting faster processing.

Algorithms↗
PubMed2006

Determining scale and sea state from water video.

In most image processing and computer vision applications, real-world scale can only be determined when calibration information is available. Dynamic scenes further complicate most situations. However, some types of dynamic scenes provide useful information that can be used to recover real-world scale. In this paper, we focus on ocean scenes and propose a method for finding sizes in real-world units and the sea state from an uncalibrated camera. Fourier transforms in the space and time dimensions yield spatial and temporal frequency spectra. For water waves, the dispersion relation defines a square relationship between the wavelength and period of a wave. Our method applies this dispersion relation to recover the real-world scale of an ocean sequence. The sea state--including the peak wavelength and period, the wind speed that generated the waves, and the wave heights--is also determined from the frequency spectrum of the sequence combined with stochastic oceanography models. The process is demonstrated on synthetic and real sequences, validating the results with known scene geometry. This has wide applications in port monitoring and coastal surveillance.

Algorithms↗
PubMed2002

Automated 3-D echocardiography analysis compared with manual delineations and SPECT MUGA.

A major barrier for using 3-D echocardiography for quantitative analysis of heart function in routine clinical practice is the absence of accurate and robust segmentation and tracking methods necessary to make the analysis automatic. In this paper, we present an automated three-dimensional (3-D) echocardiographic acquisition and image-processing methodology for assessment of left ventricular (LV) function. We combine global image information provided by a novel multiscale fuzzy-clustering segmentation algorithm, with local boundaries obtained with phase-based acoustic feature detection. We then use the segmentation results to fit and track the LV endocardial surface using a 3-D continuous transformation. To our knowledge, this is the first report of a completely automated method. The protocol is evaluated in a small clinical case study (nine patients). We compare ejection fractions (EFs) computed with the new approach to those obtained using the standard clinical technique, single-photon emission computed tomography multigated acquisition. Errors on six datasets were found to be within six percentage points. A further two, with poor image quality, improved upon EFs from manually delineated contours, and the last failed due to artifacts in the data. Volume-time curves were derived and the results compared to those from manual segmentation. Improvement over an earlier published version of the method is noted.

Algorithms↗
PubMed2003

Texture-based classification of atherosclerotic carotid plaques.

There are indications that the morphology of atherosclerotic carotid plaques, obtained by high-resolution ultrasound imaging, has prognostic implications. The objective of this study was to develop a computer-aided system that will facilitate the characterization of carotid plaques for the identification of individuals with asymptomatic carotid stenosis at risk of stroke. A total of 230 plaque images were collected which were classified into two types: symptomatic because of ipsilateral hemispheric symptoms, or asymptomatic because they were not connected with ipsilateral hemispheric events. Ten different texture feature sets were extracted from the manually segmented plaque images using the following algorithms: first-order statistics, spatial gray level dependence matrices, gray level difference statistics, neighborhood gray tone difference matrix, statistical feature matrix, Laws texture energy measures, fractal dimension texture analysis, Fourier power spectrum and shape parameters. For the classification task a modular neural network composed of self-organizing map (SOM) classifiers, and combining techniques based on a confidence measure were used. Combining the classification results of the ten SOM classifiers inputted with the ten feature sets improved the classification rate of the individual classifiers, reaching an average diagnostic yield (DY) of 73.1%. The same modular system was implemented using the statistical k-nearest neighbor (KNN) classifier. The combined DY for the KNN system was 68.8%. The results of this paper show that it is possible to identify a group of patients at risk of stroke based on texture features extracted from ultrasound images of carotid plaques. This group of patients may benefit from a carotid endarterectomy whereas other patients may be spared from an unnecessary operation.

Algorithms↗
PubMed2004

Ridge-based vessel segmentation in color images of the retina.

A method is presented for automated segmentation of vessels in two-dimensional color images of the retina. This method can be used in computer analyses of retinal images, e.g., in automated screening for diabetic retinopathy. The system is based on extraction of image ridges, which coincide approximately with vessel centerlines. The ridges are used to compose primitives in the form of line elements. With the line elements an image is partitioned into patches by assigning each image pixel to the closest line element. Every line element constitutes a local coordinate frame for its corresponding patch. For every pixel, feature vectors are computed that make use of properties of the patches and the line elements. The feature vectors are classified using a kappaNN-classifier and sequential forward feature selection. The algorithm was tested on a database consisting of 40 manually labeled images. The method achieves an area under the receiver operating characteristic curve of 0.952. The method is compared with two recently published rule-based methods of Hoover et al. and Jiang et al. The results show that our method is significantly better than the two rule-based methods (p < 0.01). The accuracy of our method is 0.944 versus 0.947 for a second observer.

Algorithms↗
PubMed2004

Analysis of 3-D myocardial motion in tagged MR images using nonrigid image registration.

Tagged magnetic resonance imaging (MRI) is unique in its ability to noninvasively image the motion and deformation of the heart in vivo, but one of the fundamental reasons limiting its use in the clinical environment is the absence of automated tools to derive clinically useful information from tagged MR images. In this paper, we present a novel and fully automated technique based on nonrigid image registration using multilevel free-form deformations (MFFDs) for the analysis of myocardial motion using tagged MRI. The novel aspect of our technique is its integrated nature for tag localization and deformation field reconstruction using image registration and voxel based similarity measures. To extract the motion field within the myocardium during systole we register a sequence of images taken during systole to a set of reference images taken at end-diastole, maximizing the normalized mutual information between the images. We use both short-axis and long-axis images of the heart to estimate the full four-dimensional motion field within the myocardium. We also present validation results from data acquired from twelve volunteers.

Algorithms↗