Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Data Compression”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

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

At least 1,027 records · Page 57Linked to original sources
PubMed2004

Distance-preserving projection of high-dimensional data for nonlinear dimensionality reduction.

A distance-preserving method is presented to map high-dimensional data sequentially to low-dimensional space. It preserves exact distances of each data point to its nearest neighbor and to some other near neighbors. Intrinsic dimensionality of data is estimated by examining the preservation of interpoint distances. The method has no user-selectable parameter. It can successfully project data when the data points are spread among multiple clusters. Results of experiments show its usefulness in projecting high-dimensional data.

Algorithms↗
PubMed2006

Channel smoothing: efficient robust smoothing of low-level signal features.

In this paper, we present a new and efficient method to implement robust smoothing of low-level signal features: B-spline channel smoothing. This method consists of three steps: encoding of the signal features into channels, averaging of the channels, and decoding of the channels. We show that linear smoothing of channels is equivalent to robust smoothing of the signal features if we make use of quadratic B-splines to generate the channels. The linear decoding from B-spline channels allows the derivation of a robust error norm, which is very similar to Tukey's biweight error norm. We compare channel smoothing with three other robust smoothing techniques: nonlinear diffusion, bilateral filtering, and mean-shift filtering, both theoretically and on a 2D orientation-data smoothing task. Channel smoothing is found to be superior in four respects: It has a lower computational complexity, it is easy to implement, it chooses the global minimum error instead of the nearest local minimum, and it can also be used on nonlinear spaces, such as orientation space.

Algorithms↗
PubMed2007

Feature subset selection and ranking for data dimensionality reduction.

A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one at a time, by estimating the capability of each specified candidate feature subset to represent the overall features in the measurement space. A squared correlation function is employed as the criterion to measure the dependency between features and this makes the new algorithm easy to implement. The forward orthogonalization strategy, which combines good effectiveness with high efficiency, enables the new algorithm to produce efficient feature subsets with a clear physical interpretation.

Algorithms↗
PubMed2004

Run-length chain coding and scalable computation of a shape's moments using reconfigurable optical buses.

The main contribution of this paper is the design of several efficient algorithms for modified run-length chain coding and for computing a shape's moments on arrays with reconfigurable optical buses. The proposed algorithms are based on the boundary representation of an object. Instead of using chain code, the boundary can be represented by a modified run-length chain code, where each entity represents a line segment (two adjacent corner pixels). The sequential nature of the chain code makes it difficult to be parallelized. We first propose two constant time algorithms for boundary extraction and run-length chain coding. To the authors' knowledge, these are the most time efficient algorithms yet published. Based on the modified run-length chain coding, and the advantages of both optical transmission and electronic computation, a constant time parallel algorithm for computing a shape's moments using N x N processors is proposed. Additionally, instead of using N x N processors, a scalable moment algorithm using r x r processors is also derived, where r < N. Based on the product of time and the number of processors used, both proposed parallel algorithms are time and cost optimal.

Algorithms↗
PubMed2006

A vertical-energy-thresholding procedure for data reduction with multiple complex curves.

Due to the development of sensing and computer technology, measurements of many process variables are available in current manufacturing processes. It is very challenging, however, to process a large amount of information in a limited time in order to make decisions about the health of the processes and products. This paper develops a "preprocessing" procedure for multiple sets of complicated functional data in order to reduce the data size for supporting timely decision analyses. The data type studied has been used for fault detection, root-cause analysis, and quality improvement in such engineering applications as automobile and semiconductor manufacturing and nanomachining processes. The proposed vertical-energy-thresholding (VET) procedure balances the reconstruction error against data-reduction efficiency so that it is effective in capturing key patterns in the multiple data signals. The selected wavelet coefficients are treated as the "reduced-size" data in subsequent analyses for decision making. This enhances the ability of the existing statistical and machine-learning procedures to handle high-dimensional functional data. A few real-life examples demonstrate the effectiveness of our proposed procedure compared to several ad hoc techniques extended from single-curve-based data modeling and denoising procedures.

Algorithms↗
PubMed2006

Optimizing multicompression approaches to elasticity imaging.

Breast lesion visibility in static strain imaging ultimately is noise limited. When correlation and related techniques are applied to estimate local displacements between two echo frames recorded before and after a small deformation, target contrast increases linearly with the amount of deformation applied. However, above some deformation threshold, decorrelation noise increases more than contrast such that lesion visibility is severely reduced. Multicompression methods avoid this problem by accumulating displacements from many small deformations to provide the same net increase in lesion contrast as one large deformation but with minimal decorrelation noise. Unfortunately, multicompression approaches accumulate echo noise (electronic and sampling) with each deformation step as contrast builds so that lesion visibility can be reduced again if the applied deformation increment is too small. This paper uses signal models and analysis techniques to develop multicompression strategies that minimize strain image noise. The analysis predicts that displacement variance is minimal in elastically homogeneous media when the applied strain increment is 0.0035. Predictions are verified experimentally with gelatin phantoms. For in vivo breast imaging, a strain increment as low as 0.0015 is recommended for minimum noise because of the greater elastic heterogeneity of breast tissue.

Algorithms↗
PubMedDate not supplied

Blind robust watermarking schemes for copyright protection of 3D mesh objects.

In this paper, two novel methods suitable for blind 3D mesh object watermarking applications are proposed. The first method is robust against 3D rotation, translation, and uniform scaling. The second one is robust against both geometric and mesh simplification attacks. A pseudorandom watermarking signal is cast in the 3D mesh object by deforming its vertices geometrically, without altering the vertex topology. Prior to watermark embedding and detection, the object is rotated and translated so that its center of mass and its principal component coincide with the origin and the z-axis of the Cartesian coordinate system. This geometrical transformation ensures watermark robustness to translation and rotation. Robustness to uniform scaling is achieved by restricting the vertex deformations to occur only along the r coordinate of the corresponding (r, theta, phi) spherical coordinate system. In the first method, a set of vertices that correspond to specific angles theta is used for watermark embedding. In the second method, the samples of the watermark sequence are embedded in a set of vertices that correspond to a range of angles in the theta domain in order to achieve robustness against mesh simplifications. Experimental results indicate the ability of the proposed method to deal with the aforementioned attacks.

Algorithms↗
PubMedDate not supplied

A streaming-based solution for remote visualization of 3D graphics on mobile devices.

Mobile devices such as Personal Digital Assistants, Tablet PCs, and cellular phones have greatly enhanced user capability to connect to remote resources. Although a large set of applications are now available bridging the gap between desktop and mobile devices, visualization of complex 3D models is still a task hard to accomplish without specialized hardware. This paper proposes a system where a cluster of PCs, equipped with accelerated graphics cards managed by the Chromium software, is able to handle remote visualization sessions based on MPEG video streaming involving complex 3D models. The proposed framework allows mobile devices such as smart phones, Personal Digital Assistants (PDAs), and Tablet PCs to visualize objects consisting of millions of textured polygons and voxels at a frame rate of 30 fps or more depending on hardware resources at the server side and on multimedia capabilities at the client side. The server is able to concurrently manage multiple clients computing a video stream for each one; resolution and quality of each stream is tailored according to screen resolution and bandwidth of the client. The paper investigates in depth issues related to latency time, bit rate and quality of the generated stream, screen resolutions, as well as frames per second displayed.

Computer Communication Networks↗
PubMed2003

Data reduction using a discrete wavelet transform in discriminant analysis of very high dimensionality data.

We present a method of data reduction using a wavelet transform in discriminant analysis when the number of variables is much greater than the number of observations. The method is illustrated with a prostate cancer study, where the sample size is 248, and the number of variables is 48,538 (generated using the ProteinChip technology). Using a discrete wavelet transform, the 48,538 data points are represented by 1271 wavelet coefficients. Information criteria identified 11 of the 1271 wavelet coefficients with the highest discriminatory power. The linear classifier with the 11 wavelet coefficients detected prostate cancer in a separate test set with a sensitivity of 97% and specificity of 100%.

Data Compression↗
PubMed1992

Angiographic magnetic resonance color composites of the normal brain and its vasculature.

Vascular magnetic resonance imaging (MRI) has become an important noninvasive adjunct to conventional cerebral MRI studies. To detect parenchymal changes associated with vascular anomalies, optimal diagnostic evaluation requires the comparison of both spin-echo and angiographic gradient-echo MRIs. To compress image data into a single 24-bit color image possessing the combined tissue contrast characteristics of both conventional spin-echo "black-blood" images and flow-sensitive gradient-echo "bright-blood" images, the red-green-blue color model and computer-based image-processing software were used to generate composites of MRI sets in which blood appears bright red while many stationary tissues possess near-natural colors. This technique may have potential applicability to human cerebrovascular MRI.

Brain↗
PubMed2005

Adaptive dynamic range optimization (ADRO): a digital amplification strategy for hearing aids and cochlear implants.

Adaptive dynamic range optimization (ADRO) is an amplification strategy that uses digital signal processing techniques to improve the audibility, comfort, and intelligibility of sounds for people who use cochlear implants and/or hearing aids. The strategy uses statistical analysis to select the most information-rich section of the input dynamic range in multiple-frequency channels. Fuzzy logic rules control the gain in each frequency channel so that the selected section of the dynamic range is presented at an audible and comfortable level. The ADRO processing thus adaptively optimizes the dynamic range of the signal in multiple-frequency channels. Clinical studies show that ADRO can be fitted easily to all degrees of hearing loss for hearing aids and cochlear implants in a direct and intuitive manner, taking the preferences of the listener into account. The result is high acceptance by new and experienced hearing aid users and strong preferences for ADRO compared with alternative amplification strategies. The ADRO processing is particularly well suited to bimodal and hybrid stimulation which combine electric and acoustic stimulation in opposite ears or in the same ear, respectively.

Algorithms↗
PubMed2003

Multi-purpose HealthCare Telemedicine Systems with mobile communication link support.

The provision of effective emergency telemedicine and home monitoring solutions are the major fields of interest discussed in this study. Ambulances, Rural Health Centers (RHC) or other remote health location such as Ships navigating in wide seas are common examples of possible emergency sites, while critical care telemetry and telemedicine home follow-ups are important issues of telemonitoring. In order to support the above different growing application fields we created a combined real-time and store and forward facility that consists of a base unit and a telemedicine (mobile) unit. This integrated system: can be used when handling emergency cases in ambulances, RHC or ships by using a mobile telemedicine unit at the emergency site and a base unit at the hospital-expert's site, enhances intensive health care provision by giving a mobile base unit to the ICU doctor while the telemedicine unit remains at the ICU patient site and enables home telemonitoring, by installing the telemedicine unit at the patient's home while the base unit remains at the physician's office or hospital. The system allows the transmission of vital biosignals (3-12 lead ECG, SPO2, NIBP, IBP, Temp) and still images of the patient. The transmission is performed through GSM mobile telecommunication network, through satellite links (where GSM is not available) or through Plain Old Telephony Systems (POTS) where available. Using this device a specialist doctor can telematically "move" to the patient's site and instruct unspecialized personnel when handling an emergency or telemonitoring case. Due to the need of storing and archiving of all data interchanged during the telemedicine sessions, we have equipped the consultation site with a multimedia database able to store and manage the data collected by the system. The performance of the system has been technically tested over several telecommunication means; in addition the system has been clinically validated in three different countries using a standardized medical protocol.

Data Compression↗
PubMed2006

Reproducibility of and file format effect on digital subtraction radiography of simulated external root resorptions.

OBJECTIVE: To evaluate, in simulated external root resorptions (ERR), two factors that may affect results of digital subtraction radiography (DSR): (1) intraobserver and interobserver reproducibility and (2) effects of digital file formats (TIFF, BMP and JPEG) on the estimation of mineral loss. METHODS: Eleven incisors were radiographed three times (NR, no resorption; SR, small--#1/4 round bur; and LR, large--#2 round bur) on standardized projections. The resulting images were reproduced and saved as TIFF, JPEG and BMP file formats. The pairs of TIFF images (NR x SR and NR x LR) were subtracted three times at 1 week intervals by three observers. One observer subtracted pairs of images (NR x SR and NR x LR) for all file formats. For each subtraction the resorption area was selected and mean pixel density values were calculated. RESULTS: Analysis of variance (ANOVA) (P = 0.05) showed no statistical differences for intraobserver and interobserver values. Mean pixel density values were: observer A, 121.60 +/- 2.56 (NR x SR) and 111.84 +/- 4.04 (NR x LR); observer B, 121.86 +/- 2.50 (NR x SR) and 110.92 +/- 3.36 (NR x LR); and observer C, 121.70 +/- 2.39 (NR x SR) and 111.10 +/- 2.67 (NR x LR). Also, no statistical differences were found between file formats for LR (TIFF, 110.88 +/- 2.79; JPEG, 111.35 +/- 3.35; BMP, 111.00 +/- 2.70) and for SR between TIFF (121.30 +/- 2.34) and JPEG (120.46 +/- 1.51) or BMP (121.67 +/- 2.18) file formats. Differences were found between the JPEG and BMP groups. CONCLUSIONS: DSR is reproducible in simulated ERR, and JPEG or BMP file formats do not affect results.

Analysis of Variance↗
PubMed2004

Analysis of hyperspectral fluorescence images for poultry skin tumor inspection.

We present a hyperspectral fluorescence imaging system with a fuzzy inference scheme for detecting skin tumors on poultry carcasses. Hyperspectral images reveal spatial and spectral information useful for finding pathological lesions or contaminants on agricultural products. Skin tumors are not obvious because the visual signature appears as a shape distortion rather than a discoloration. Fluorescence imaging allows the visualization of poultry skin tumors more easily than reflectance. The hyperspectral image samples obtained for this poultry tumor inspection contain 65 spectral bands of fluorescence in the visible region of the spectrum at wavelengths ranging from 425 to 711 nm. The large amount of hyperspectral image data is compressed by use of a discrete wavelet transform in the spatial domain. Principal-component analysis provides an effective compressed representation of the spectral signal of each pixel in the spectral domain. A small number of significant features are extracted from two major spectral peaks of relative fluorescence intensity that have been identified as meaningful spectral bands for detecting tumors. A fuzzy inference scheme that uses a small number of fuzzy rules and Gaussian membership functions successfully detects skin tumors on poultry carcasses. Spatial-filtering techniques are used to significantly reduce false positives.

Animals↗
PubMed2005

Two improved algorithms with which to obtain contoured windows for fringe patterns generated by electronic speckle-pattern interferometry.

Fringe patterns generated by electronic speckle-pattern interferometry are full of high-spatial-frequency and high-contrast speckle noise. Filtering with contoured windows has proved to be an efficient approach to filtering out speckle noise while retaining the fringe patterns. Furthermore, with contoured windows the contoured correlation fringe pattern method can be used to derive smooth, normalized, consistent fringes. Contoured windows previously were determined by fringe orientation only, and this process generated accumulated errors. We propose two new algorithms with which to obtain the contoured windows according to the fringe intensity slope and the distance ratio to neighboring skeletons. These new techniques can determine contoured windows more precisely.

Algorithms↗
PubMed2006

Three-dimensional computer graphics for surgical procedure learning: Web three-dimensional application for cleft lip repair.

OBJECTIVE: In surgical procedures for cleft lip, surgeons attempt to use various skin incisions and small flaps to achieve a better and more natural shape postoperatively. They must understand the three-dimensional (3D) structure of the lips. However, they may have difficulty learning the surgical procedures precisely from normal textbooks with two-dimensional illustrations. Recent developments in 3D computed tomography (3D-CT) and laser stereolithography have enabled surgeons to visualize the structures of cleft lips from desired viewpoints. However, this method cannot reflect the advantages offered by specific surgical procedures. To solve this problem, we used the benefits offered by 3D computer graphics (3D-CG) and 3D animation. DESIGN AND RESULTS: By using scanning 3D-CT image data of patients with cleft lips, 3D-CG models of the cleft lips were created. Several animations for surgical procedures such as incision designs, rotation of small skin flaps, and sutures were made. This system can recognize the details of an operation procedure clearly from any viewpoint, which cannot be acquired from the usual textbook illustrations. This animation system can be used for developing new skin-flap design, understanding the operational procedure, and using tools in case presentations. The 3D animations can also be uploaded to the World Wide Web for use in teleconferencing.

Cleft Lip↗
PubMedDate not supplied

Reliability of surface electromyographic measurements from subjects with spinal cord injury during voluntary motor tasks.

In this study, the reliability of surface electromyographic data (root-mean-square) for volitional motor tasks drawn from a standardized protocol was assessed. For each motor task, 5 s epochs of data were analyzed with a new method to generate a measure called the voluntary response index (VRI). The VRI consists of two components, magnitude and similarity index (SI), that were separately analyzed for repeatability. We examined three repetitions of each of 10 volitional motor tasks in 69 subjects with spinal cord injury (American Spinal Injury Association [ASIA] Impairment Scale [AIS], classifications C and D: 34 AIS-C and 35 AIS-D) for short-term (within-day) reliability. In 6 of the 69 subjects (3 each, AIS-C and AIS-D), the entire study was repeated after 1 week and results were assessed for intermediate-term (1 week apart) reliability. The reliability of the method for voluntary motor tasks was assessed by intraclass correlation coefficient (ICC), analysis of variance, coefficient of variance, and Pearson's correlation. Good reliability was found for magnitude (ICC = 0.71-0.99, Pearson's r = 0.77-0.99) and for SI (ICC = 0.65-0.96, Pearson's r = 0.72-0.93) for three repeated tests (within-day). Significant difference was found for studies completed 1 week apart for magnitude (p = 0.02) but not for SI (p = 0.57). In addition, SI showed less variation than magnitude (p < 0.001). No significant difference of magnitude and SI between tasks was observed.

Algorithms↗