閾值編碼 的英文怎麼說
中文拼音 [yùzhíbiānmǎ]
閾值編碼
英文
threshold coding- 閾 : 名詞1. [書面語] (門坎兒) threshold; doorsill2. (界限; 范圍) threshold
- 編 : Ⅰ動詞1 (編織) weave; plait; braid 2 (組織; 排列) make a list; arrange in a list; organize; gr...
- 碼 : Ⅰ名詞(表示數目的符號或用具) a sign or object indicating number; code Ⅱ量詞1 (指一件事或一類的...
- 編碼 : encoded; code; coded; encrypt; codogram; coding編碼表 encode table; 編碼程序 builder; 編碼尺 code...
-
The fifth chapter use huffman coding method of the row difference data and lifting wavelet transform and spiht ( set partitioning in hierarchical tree ) coding method to realize the diagnostically compression of mfl data by judging the significance of data using changing threshold and dynamic area threshold of mfl data
在第五章通過數據變化閾值和數據動態范圍閾值判斷數據重要性,分別採用行差分數據的霍夫曼編碼方法以及提升小波變換和層次樹集分割( spiht )編碼方法實現了數據的檢測無損壓縮。The principles of erasure codes used under binary erasure channels are summarized and erasure codes which belong to standard classes of rs codes are introduced with emphasis on cascaded low - density erasure codes with linear time encoding and erasure recover algorithms. thresholds of regular degree distributions are analyzed. it is shown that low - density erasure codes based on ( d, 2d ) - regular sequences of degree distribution are not close to optimal ( d 3 ). two pares of irregular degree distribution sequences are introduced and a pare of improved right regular sequences of low - density erasure codes are presented, it is testified that the new sequences are asymptotically quasi - optimal. in the meantime, simulations of cascaded low - density erasure codes based on a few types of special sequences of degree distribution available are given, together with performance analyses on these codes
闡述了應用於刪除通道下的糾刪碼基本原理,介紹了兩類標準的rs碼類糾刪碼,重點分析了具有線性時間編碼和恢復演算法的漸近好碼?級聯型低密度糾刪碼,分析了正則度分佈的閾值,對正則低密度校驗碼在刪除通道下的糾錯性能進行了模擬,從理論上證明了基於( d , 2d ) -正則度序列的低密度糾刪碼都不是漸近最優碼( d 3 ) ,同時還分析了非正則低密度校驗碼的度序列設計,基於右邊正則序列提出了一種改進型右邊正則序列,證明了此序列為漸近擬最優的,對基於幾類現有典型度分佈序列的級聯型低密度糾刪碼進行了模擬模擬及性能分析; 3So this part is dealt with separately. dcpm method is employed to improve the quality of image coding with making full of the relativity of the wavelet coefficients. according to the different importance degree and vision character of the high frequency wavelet coefficients, different thresholds are applied to remove small coefficients ; then mannos module are applied to remove the visual redundancy ; in order to produce more zero - tree, horizontal and vertical wavelet coefficients are transformed accordingly to improve the compression ratio
對于小波變換后的小波系數的高頻部分,根據其分佈特性和人眼的視覺特性,採用視覺模型對零樹量化過程的閾值進行修正,有效地去除視覺冗餘;對各高頻子圖採用多級樹集合分割的零樹編碼方法,有效地利用系數編碼剩餘符號,進一步提高壓縮比。3. tracking algorithm for curves, including the method for gray threshold combining space information, lag structure which was used to compress well - logging data during compressing and a progressive - completing method for curves tracing
3 .曲線跟蹤演算法,包括結合空間分佈信息的大津閾值方法、基於行程編碼的圖像無損壓縮演算法和逐步完成的曲線跟蹤方法。One is to use fourier transformation to convert the source signal from time domain to frequency domain and to discard high frequency harmonious components upwards of 19 ( gb / t14953 - 93 d5. 3 demanding ), then to have static huffman coding to the quantized char array which is composed of reserved direct current component and basic wave and each high frequency " s amplitudes and angles. the other is to use discrete wavelet transformation to convert the source signal from time domain to frequency domain and to set the high frequency coefficients that its absolute value is smaller than the given threshold to zero, then to have dynamic huffman coding to the quantized char array which is composed of multiple, wavelet ' s level, datum length, low frequency coefficients and reserved high frequency coefficients. mass simulinks and analyses under the two circumstances have done to show that data compression ratio is small and the relative error is also small and within the permission of engineering and the compression problem can be solved in theory of measured datum of power system
第一種情況的壓縮方法為:採用傳統的傅立葉變換把原始信號從時間域變換到頻率域,舍棄20次及其以上的高次諧波成分(保證了gb / t14953 ? 93d5 . 3要求) ,然後對保留的直流分量、基波和各次諧波的幅值和相角數據量化后和量化時分別乘以的倍數系數構成一個數組,以字元形式保存,採用靜態huffman編碼對變換數據進行壓縮;採用離散小波變換把原始信號從時間域變換到頻率域,然後對分解得到的高頻系數進行閾值量化處理,對乘以的倍數系數、小波變換的階數、小波變換后的低頻、各級高頻以及原始數據長度、量化后的低頻系數以及保留的高頻系數大小、位置構成一個數組,以字元形式保存,採用動態huffman編碼對這個文件進行壓縮。For the first problem, we overcome the limitation of binary code algorithm based on threshold value, which is popular used now, we presented the binary code algorithm based on the statistical information of neighbour region
對于輸入編碼問題,針對目前常用的基於閾值的二值法的局限性,我們提出了基於鄰域統計信息的峰值檢測演算法。However, most of the current wireless networks still work in low bandwidths, and mobile devices still suffer from weak computational power, short battery lifetime and limited display capability. therefore, this thesis deals with developing a very low bit - rate bi - level video coding technique, which can be used in video communications almost anywhere, anytime on any device as follows : ( 1 ) convert true color video sequences from ccd and video card to grayscale ones, ( 2 ) detect static region of successive frames by the sum of absolute differences ( sad ) and update current frame using static region of previous frame, to decrease flicker. ( 3 ) threshold the images to bi - level video sequences using ridler ' s iterative selection
為此,本論文在傳統h . 26x和mpeg - x等視頻編解碼技術的基礎上提出了一種新的基於輪廓的視頻編解碼方案,步驟如下: ( 1 )先把從ccd攝像頭捕捉到的視頻幀序列轉換成灰度幀序列, ( 2 )在灰度幀序列的基礎上通過sad演算法找出相鄰幀的靜態區域,用前一幀的靜態區域更新當前幀的相應區域,這樣可以降低畫面閃爍, ( 3 )然後用灰度直方圖迭代所產生的閾值二值化圖像,生成基於輪廓的視頻幀序列, ( 4 )最後運用基於上下文的算術編碼技術對由第三步生成的二值化視頻幀序列進行算術編碼。The method includes split originality image region, filter, separately coding the lowest frequency sub - band coefficient, adaptively setting threshold of different image region, setting up flag matrix, and filtering after decoding to eliminate domino effect of split
這種編碼方法主要包括:對原始圖像進行分塊、濾波;對最低頻子帶系數單獨編碼;對各塊圖像自適應地進行閾值設置;設立標志矩陣;解碼后進行濾波消除分塊效應。Motion compensated prediction error image has significant amplitudes mainly along the boundaries of moving objects, correspondingly its wavelet coefficients contain large energy in high frequency bands. this greatly reduces the coding efficiency of ezw. it is first provided that the correspondence between the significant amplitudes area of the mcp error image and the wavelet coefficient significant map, then encode the significant map efficiently using quadtree approach, followed by bit - plane coding the significant coefficients to produce an embedded data stream. experiment result shows that compared to ezw and zte, the proposed algorithm is more efficient and has better performance
演算法對于運動補償余量誤差幀首先進行小波變換,並選取適當的閾值,用重要圖表示大於該閾值的重要系數。根據殘差幀小波系數的統計特性,用四叉樹方法編碼重要圖,並對重要系數作位面編碼,生成嵌入式碼流。實驗表明,與ezw , zte等演算法相比較,該演算法編碼效率高,復現圖像質量好。Coding based upon image threshold segmentation related with coordinates, using windows crossover method, designing evaluation function based upon the equations given in literature [ 23 ], gas gets much better results than traditional algorithm
本文以基於坐標的閾值分割方法為基礎進行二維整數編碼,採用窗口交叉方法,以文獻[ 23 ]給出的評價方法構造適應度函數。The paper analyzes binary - split gradient & threshold initial codebook generation - algorithms, codebook generation algorithms based on kohonen self - organizing feature map neural network, a fast codeword searching algorithm using l2 - norm pyramid data structure, side - match vector quantization algorithms, and a fuzzy classified vector quantization algorithm, systematicly explores their application to image compression, computer simulation results show that they are practical and efficient
文中重點分析了二元分裂梯度與閾值初始碼書生成演算法、基於kohonen自組織特徵映射神經網路的碼書生成演算法、基於l2范數金字塔數據結構的快速碼字搜索演算法、邊緣匹配矢量量化演算法、模糊分類矢量量化演算法,系統地研究了它們在圖像壓縮編碼中的應用,並進行了計算機模擬,實驗結果表明這些演算法是實際有效的。The background and research situation of ldpc codes are presented and the current research results are introduced in the first part of the thesis. graph presentation and sum - product algorithm are interpreted in detail. linear coding theory and efficient constructing methods on ldpc codes are systemically interpreted later
系統地闡述了ldpc碼的圖模型表示方法及基於圖模型的譯碼原理;詳細地介紹了ldpc碼的構造方法及其線性編碼理論;介紹了用於ldpc碼閾值分析和度序列設計的密度進化理論; 2With this method, the compressed bit - streams, which are encoded by dct - based encoding algorithm, can be processed directly to locate the character - regions in the images, just a very small amount of decoding is required so, the amount of data which want to process is smaller, the processing speed is faster and the demand of computer memory is less
文獻中將此模型用在以dct為編碼基礎壓縮數據上,效果較好。本文將其演算法中的能量定義利用塊間的信息重新定義,並且採用自適應動態閾值對原演算法進行改進。對比實驗結果表明,改進的方法對圖像字元定位比原方法準確率更高,漏檢情況有一定程度的降低,取得了較好的效果。分享友人