Tissue cartography: compressing bio-image data by dimensional reduction
نویسندگان
چکیده
منابع مشابه
Compressing High Dimensional Datasets by Fractals
Fractal techniques based on iterated function systems have been successfully applied to the compression of one-dimensional signals, two-dimensional images, and three-dimensional volumes by finding a fractal representation that models the original data as closely as possible, and storing the model instead of the original data. In this paper, we extend fractal compression techniques to general da...
متن کاملCT data storage reduction by means of compressing projection data instead of images: feasibility study.
The authors developed and evaluated a technique of compressing raw projection data at computed tomography (CT). Raw projection data acquired at CT were compressed and decompressed and then used for image reconstruction. For comparison, original images were compressed by comparable ratios. Projection data files were more compressible than image files. Projection data compression is a promising, ...
متن کاملA New Histogram-based Technique for Compressing Multi-Dimensional Data
The need to compress data into synopses of summarized information often arises in many application scenarios, where the aim is to retrieve aggregate data efficiently, possibly trading off the computational efficiency with the accuracy of the estimation. A widely used approach for summarizing multidimensional data is the histogram-based representation scheme, which consists in partitioning the d...
متن کاملLogic minimization based approach for compressing image data
We propose a novel approach for the lofsless compression of binary images using logic minimization. The image is divided into windows or blocks of size r x c pixels and each block is transformed into a Boolean .switching function in cubical form, treating the pixel values as output of the function. Compression is performed b y minimizing these switching functions using ESPRESSO, a cube-based tw...
متن کاملCompressing Two-Dimensional Routing Tables1
We consider an algorithmic problem that arises in the context of routing tables used by Internet routers. The Internet addressing scheme is hierarchical, where a group of hosts are identified by a prefix that is common to all the hosts in that group. Each host machine has a unique 32-bit address. Thus, all traffic between a source group s and a destination group d can be routed along a particul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Methods
سال: 2015
ISSN: 1548-7091,1548-7105
DOI: 10.1038/nmeth.3648