检索结果-内蒙古大学图书馆

Context conditioning and run-length coding for hybrid, embedded progressive image coding

IEEE TRANSACTIONS ON IMAGE PROCESSING 2001年第12期10卷 1791-1800页

作者： Berghorn, W Boskamp, T Lang, M Peitgen, HO Ctr Med Diagnost Syst & Visualizat MeVis D-28359 Bremen Germany

An analysis of spatial context conditioning and run-length coding in embedded progressive, wavelet-based image coding is presented. The analysis shows that run-length coding of certain context subsequences is superior to pure entropy coding, both in terms of coding performance and of execution speed. Based on these considerations, a novel, intuitive context conditioning scheme using a spatial distance model to describe the statistics of significant coefficients is proposed. The results for the proposed coding scheme are competitive to the best coding schemes found in the literature.

关键词： context conditioning embedded progressive run-length coding wavelet-based image compression

来源：评论

学校读者我要写书评

暂无评论

A run-length-coding-based approach to stroke extraction of Chinese characters

引用

PATTERN RECOGNITION 2000年第11期33卷 1881-1895页

作者： Fan, KC Wu, WH Natl Cent Univ Inst Comp Sci & Informat Engn Chungli 32054 Taiwan

Traditional stroke extraction approach usually adopts thinning technique as the preprocessing method in obtaining the skeletons of Chinese characters. However, thinning may produce spurious branches and multiple fork points at junctions. Such distortion will make stroke extraction process more complicate and unreliable. This paper proposes a novel run-length-based stroke extraction approach without using the thinning method. Besides, the proposed approach does not need to trace the skeleton pixel by pixel in obtaining the skeletons of Chinese characters. In our approach, run-length coding technique is first employed to get a special skeleton which only owns disjoint line segments without including fork points. Then, an attributed graph is constructed from the skeleton. The attribute between two nodes is determined according to the distance, connectivity and orientation difference between the two corresponding line segments. Intersection relation among line segments is represented by a junction matrix and its associating graph. While stroke extraction is performed, fork points can also be found. Experimental results show that the proposed approach is feasible and efficient in extracting strokes of Chinese characters. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

关键词： stroke extraction run-length coding attributed graph junction matrix

来源：评论

学校读者我要写书评

暂无评论

Accelerating vector quantization of images using modified run length coding for adaptive block representation and difference measurement

Accelerating vector quantization of images using modified ru...

引用

IEEE International Symposium on Circuits and Systems

作者： Hsu, Chih-Chung Chang, Hsuan T. Natl Yunlin Univ Sci & Technol Dept Elect Engn Douliu Yunlin 640 Taiwan

ISBN: (纸本)9781424420780

In vector quantization (VQ) techniques, the block difference measurement in the nearest neighboring search and the iteration process in codebook generation are time consuming. Since there could be many smoothing or strongly related regions in images, the pixels values in the partitioned image blocks could be identical or quite similar. In this paper, two accelerating methods for codebook training and VQ coding based on the modified run-length coding method that can transform an image block into a coded vector (CV) are proposed. Acceleration can be achieved by measuring the distance between two CVs rather than measuring the difference between two image blocks. Computer simulation results show the proposed scheme outperforms the conventional VQ and the principal component analysis based methods in speeding up both the image coding and codebook training processes.

关键词： VQ run-length coding codebook training block difference measurement

来源：评论

学校读者我要写书评

暂无评论

Lossless Compression of Fluoroscopy Medical Images using Correlation and the Combination of run-length and Huffman coding

Lossless Compression of Fluoroscopy Medical Images using Cor...

引用

IEEE-EMBS Conference on Biomedical Engineering and Sciences

作者： Arif Sameh Arif Sarina Mansor Hezrul Abdul Karim Rajasvaran Logeswaran Faculty of Engineering Multimedia University School of Science & Technology Nilai University College

ISBN: (纸本)9781467316644

Medical centers produce a massive amount of sequential medical images for examinations such as CT, MRI and Fluoroscopy, where each examination of a patient consists of a series of images. This takes up a large amount of storage space, in addition to the cost and time incurred during transmission. For medical data, lossless compression is preferred to the greater gains of lossy compression, in the interest of accuracy. This paper proposes a new method for lossless compression of pharynx and esophagus fluoroscopy images, using correlation and combination of run length and Huffman coding on the difference pairs of images classified by correlation. From the experimental results obtained, the proposed method achieved improved performance with a compression ratio of 11.41 for the proposed combination of run-length and Huffman coding (RLHM-D) on the difference images as compared to 1.31 for the standard images.

关键词： Component Fluoroscopy ROI Lossless image compression run-length coding Huffman coding Correlation

来源：评论

学校读者我要写书评

暂无评论

Context Based Adaptive First 1 Bit run-length Image Bit-plane coding Algorithm 8

Context Based Adaptive First 1 Bit Run-length Image Bit-plan...

引用

8th International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Xu Yong Zhao Lei Liu Zhigang Zhu Jianbing Beijing Inst Spacecraft Syst Engn Beijing 100094 Peoples R China

ISBN: (纸本)9781538682463

In order to improve the performance of First 1 bit run-length bit-plane coding algorithm (F1-run),we employed a context estimate based method to adaptive adjust coding parameters, including run-length threshold value and k parameter of Exp-Golomb coding, context was estimated here by counting bit method to predict the probability of bit equal to 0. Proposed algorithm has retained the advantage of efficiency and parallelization. As the context predict process need not to access the neighbor pixels, proposed algorithm retained independence of pixels in coding process, which lead to the benefit of less buffering and more parallelization. The simulation result showed that the proposed algorithms performed well and reduced 0.12bit/pixel than original algorithm in loss-less compressing, which was close to JPEG2000. In loss-compressing experiment, proposed algorithms performed better than original F1-run and CCSDS-IDC algorithm, slightly better than SPIHT as using INT97 DWT, and close to JPGE2000.

关键词： Context adaptive run-length coding First-1 biplane paralleled coding

来源：评论

学校读者我要写书评

暂无评论

GLS coding based security solution to JPEG with the structure of aggregated compression and encryption

引用

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2014年第5期19卷 1366-1374页

作者： Zhang, Yushu Xiao, Di Liu, Hong Nan, Hai Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Chongqing Univ Posts & Telecommun Coll Software Engn Chongqing 400065 Peoples R China

There exists close relation among chaos, coding and cryptography. All the three can be combined into a whole as aggregated chaos-based coding and cryptography (ATC) to compress and encrypt data simultaneously. In particular, image data own high redundancy and wide transmission and thereby it is well worth doing research on ATC for image, which is very helpful to real application. JPEG with high compression ratio has not provided security. If JPEG is incorporated into powerful cryptographic features, its application can be further extended. For this reason, in this paper, GLS coding as a special form of ATC, which attains synchronous compression and encryption, is used to modify JPEG and fill its gap. An image is first initialized using DCT, quantization and run-length coding in turn, just as JPEG. Then, it is encoded and encrypted simultaneously by utilizing GLS coding and binary keystream resulting from the chaotic generator. Results demonstrate that our scheme can not only achieve good compression performance but also resist known/chosen-plaintext attacks efficiently. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Aggregated chaos-based compression and encryption GLS Arithmetic coding DCT Quantization run-length coding

来源：评论

学校读者我要写书评

暂无评论

Dilation-run wavelet image coding

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2008年第3期2卷 225-239页

作者： Wu, Zheng He, Ming-Yi Ma, Kai-Kuang Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Northwestern Polytech Univ Dept Elect & Informat Engn Xian 710072 Peoples R China

The run-length coding and the morphological representation are two classical schemes for wavelet image coding. The run-length coders have the advantage of simplicity by recording the lengths of zero-runs between significant wavelet coefficients but at the expense of yielding an inferior rate-distortion performance. The morphology-based coders, on the other hand, utilize the morphological dilation operation to delineate the clusters of significant coefficients for improving coding performance. In this paper, a novel dilation-run image coding algorithm is developed by taking the advantages of both schemes, in which the clustered significant coefficients are extracted by using the morphological dilation operation and the insignificant coefficients between the extracted clusters are coded by using the run-length coding method. The proposed dilation-run image coder is implemented in the framework of bitplane coding for producing embedded bitstreams. Compared with several state-of-the-art wavelet image coding methods, the proposed dilation-run image coding method achieves comparable rate-distortion coding performance, especially more attractive for fingerprint type of imageries.

关键词： Wavelet image coding run-length coding Morphological dilation operation Bitplane coding

来源：评论

学校读者我要写书评

暂无评论

JOINT SOURCE-CHANNEL coding FOR RASTER DOCUMENT TRANSMISSION OVER MOBILE RADIO

引用

IEE PROCEEDINGS-I COMMUNICATIONS SPEECH AND VISION 1989年第6期136卷 375-380页

作者： WYRWAS, RR FARRELL, PG Department of Electrical Engineering Manchester Communications Research Group University of Manchester Manchester UK

coding schemes for binary raster document transmission in the mobile radio environment are explored. For many applications, standard facsimile is too costly in terms of capital investment and transmission time. In this paper we present joint source-channel coding as an alternative, cost-effective solution for low resolution graphics transmission. We present SEA-RL coding as a novel and useful example of joint source-channel coding.

关键词： low resolution graphics transmission Mobile radio systems data compression Facsimile transmission mobile radio systems encoding run-length coding mobile radio SEA-RL coding joint source-channel coding Codes cost-effective facsimile binary raster document transmission

来源：评论

学校读者我要写书评

暂无评论

Fast chain coding of region boundaries

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1998年第4期20卷 407-415页

作者： Zingaretti, P Gasparroni, M Vecci, L Univ Ancona Ist Informat I-60131 Ancona Italy

A fast single-pass algorithm to convert a multivalued image from a raster-based representation into chain codes is presented. Ail chain codes are obtained in linear time with respect to the number of chain segments that are generated at each raster according to a set of templates. A formal statement and the complexity and performance analysis of the algorithm are given.

关键词： boundary representations chain coding run-length coding multivalued images image coding image processing shape analysis

来源：评论

学校读者我要写书评

暂无评论

Test Compression for Robust Testable Path Delay Fault Testing Using Interleaving and Statistical coding

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2009年第2期E92D卷 269-282页

作者： Namba, Kazuteru Ito, Hideo Chiba Univ Grad Sch Adv Integrat Sci Chiba 2638522 Japan

This paper proposes a method providing efficient test compression. The proposed method is for robust testable path delay fault testing with scan design facilitating two-pattern testing. In the proposed method, test data are interleaved before test compression using statistical coding. This paper also presents test architecture for two-pattern testing using the proposed method. The proposed method is experimentally evaluated from several viewpoints such as compression rates, test application time and area overhead. For robust testable path delay fault testing on 11 out of 20 ISCAS89 benchmark circuits, the proposed method provides better compression rates than the existing methods such as Huffman coding, run-length coding, Golomb coding, frequency-directed run-length (FDR) coding and variable-length input Huffman coding (VIHC).

关键词： test compression statistical coding run-length coding delay fault testing two-pattern testing scan testing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：