通用掃描演算法 的英文怎麼說

中文拼音 [tōngyòngsǎomiáoyǎnsuànfǎ]
通用掃描演算法 英文
general scanning algorithm
  • 通 : 通量詞（用於動作）
  • 用 : Ⅰ動詞1 （使用） use; employ; apply 2 （多用於否定: 需要） need 3 （敬辭: 吃; 喝） eat; drink Ⅱ名...
  • 掃 : 掃構詞成分。
  • 描 : 動詞1. （照底樣畫） copy; depict; trace 2. （在原來顏色淡或需改正之處重復塗抹） retouch; touch up
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 通用 : be in common use; be current; apply or be used universally
  1. The watermark algovithm can resist the physical transfer of printing and scanning by applying techniques such as fixation normalization mutually which can secure the embedding position, chaotic encipher encryption, multipassage embedding and so on. what ’ s more, the watermark designed in this essay is binary image. it can bear a large amount of information

    本文綜合運用了歸一化相關確定嵌入位置、混沌加密、多通道嵌入等技術，使得本文所設計的水印演算法能夠抵抗印刷和掃描的物理轉換過程，同時本文所採用的水印是二值圖像，能夠承載大量的信息。
  2. It takes use of pseudo - random technology, dynamic adaptive technology, multi - channel technology, random position embed technology and so no. so the digital watermarking can resist the physical process of printing and scanning. at the same time, the watermark is binary image which includes a great deal of information, such as personal id, secret information, even a piece of map

    本文特別針對印刷和掃描給數字圖像帶來的誤差的問題，設計了一種新的水印演算法，綜合運用了偽隨機處理技術、動態自適應技術、不同應用選擇不用頻帶處理技術、隨機位置嵌入技術、多通道嵌入等技術，使得本文所設計的水印演算法能夠抵抗印刷和掃描的物理轉換過程，同時本文所設計的水印是二值圖像，能夠承載大量的信息，例如個人id 、機密信息、商標標識，甚至可以是一幅地圖。
  3. A popular solution toimprove the speed and scalability of the association rule mining is todo the algorithm on a random sample instead of the entire database. buthow to effectively define and efficiently estimate the degree of errorwith respect to the outcome of the algorithm, and how to determine the samplesize needed are entangling researches until now. in this paper, an effective and efficient algorithm is given based on the pac probably approximate correct learning theory to measure and estimatesample error

    關聯規則挖掘作為數據挖掘的核心任務之一，由於其任務本身的復雜性通常需要多次整個掃描數據庫才能完成挖掘任務且頻繁模式可能產生組合爆炸，使得從原始的大規模數據集上抽取一部分樣本，在其上尋找用戶感興趣的近似規則成為目前提高演算法效率和可擴展性的一種簡單有效的現實可行方法之一。
  4. After the orderly reduction methods of massive scattered data being studied, this paper proposes a partial tangent plane slicing method and a virtual second - scan line method after giving a new k - nearest algorithm to re - organize the massive data. the new proposed methods of data reduction and grey theory based unusual noisy data process can be used to generate the scan line type data and it can be directly used to reconstruct curves and surfaces. the research lays a good foundation for reconstructing the cad model in a point - line - surface manner

    4 .深入研究了海量散亂數據的有序簡化技術，在提出建立海量數據點鄰接關系k -鄰近新的演算法基礎上，提出了局部切平面切片法和虛擬二次掃描線法，實現了海量數據的有序重組，通過基於灰理論的數據簡化和異常點處理新方法，生成可用於直接重構曲線曲面的掃描線類型數據，為以點?線?面方式重構cad模型打下了良好的基礎。
  5. The second part brings forward a new ar - model - based arm detection method based on features of arm and characteristics of velocity and acceleration of the radar echoes. by establishing two - order ar models, this new detection method computes the poles of models representing different targets, thus estimates the acceleration of the targets so as to determine the nature of the targets. furthermore, this method can not only be applied when the arm is being tracked by radar, but also be put into use in radar ’ s seeking and scanning times

    第二部分則是根據反輻射導彈（ arm ）的特點及其雷達回波信號中速度、加速度等特徵，提出了一種新的基於ar模型的arm檢測演算法，該方法通過建立二階ar模型、估計代表不同目標的模型極點，並由此估算目標加速度來判斷目標性質，該方法不僅可以在雷達已跟蹤上arm后採用，而且適用於雷達搜索掃描時使用，模擬結果表明該方法具有解析度高，對雷達脈沖重復頻率（ pulserepetitionfrequency ， prf ）及積累脈沖數要求不高的特點，在低的prf及少的積累脈沖下，利用該方法仍可有效地識別檢測arm 。
  6. The simulation program was written by c and matlab on the base of arithmetic of non - then - back random walk. utilization of catalyst was obtained by statistical algorithm of ntbrw. we also discussed the effect the of structure and fabrication techniques of mea on utilization of catalysts

    確定了有效輸出電流迷宮通道模型，並建立了非即回無規行走掃描演算法，運用matlab和c語言編寫了模擬程序實現了對膜電極催化劑利用率的統計，並探討了電極結構和電極制備工藝對催化劑利用率的影響。
  7. An efficient algorithm qais is proposed that uses the efficient method to reduce database access activity, and present a novel algorithm aiu based on this algorithm, it is fit for mining association rules and incremental updating. it is especially effective in vldb, mining long patterns, and high support. the perfermance of qais / aiu is verified on the basis of synthetic data, experiments show that the proposed algorithm can mine association rules more efficiently by not generating candidate itemsets and reducing the redundancy of frequent itemsets while generating association rules

    然而目前大多數挖掘關聯規則的演算法往往必需多次掃描事務數據庫才能達到要求的目標，這樣重復性的數據庫存取動作將會導致過多的執行時問浪費在i o動作上，另外在頻繁集生成規則時現有的演算法沒有考慮到規則的大量冗餘，為了解決這個問題本文提出了一個不需要生成候選集同時有效的去除生成規則時產生大量冗餘的演算法qais ，來提高關聯規則生成的速度，並且在此演算法基礎上提出了新穎的關聯規則增量更新演算法aiu ，通過應用合成數據驗證了qais aiu演算法的有效性，由試驗結果來看這個方法確實能更有效且準確地獲得事務數據庫的關聯規則，尤其適合挖掘超大數據庫中高支持度下長模式的挖掘。
  8. Esign and implement the database connection pool, the general solution, the mend algorithm in outline of data model, the make - ring algorithm in outline, the area - scanning algorithm and the synchronized store and retrieve algorithm between dbms and file system in rp agent

    設計和實現了rpagent的數據庫緩沖池和rpagent系統的通用性解決方案，提出並實現rp數據模型中的輪廓線修復演算法、輪廓線組環演算法、分區掃描演算法和同步存儲演算法。
  9. The existing problem and solution for arithmetic of scan - line filling

    通用掃描線填充演算法存在的問題及其解決方法
  10. Later on, after elaborating the disadvantages of the old methods in detecting and recognizing moving objects, a series of corresponding approaches are proposed, such as grid scan, local tracking bug and dynamic window in object tracing to reduce the huge data needed to be processed, maximum and minimum for selecting a proper segmentation threshold and improved conversion from rgb model to hsv and so on to decrease the influence of inhomogeneous lighting and the color noise, a bilinear interpolation in each quadrant to eliminate the bad effect on the recognition precise because of the distortions of the camera. after that, much emphasis is given on application study in pattern recognition with a feed - forward neural network. both the basic bp algorithm and improved bp algorithm in the study process are described in detail, and the later is used to quicken convergence speed and improve validity of the network

    然後，分析和闡明了傳統的運動目標檢測方法的不足，並在此基礎上結合研究中的實際實驗環境，提出了一系列解決方法，包括針對降低龐大數據量而提出的網格掃描、局部「跟蟲」追蹤和動態窗口掃描等目標檢測方法，針對實驗環境中光照不均和顏色干擾提出基於人機交互的最大最小值閾值選取方法和引入改進的rgb模型到hsv模型的轉換方法，為消除圖像畸變對識別精度的惡劣影響而採用的通過控制點進行雙線性插值進行畸變校正的方法；緊接著，概述了神經網路的發展歷史和幾種常用神經網路模型的特點，重點研究了前饋型神經網路在模式識別中的應用問題，詳細闡述了基本的bp演算法和學習過程中bp演算法的改進，從而使網路收斂速度更快，解決問題更有效，並在此基礎上，設計了一個基於bp神經網路的運動目標識別系統，給出了實驗結果。
  11. We scan photographs of tissue slices to get 2d data and then these data are classified and transfer into 3d data which are saved into database. we do geometric construction by contour connection algorithm and render the tissue using volume data based on surface. some algorithms used widely are compared in this article and implemented in the experimental system : simulating lost datum by linear interpolation, adjusting surface profile by twice bezier interpolation, dealing with some special normalized vector

    通過掃描輸入的人體組織的切片圖象，獲得組織的二維信息，再將這些二維數據經過分類和轉換，把它們轉換成對應的三維體數據，在數據庫中保存：然後採用contourconnection演算法進行幾何重構，用三角面進行等值面擬合，實現基於等值面的體數據的三維圖像繪制。
  12. The proposed two layered wavelet tree structure can decompose the traffic data into each time scale and consume less space than traditional wavelet structure. an online single pass algorithm designed to detect burst can flexibly adjust the time scale of aimed bursts and the process time is not influenced by the threshold settings

    提出的兩層小波樹摘要數據結構將網路流量層次性地分解至各個時間尺度，相比普通小波摘要結構耗用空間更少，設計的在線單遍掃描演算法對突發異常時間尺度的檢測范圍能夠靈活調整，處理時間不受閾值設定的影響。
  13. The main contributions of this paper are as follows : we present an efficient algorithm for mining fuzzy frequent itemsets, called fmf. we use ffp tree structure to store frequent item sets imformation, and store ids of transactions related with fuzzy item in tree nodes. in fmf, we can count a fuzzy itemsets support through finding all trasactions including them. we needn ’ t to scan database all. to generate itemset { a } + x ( i. e

    本文的主要工作如下: （ 1 ）針對模糊頻繁集的挖掘問題，提出了一種有效的fmf演算法，在該演算法中採用ffp -樹結構，將與模糊項目相關的事務的序號保存到樹結點中。計算一個模糊項集的支持度，可以通過直接找到所有包含該項集的全部事務進行計算，而不必掃描整個數據庫。
  14. Author segments an image and then makes the text layer as roi of document image, then he compresses and reconstructs its all layers according to its own characteristic. author expects to obtain a higher compression rate than general image compression methods

    把分割出來的文本層作為興趣域，插圖層則相應的為非興趣域，然後針對掃描文檔圖像本身的特性對各層進行壓縮與解壓縮，以求達到比通用圖像壓縮演算法更高的壓縮比。
  15. Based on a lot of experiments, the statistics law of gps positioning data is found and the simple multiple digital filter algorithm that suits the single chip microco ntroller is adopted to optimize the positioning data. the positioning precision is improved effectively. according to the optimization result, the vertical scan line algorithm is used to discriminate the position status of navigation mark

    選用gps接收機採集航標的位置信息，通過大量的實驗總結出gps定位數據的統計規律，使用簡單的適合單片機使用的復合數字濾波法優化定位數據，有效提高定位精度，並根據優化結果，採用垂直掃描線演算法判別航標的位置狀態。
  16. The scanning lines of the image are permuted randomly to balance the energy distributing of the image scanning lines, then the watermark sequence is embedded in the image with the spread spectrum watermarking algorithm to produce the watermarked image

    提出基於像素置亂的數字水印穩健演算法。通過對圖像掃描行序列進行隨機置亂，以平均圖像掃描行序列頻譜能量，然後採用擴頻水印演算法嵌入水印序列。
分享友人
分享到 Line

分享到臉書