101 |
Caring for the radial artery post-angiogram: A pilot study on a comparison of three methods of compressionFech, Jennifer Unknown Date
No description available.
|
102 |
Maximum frame rate video acquisition using adaptive compressed sensingLiu, Zhaorui Unknown Date
No description available.
|
103 |
A conditional entropy approach to encoding DCT coefficients for low bit rate video compressionSipitca, Mihai 12 1900 (has links)
No description available.
|
104 |
Stereo image sequence compressionJiang, Qin 12 1900 (has links)
No description available.
|
105 |
Efficient Parallel Text Compression on GPUsZhang, Xiaoxi 2011 December 1900 (has links)
This paper demonstrates an efficient text compressor with parallel Lempel-Ziv-Markov chain algorithm (LZMA) on graphics processing units (GPUs). We divide LZMA into two parts, match finder and range encoder. We parallel both parts and achieve competitive performance with freeArc on AMD 6-core 2.81 GHz CPU. We measure match finder time, range encoder compression time and demonstrate realtime performance on a large dataset: 10 GB web pages crawled by IRLbot. Our parallel range encoder is 15 times faster than sequential algorithm (FastAC) with static model.
|
106 |
Intracavity frequency modulation of modelocked lasersRobledo, Victor Joel Pinto January 1994 (has links)
No description available.
|
107 |
Lattice vector quantization for image codingSampson, Demetrios G. January 1995 (has links)
No description available.
|
108 |
Approaching “Big Data” in Biological Research Imaging Spectroscopy with Novel CompressionChen, Yixuan 10 April 2014 (has links)
This research focuses on providing a fast and space efficient compression method to answer information queries on spectroscopic data. Our primary hypothesis was whether a conversion from decimal data to character/integer space could be done in a manner that enables use of succinct structures and provides good compression. This compression algorithm is motivated to handle queries on spectroscopic data that approaches limits of main computer memory.
The primary hypothesis is supported in that the new compression method can save 79.20% - 94.07% computer space on the average. The average of maximum error rates is also acceptable, being 0.05% - 1.36% depending on the subject that the data was collected from. Additionally, the data’s compression rate and entropy are negatively correlated; while compression rate and maximum error were positively correlated when the max error rates were performed on a natural logarithm transformation. The effects of different types of data sources on compression rate have been studied as well. Fungus datasets achieved highest compression rates, while mouse brain datasets obtained the lowest compression rates among four types of data sources. Finally, the effect of the studied compression algorithm and method on integrating spectral bands has been investigated in this study. The spectral integration for determining lipid, CH2 and dense core plaque obtained good image quality and the errors can be considered inconsequential except the case of determining creatine deposits. Despite the fact that creatine deposits are still recognizable in the reconstructed image, the image quality was reduced.
|
109 |
Fractal image coding techniques and their applicationsAli, Maaruf January 1997 (has links)
No description available.
|
110 |
Plasma spray deposition of silicon nitride composite coatingsLiu, Junling January 2003 (has links)
No description available.
|
Page generated in 0.0464 seconds