full search algorithm 中文意思是什麼
full search algorithm
解釋
窮盡搜索演算法-
The traditional codeword search algorithm ? full algorithm ( fs ) has a serious disadvantage, whose computation quantity will rise sharply with the increase of the codebook size and the codeword dimension
傳統的碼字搜索演算法? ?窮盡搜索演算法會隨著碼書規模的增大和碼字維數增加，計算量急劇增加。 -
This has brought heavy computation burden when it is applied to compress the hdtv high definition television content. based on the original ffsbm fast full search blocking matching, this paper proposes an improved ffsbm algorithm to adaptively reduce the complexity of motion estimation according to the actual motion intensity. the main idea of the proposed algorithm is to use the statistical distribution of mvd motion vector difference
為了提高壓縮效率， avs採取了可變塊大小的運動補償技術，一個宏塊可以被進一步劃分為四種塊大小， 16x16 ， 16x8 ， 8x16 ， 8x8 ，這樣一個16x16的宏塊中總共會被劃分成9個不同的分區，每個分區獨自地進行運動估計，這使得運動估計成為了avs編碼器中復雜度最高的一部分。 -
Firstly, based on conventional vq, a fast algorithm named equal - sum block - extending nearest neighbor search ( ebnns ) is presented, which not only can achieve the reconstructed image of full search algorithm but also can greatly reduce both the codeword search ratio and chip area. in order to improve coding efficiency, a new algorithm called correlation - inheritance coding is proposed, which is embedded in conventional vq system to improve compression ratio by re - encoding the indexes
首先，在普通矢量量化基礎上提出了等和值塊擴展最近鄰快速碼字搜索演算法（ ebnns ） ，該演算法在圖像畫質達到窮盡搜索演算法的前提下，大大降低了碼字搜索率和硬體實現面積；為了提高編碼效率，在相關性編碼方面，提出了相關繼承編碼演算法，對普通矢量量化后的編碼索引進行無損重編碼。 -
Then, in order to reduce the coding time of each image vector, a fast algorithm based on mean - order - search is proposed. the simulation results of this algorithm show that its coding speed is twenty times faster than that of full search algorithm ( fs ), but its reconstructed image is badly ruined
其次，為減少每個矢量的編碼時間，提出一種基於均值排序碼書的快速搜索演算法，測試結果顯示，該演算法編碼速度是窮盡搜索演算法的二十多倍，但是恢復圖像的質量大大地降低了。 -
Based on the anti - counterfeit marking images contrast of nuclepore, design of the spiral - search algorithm was proposed, as compared with the full - search algorithm, which improved search efficiency, and shortened the time over
基於核孔膜防偽標識的圖像比對，提出了螺旋型搜索演算法，相對于全搜索演算法提高了搜索效率，縮短了比對時間。 -
As a straightforward method, the full search algorithm ( fs ) is widely used because of its high performance. usually, fs is computationally expensive in a video encoder. as a result, in order to reduce the heavy computational load of fs, active research has focused on fast bmas for a long time and several sub - optimal search algorithms for block - based motion estimation have been developed. these include : three step search ( tss ), four step search ( fss ), two - d logarithmic search, orthogonal search, cross search, etc
目前塊匹配運動估計演算法有很多，如全搜索法、三步法、共軛方向搜索法、二維對數搜索法、交叉搜索法、鉆石搜索法以及四步搜索法等，它們各有優缺點，全搜索法精度高，但計算量大，三步搜索法和交叉搜索法搜索速度較快，但搜索誤差較大，容易陷入局部最小值。 -
Secondly we analyze the process of motion estimation and compensation. we use nearest - neighbors search ( nns ) algorithm, instead of full search algorithm, to reduce search times with little degradation. we use sad as block match function, due to the appropriate computation and easy hardware implementation
其次分析了運動估計與補償過程，採用最鄰搜索作為搜索策略，在搜索質量下降很少的前提下，大大減少了搜索次數；採用適于硬體實現且計算量適中的sad作為塊匹配準則函數。 -
In the method of image contrast, the full - search algorithm to search for the high precision, but is not suitable for real - time occasion because of the great amount of calculation
摘要在圖像比對方法中，全搜索演算法搜索的精度高，但是由於計算量巨大不適用於實時場合。 -
This thesis introduces the background about this system and solving path at first ; then emphasises to describe ideas and implementation of clustering - algorithm ; furthermore expands on the characteristics and flows of each module ; analyses how to establish security policies ; finally summary full text, and suggest further works, otherwise, it also make point of personalizing hyperlinks and personalizing search - engines based on web data mining, making personalizing application more integrate
本文首先介紹了論文所提問題的背景和解決途徑；然後說明了本系統的概念定義和目標；重點介紹了系統中聚類演算法的思想和實現；進而詳細闡述了系統各個功能模塊的特徵和流程；分析了如何通過服務器日誌建立安全策略；最後進行了總結，並提出了下一步的工作。此外，論文提出了個性化引擎、個性化鏈接與web數據挖掘的結合，使個性化應用更加全面。 -
In system design, we present dispatcher tactics of member search engine that user fond of. these member search engines on the basis of mobile agent, which provide an environment for parallel processing, take full advantage of ontology which expands the requirement of users to the semantic words set and provide the document analyzer that can filter the web pagers returned by the search mobile agent according to the certain algorithm. consequently wiirs presents the most relevant documents to the user
為提高系統的性能和易用性，還給出了基於用戶偏好的成員搜索引擎的調度策略，在成員搜索引擎系統結構中，不僅利用本四川大學碩士學位論文體論中概念規范、語義豐富的特點，將用戶的檢索要求擴充成語義集，並且將檢索到的文檔通過文檔分析器進一步過濾，最終得到與用戶檢索要求內容匹配度較高的文檔，而且提供了一個并行處理的環境來顯著提高搜索效率。 -
First, the related biological theories are introduced ; then, the whole algorithm is described in detail ; finally, the results of computer simulation and a comparison with the full search method ( fsm ) and the three - step search method ( tss ) are given
介紹了有關的理論知識，闡述了整個演算法，給出了計算機模擬結果，並與全局法和三步法作出了比較。 -
The optimal solution could be obtained with full search algorithm, but its realization needs massive computation
採用全搜索演算法可以得到最優解，但是它的實現需要大量的運算。 -
In mrme, coding of intra - frame and inter - frame are done in wavelet decomposition domain. mrme costs much less time to perform motion estimation operation compared to block matching motion full search algorithm ( fsa )
該方法可保證幀內、幀間編碼過程始終在小波分解域內進行，運動估計運算量比塊匹配全搜索法小得多。 -
Genetic algorithm ( ga ) is a sort of efficient, paralled, full search method with its inherent virtues of robustness, parallel and self - adaptive characters. it is suitable for searching the optimization result in the large search space. now it has been applied widely and perfectly in many study fields and engineering areas
遺傳演算法作為一種求解問題的高效并行的全局搜索方法，以其固有的魯棒性、并行性和自適應性，使之非常適于大規模搜索空間的尋優，已廣泛應用許多學科及工程領域。 -
Block motion estimation using full search is computationally intensive, many fast algorithm have proposed to reduce the computation at the expense of less accuracy of motion estimation. in this paper, we present a new fast and efficient search algorithm for block motion estimation. the proposed algorithm is based on the ideas of predicted starting search point, subsampled block distortion measure, center - biased distribution of motion vector, multiple - candidate diamond search. from the experimental results, the proposed algorithm is superior to many other well - known fast algorithms in both quality performance and computational complexity
演算法採用多步搜索方法，利用相鄰塊之間的運動相關性，選擇反映當前塊運動趨勢的預測點作為初始搜索點用子采樣塊匹配失真度量來減少計算量利用運動矢量的中心傾向的分佈特性，用多侯選點鉆石形狀搜索方法來提高運動估計的速度和準確性。
分享友人