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

A CHINESE-CHARACTER THINNING ALGORITHM-BASED ON GLOBAL FEATURES AND CONTOUR INFORMATION

PATTERN RECOGNITION 1995年第4期28卷 493-512页

作者： LIN, JY CHEN, Z NATL CHIAO TUNG UNIV INST COMP SCI & INFORMAT ENGNHSINCHU 300TAIWAN

This paper proposes a method of using run-length coding to perform thinning. First, we construct graphs from characters. The attributes (vertical lines, horizontal lines or points) of each node in the graph are determined according to the node's relationship to the nodes above and below it (we will refer to these relationships as global features) and the black runs within the node. Intersections between two adjacent segments are determined on the basis of the graph constructed and contour information. The thinning algorithm thus employs global features and contour information to produce a more accurate skeleton.

关键词： THINNING run run-length coding STROKE EXTRACTION SKELETON

来源：评论

学校读者我要写书评

暂无评论

A method for compressing test data based on Burrows-Wheeler transformation

引用

IEEE TRANSACTIONS ON COMPUTERS 2002年第5期51卷 486-497页

作者： Yamaguchi, TJ Ha, DS Ishida, M Ohmi, T Adv Labs Ltd Aoba Ku Sendai Miyagi 9893124 Japan Virginia Polytech Inst & State Univ Dept Elect & Comp Engn Blacksburg VA 24061 USA Tohoku Univ Fac Engn Dept Elect Aoba Ku Sendai Miyagi 9808579 Japan

The overall throughput of automatic test equipment (ATE) is affected by the download time of test data, An effective approach to the reduction of the download time is to compress test data before the download, A compression algorithm for test data should meet two requirements: lossless and simple decompression, In this paper, we propose a new test data compression method that aims to fully utilize the unique characteristics of test data compression. The key idea of the proposed method is to perform the Burrows-Wheeler transformation on the sequence of test patterns and then to apply run-length coding, Experimental results show that our compression method performs better than six other methods for compressing test data. The average compression ratio of the proposed method performed on 15 test data sets is 94.6, while that for the next best one, Gzip, is 65.0. The experimental results also show that our method indeed reduces the download time significantly, provided a dedicated hardware decompressor is employed.

关键词： data compression test data compression compression test data Burrows-Wheeler transformation run-length coding

来源：评论

学校读者我要写书评

暂无评论

On the capacity of two-dimensional run-length constrained channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1999年第5期45卷 1527-1540页

作者： Kato, A Zeger, K Univ Tokyo Grad Sch Engn Dept Math Engn & Informat Phys Tokyo 1138656 Japan Univ Calif San Diego Dept Elect & Comp Engn San Diego CA 92103 USA

Two-dimensional binary patterns that satisfy one-dimensional (d, k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity C-d,C-k is defined as C-d,C-k = lim(m,n-->infinity) log(2) N-m,n((d,k))/mn, where N-m,n((d,k)) denotes the number of m x n rectangular patterns that satisfy the two-dimensional (d: k) run-length constraint. Bounds on C-d,C-k are given and it is proven for every d greater than or equal to 1 and every k > d that C-d,C-k = 0 if and only if k = d + 1, Encoding algorithms are also discussed.

关键词： channel capacity optical storage run-length coding two-dimensional codes

来源：评论

学校读者我要写书评

暂无评论

Efficient Hardware Implementation of Real-time Rectification using Adaptively Compressed LUT

引用

JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE 2016年第1期16卷 44-57页

作者： Kim, Jong-hak Kim, Jae-gon Oh, Jung-kyun Kang, Seong-muk Cho, Jun-Dong Sungkyunkwan Univ Dept IT convergence Suwon 440746 South Korea

Rectification is used as a preprocessing to reduce the computation complexity of disparity estimation. However, rectification also requires a complex computation. To minimize the computing complexity, rectification using a lookup-table (R-LUT) has been introduced. However, since, the R-LUT consumes large amount of memory, rectification with compressed LUT (R-CLUT) has been introduced. However, the more we reduce the memory consumption, the more we need decoding overhead. Therefore, we need to attain an acceptable trade-off between the size of LUT and decoding overhead. In this paper, we present such a trade-off by adaptively combining simple coding methods, such as differential coding, modified run-length coding (MRLE), and Huffman coding. Differential coding is applied to transform coordinate data into a differential form in order to further improve the coding efficiency along with Huffman coding for better stability and MRLE for better performance. Our experimental results verified that our coding scheme yields high performance with maintaining robustness. Our method showed about ranging from 1 % to 16 % lower average inverse of compression ratio than the existing methods. Moreover, we maintained low latency with tolerable hardware overhead for real-time implementation.

关键词： Stereo-vision rectification data compression real-time processing Huffman coding differential coding run-length coding

来源：评论

学校读者我要写书评

暂无评论

ON THE PRINCIPAL STATE METHOD FOR run-length LIMITED SEQUENCES

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1994年第3期40卷 934-941页

作者： TJALKENS, TJ Eindhoven Univ of Technology Eindhoven Neth

We present a detailed result on Franaszek's principal state method for the generation of run-length constrained codes. We show that, whenever the constraints k and d satisfy k greater-than-or-equal-to 2d > 0, the set of ''principal states'' is s0,s1,...,s(k-1). Thus there is no need for Franaszek's search algorithm anymore. The counting technique used to obtain this result also shows that ''state independent decoding'' can be achieved using not more than three codewords per message. Previously, it was not known before hand that one could use fewer codewords per message than there were principal states. The counting technique also allows us to compare the principal state method with other practical schemes originating from the work of Tang and Bahl and allows us to use an efficient enumerative coding implementation of the encoder and decoder.

关键词： BLOCK coding CONSTRAINED CHANNELS run-length coding MAGNETIC RECORDING

来源：评论

学校读者我要写书评

暂无评论

A NEW IMAGE COMPRESSION METHOD USING DYNAMIC PREDICTOR BASED ON CURRENT CONTEXT

引用

SIGNAL PROCESSING 1991年第1期24卷 43-59页

作者： CHEN, LH WENG, SF [a]Department of Computer Information Science National Chiao Tung University Hsinchu Taiwan 30050 ROC

In this paper, a new image compression method is proposed. The approach first provides a decomposition method to segment the gray values of an image into several parts called buckets. The decomposition rule is to make, as much as possible, each bucket contain only one nearly-homogeneous region or edge area. For each pixel P, if the gray values of its three neighbors (top-left, top, left) belong to buckets B1, B2, and B3, respectively, then (B1, B2, B3) is referred to as P's context. An individual predictor is then derived for each set of pixels with the same context. The gray value of each pixel is then estimated by the predictor corresponding to its context. Some degree of distortion is allowed. A pixel with prediction error less than a preset value is considered as a redundant point. An image is finally coded by the prediction errors of nonredundant pixels and by the number of consecutive redundant pixels. Both of these two kinds of values are quantized and coded by their own adaptive Huffman codes. Experimental results show that the proposed method not only possesses high-speed computing property but also provides high compression ratio and good quality.

关键词： ADAPTIVE HUFFMAN CODE CONTEXT DISTORTION DYNAMIC PREDICTOR ENTROPY-BASED DECOMPOSITION run-length coding

来源：评论

学校读者我要写书评

暂无评论

AN ALGORITHM FOR MATCHING run-length CODED STRINGS

引用

COMPUTING 1993年第4期50卷 297-314页

作者： BUNKE, H CSIRIK, J UNIV SZEGED DEPT APPL COMP SCI H-6720 SZEGED HUNGARY

An algorithm for the computation of the edit distance of run-length coded strings is given. In run-length coding, not all individual symbols in a string are explicitly listed. Instead, one run of identical consecutive symbols is coded by giving one representative symbol together with its multiplicity. The algorithm determines the minimum cost sequence of edit operations transforming one string into another. In the worst case, the algorithm has a time complexity of O(n . m), where n and m give the lengths of the strings to be compared. In the best case, the time complexity is O(k . 1), where k and l are the numbers of runs of identical symbols in the two strings under comparison.

关键词： STRING MATCHING STRING EDIT DISTANCE LONGEST COMMON SUBSEQUENCE run-length coding

来源：评论

学校读者我要写书评

暂无评论

Lossless Compound Image Compression for Digital Imaging System

Lossless Compound Image Compression for Digital Imaging Syst...

引用

IEEE 3rd Annual International Conference on Consumer Electronics - Berlin (ICCE-Berlin)

作者： Park, Sungbum Choi, Daiwoong Yoon, Jaewon Shim, Woosung Samsung Elect Co Ltd Digital Media & Commun R&D Ctr Suwon 443742 South Korea

ISBN: (纸本)9781479914128;9781479914111

In this paper, we propose a simple but efficient lossless compression scheme for compound images. For natural image region in compound image, we introduce an efficient context modeling scheme, with reduced complexity in context modeling. Then, a block skip method is adopted to effectively express homogeneous regions. We also incorporate a pattern run-based representation for graphic regions. In the experiment, the proposed scheme outperforms JPEG-LS [1] and JPEG-XR [2] by 1.4 times and 2.9 times, respectively.

关键词： Lossless compression compound image context modeling template design template adaptation block skip pattern modeling run-length coding

来源：评论

学校读者我要写书评

暂无评论

Encryption of Motion Vector Based Compressed Video Data 1st

引用

1st International Conference on Information and Communication Technology for Intelligent Systems (ICTIS)

作者： Mishra, Manoj K. Mukhopadhyay, Susanta Biswas, G. P. Christ Univ Dept Comp Sci Bangalore 560029 Karnataka India Indian Sch Mines Dept CSE Dhanbad 826004 Jharkhand India

ISBN: (纸本)9783319309279;9783319309262

Enormous size of video data for natural scene and objects is a burden, threat for practical applications and thus there is a strong requirement of compression and encryption of video data. The proposed encryption technique considers motion vector components of the compressed video data and conceals them for their protection. Since the motion vectors exhibit redundancies, further reduction of these redundancies are removed through run-length coding prior to the application of encryption operation. For this, the motion vectors are represented in terms of ordered pair (val, run) corresponding to the motion components along the row and column dimensions, where 'val' represents value of the motion vector while 'run' represents the length of repetition of 'val'. However, an adjustment for having maximal run is made by merging the smaller run value. Eventually we encrypted the 'val' components using knapsack algorithm before sending them to the receiver. The method has been formulated, implemented and executed on real video data. The proposed method has also been evaluated on the basis of some performance measures namely PSNR, MSE, SSIM and the results are found to be satisfactory.

关键词： Motion vector Motion estimation Motion compensation Accordion matrix run-length coding CR MSE PSNR

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant FFT data compression

Fault-tolerant FFT data compression

引用

Pacific Rim International Symposium on Dependable Computing

作者： Redinbo, GR Manomohan, R Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

ISBN: (纸本)0769509754

Transform coefficients carry important data characteristics but can also be compressed significantly in many remote sensing applications. Failures in the several computing facilities that execute lossy compression algorithms and support the transmission of Fourier transform data can corrupt the values beyond recovery at the final destination. Various methods for including fault tolerance at the data processing level are exemplified by describing a protected system that computes the FFT, truncates small coefficients and compresses the remaining nonzero coefficients using lossless arithmetic coding. Algorithmic checks within the FFT and arithmetic encoding and decoding operations are augmented with additional features between and across several subsystems involved in compressing and transmitting the FFT data. End-to-end error detection is achieved in this manner.

关键词： FFT protection fault-tolerant lossy compression protected arithmetic coding run-length coding remote-sensing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：