最優解圖 的英文怎麼說

中文拼音 [zuìyōujiětú]
最優解圖 英文
optimal solution graph
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 解 : 解動詞（解送） send under guard
  • 圖 : Ⅰ名詞1 （繪畫表現出的形象; 圖畫） picture; chart; drawing; map 2 （計劃） plan; scheme; attempt 3...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 解圖 : decomposition
  1. Aiming at multiple frames video sequences with moving objects, a new image mosaic method imitating compound eyes is presented based on image ' s characteristic. now. some mosaic algorithms are local optimizing

    兩種方法克服了現存的圖像拼合演算法只能得到局部最優解的缺點，對圖像樣本的要求大大降低，而且可以得到全優解。
  2. This dissertation deals with the content - based image retrieval ( cbir ) theory and technique ; some new features and tools for more concisely and discriminatingly charactering the content of an image are proposed, such as region - based color histogram, grey - primitive co - occurrence matrix, ratio of centripetal moment, ratio of eccentric moment and ratio of inertial moment. a new modified genetic algorithm is also described in this dissertation, which can upgrade the performance of standard genetic algorithm ( sga ) while used in image segmentation

    本文以圖像數據庫檢索為主線，討論了基於視覺內容的圖像檢索方法，提出包括基於區域顏色直方圖、灰度?基元共生矩陣及向心矩比、偏心矩比、慣性矩比的特徵描述方式；對遺傳演算法存在的早熟、收斂到最優解慢等問題提出了解決方法，並將改進遺傳演算法應用到圖像分割中，編制了相應程序。
  3. We show that under the consideration of discounted factor, jobs in the p - maximal initial set / * of module m should be processed prior to other jobs in module m, and the schedule is the optimal if the jobs in i * are n ' t be preempted by the jobs in n i *. this result is a extension of lawler ' s method for minimizing total weighted completion time with a series - parallel precedence

    證明了在考慮折扣因子的條件下，模塊m的因子最大初始集合i中的任務優先於模塊m中的其他任務，並且被連續加工所得的排序為最優排序：該結果推廣了lawler用來求解約束為串並有向圖的單機加權總完工時間問題的由底向上搜索分解樹的方法。
  4. The content of the thesis include many scientific fields, such as nautical mathematics, apparatus, ship navigate, communication, artificial intelligence, computer graphic, graphic management and so on. the function of route planning and advanced navigation in the system is based on electronic nautical chart. it bring forward the grid model in route planning, during the course of route planning, it provide ways to settle all kinds of instance ; it figures out the best head bearing of the ship with the real time transfer data from navigation apparatus to the system, accomplish the advanced navigation function in ecdis

    該系統是在電子海圖基礎平臺上來完成航線設計和最優航法功能的，提出了在電子海圖中利用網格模型來進行航線設計的方法，在求取最優航線的過程中，全面綜合地考慮了各種可能出現的情況，並逐一解決；最優航行方法中採用實時獲取船舶導航儀器傳入到系統中的數據，並根據這些數據進行計算，給出船舶當前最佳船艏向，實現基於電子海圖顯示與信息系統的最優航法。
  5. Considering the np - complete problem, how to get the approximate optimized scheme of job - shop scheduling, and aimed at improving the efficiency of products and taking good advantage of concurrence, asynchronism, distributing and juxtaposition in multi - products and devices processing, we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop, that is the working procedures are divided into two types, then the bf and the ff methods about memory scheduling in os are applied, therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling. namely, the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it. the results we analyzing and tested show that it is better than the heuristic algorithm common used, for less restriction terms, more satisfying algorithm complexity and better optimized results

    針對job - shop調度問題求最優解演算法這一npc問題，本文以充分發揮多產品、多設備加工所具有並發性、異步性、分佈性和并行性的加工優勢，從而提高產品的加工效率為目標，對job - shop調度問題的工藝圖進行適當分解，使工序在一定時間段或是為具有唯一緊前、緊后相關工序或是為獨立工序，即將工序分兩類，再結合操作系統中內存調度的最佳適應（ bf ）調度方法和首次適應（ ff ）調度方法的先進思想，通過分析提出了一種解決一般job - shop調度問題的全新近優解方案：在考慮關鍵設備上工序盡量緊湊的前提下，將工序分類、對這兩類工序分批採用擬關鍵路徑法（ acpm ）和最佳適應調度方法（ bfsm ）安排工序的演算法，用實例加以驗證，並給出結果甘特圖。
  6. On one hand, from the technique of constrained least squares and limited energy of additive noise, an effective restored approach by adopting regularization method to overcoming ill - posed problem, solving an equation with a single variable, and using space iterative algorithm is proposed ; on the other hand, aiming at the restoration of blurred image, another effective restoration approach based on least - square algorithm is also proposed in this paper. this method firstly adopts increment iterative algorithm to improve convergence and meanwhile applies regularization technique to overcome ill - posed problem. in the computations, the regularized parameter has its adaptive character, which can be determined in terms of the restored image at each iteration step therefore automatically correct to the appropriate value

    一是從約束最小二乘出發，在加性噪聲能量有界的前提下，採用正則化方法來克服病態問題，通過解一個單變量方程，並利用空域迭代運算實現了一種有效的圖像復原;二是針對模糊圖像的復原問題，從最小二乘演算法出發，採用增量迭代的方法改善演算法的收斂性，同時結合正則化技術克服問題的病態性質，並引入自適應的正則化參數，使其與圖像復原的迭代運算同步進行並自動修正到最優值。
  7. This dissertation is faced to the process of steel rolling to found network of manufacture material flow, basing on it founding guide line evaluation system of the cost of unit standard producing working procedure, guide line evaluation system of the quality cost of unit standard producing working procedure and guide line evaluation system of performance and efficiency ; and base on the cost data of all kinds of material flows, manufacture flow, flux data, manpower, energy consume, material consume, capital asserts occupied, fund occupied, and the production in working procedure, throughput of the materials in working procedures in the flow and countercurrent flow in the network of material flow of recorded in working procedure producing, using the “ whole closed down lane ” model to describe network of manufacture material flow of steel rolling, found the cost analyzing model system of the network faced to producing process. make the cost increasing of the producing by abnormity material flow in working procedure, and even the cost increasing of the producing procedure as the cost of the management behavior of working procedure fallen under cost evaluation guideline in responsible working procedure, so as to ration measure the factors fast correlated with management behavior by measuring the cost

    在企業管理信息化輔助工具所建立的數據平臺基礎上，建立了以基準物流圖模型為基礎的軋鋼生產主流程物流網路拓撲圖，根據圖論的理論求解最大流量和最小費用;計算每個生產節點的加工成本，分離質量成本，克服了單純財務數據進行成本核算所帶來的缺陷;建立了軋鋼生產主流程工序含鐵物料吞吐能力基準圖模型，並根據此模型建立了軋鋼生產主流程工序激勵物流協調性和匹配性、工序響應物流協調性和匹配性分析的過程能力指數計算方法;通過引入決策單元綜合投入與綜合產出效率最優原則的模型和基於投入不變、分析產出是否有效或基於產出不變、分析投入是否有效的模型，實現了對多個績效指標在不同績效值集合之間的相對比較，並可根據投入產出效率準則、或者投入（產出）有效性準則進行排序。
  8. ( 5 ) a series of design methods of classifiers are proposed, including the classifier based on the generalized inverse and the probabilistic reasoning method ( prm ), a new self - adaptive kohonen clustering network which overcomes the shortcomings of the conventional clustering algorithms, and the fuzzy neural classifier. the experimental study efface recognition is presented based on the combination of multi - feature multi - classifier. ( 6 ) this paper proposes a hybrid feature extraction method for face recognition, which is a combination of the eigen matrix, fisher discriminant analysis, and the generalized optimal set of discriminant vectors

    （ 5 ）對圖象分類器設計方法進行研究，主要包括：提出了一種基於廣義逆和概率推理的分類器設計方法；提出了一種新的自適應模糊聚類演算法；提出了基於模糊神經網路的分類器設計方法；並對多特徵多分類器組合方法在人臉識別中進行實驗研究； （ 6 ）提出了一種只要一個訓練樣本就能解決人臉識別問題的新方法，該方法結合了特徵矩陣、 fisher最優鑒別分析和廣義最優鑒別分析方法的優點。
  9. Aimed at the current problem of pipeline layout optimization technique, the research of irrigation pipeline layout and pipe diameter optimization has been done, the gis ( geography information system ) and graph theory were first put forwarded to applyed to the design of low pressure pipeline irrigation project in the paper. with the support of gis, the minimal spanning tree theory of graph theory and 120 project theory can be applied to irrigation pipeline ' s layout optimization. at the aspect of pipe diameter optimization, simplicial method and interior - point method are been used in solve liner optimization model of pipe diameter to reach minimum project cost or a nnual working cost of low pressure pipeline irrigation

    本文主要針對當前南方地區低壓管道輸水灌溉規劃設計中存在的技術難點，開發研究先進實用的樹狀低壓輸水灌溉管網計算機輔助設計系統。首次提出了將gis （地理信息系統）和圖論技術應用於低壓管道輸水灌溉規劃設計及灌溉管網優化中，在gis支持環境下，應用圖論中的最小生成樹法和120規劃進行管道的最優化布置。建立以管道輸水灌溉系統的年折算費用最小為目標函數的管徑優化線性規劃模型，並將內點法應用於線性優化模型的求解。
  10. Qga combining the genetic algorithm and the quantum information theory has a large search space with small population and a good global search capability, while image sparse decomposition based on mp is an optimal problem, so it can be fast solved by qga

    量子遺傳演算法能用較小的種群規模實現較大的空間搜索，全局尋優能力強，基於匹配追蹤的圖像稀疏分解是最優化問題，因此可用量子遺傳演算法快速實現。
  11. ( 3 ) a series of new methods of feature extraction based on the generalized optimal discriminant analysis are proposed, including the improved algorithm based on guo ' s algorithm calculating the generalized optimal set of discriminant vectors, the analytical algorithm of solving generalized optimal set of discriminant vectors which is the complete solution of the generalized optimal set of discriminant vectors, and the new algorithm of feature extraction based on the generalized kl transformation which enjoys the advantaqges of higher recognition rate and the lower computational load. furthur more, we have proposed the relationship between the generalized kl transformation and the generalized optimal discriminant transformation, a new explanation of generalized kl transformation has been obtained

    （ 3 ）提出了基於廣義最優鑒別分析的圖象特徵抽取的一系列新方法，它們包括： guo廣義最優鑒別矢量集演算法的改進方法；廣義最優鑒別矢量集的解析演算法，徹底解決廣義最優鑒別矢量集的求解問題；提出了基於廣義k - l變換的特徵抽取方法，並從理論上揭示了基於廣義k - l變換的特徵抽取方法和基於廣義最優鑒別準則的特徵抽取方法之間的關系。
  12. A novel method of content - based image segmentation using deformable template matching is proposed. a two - dimensional ( 2 - d ) deformable template based on orthogonal curves is built by pre - computing extensions of the deformable template along orthogonal curves and sampling the curves uniformly. then the definitions of internal and external energy functions are given according to the image segmentation problem, and genetic algorithm is used to obtain globally optimal solutions. the proposed method uses a lower - dimensional search space than conventional methods and reduces the sensitivity of the algorithm to initial placement of the template. experiments on real - world images and in simulations at low signal - to - noise ratio show the robustness and good performance of the method

    本文提出一種採用可變形模板匹配技術進行基於內容的圖像分割演算法.通過預先計算出可變形模板沿著變形的正交曲線，並對模板曲線及正交曲線進行離散抽樣，建立一基於正交曲線的二維（ 2 - d ）可變形模板，針對圖像分割問題定義控制可變形模板進行變形的內、外部能量函數，本文採用遺傳演算法搜索能量函數最小的全局最優解.該新演算法比傳統的可變形模板匹配方法降低了搜索空間的維數，減少了演算法對模板初始位置的敏感.對實際圖像及模擬低信噪比圖像處理的結果表明，新演算法具有良好的分割精度及穩定性
  13. Because of the np complexity of mapping problem, the thesis studies two - step method : optimal scheduling of data flow graph and optimal processor mapping

    考慮到演算法映射問題的np復雜度和求解時間的指數性增加，本文主要研究兩步規劃方法，即先進行數據流圖的最優規劃，然後進行處理器的映射。
  14. Taking attributed scattering center - based classification as example, the computation of feature likelihood function under many - many and 1 - 1 correspondence are studied, by using the algorithm of bipartite graph perfect matching to find the optimal 1 - 1 correspondence, the computation efficiency is improved greatly, the relations of likelihood function between 1 - 1 and many - many correspondence are analyzed, and two sub - optimal methods of calculating the likelihood function of 1 - 1 correspondence are presented

    本章以基於屬性散射中心特徵的分類為例，深入研究了多?多對應和1 ? 1對應特徵似然函數的計算，通過將求解二分圖最佳匹配的演算法用於尋找特徵之間的最優1 ? 1對應關系，有效提高了1 ? 1對應特徵似然函數的計算效率，分析了1 ? 1對應和多?多對應特徵似然函數之間的關系，給出了兩種次優的1 ? 1對應特徵似然函數計算方法。
  15. ( 2 ) a series of new methods of feature extraction based on the optimal discriminant analysis are proposed, including the new lda algorithm based on the spectral decomposition of within - class scatter matrix sw which is effective when the number of class is small, an improved algorithm of optimal set of discriminant vectors based on the svd which is effective for face recognition, and the kernel fisher discriminant method ( kfdm ). experimental results on orl show that the kfdm outperforms conventional fisher discriminant methods in face recognition, however the computational load is much higher than those of conventional algorithms

    （ 2 ）提出了基於最優鑒別分析的圖象特徵抽取的一系列新方法，它們包括：基於對類內矩陣s _ w進行譜分解的f - s最優鑒別矢量集方法，該方法在類別數比較小時非常有效；一種改進的基於svd的最優鑒別矢量求解演算法，將該方法用於人臉識別時有較好的性能；非線性最優鑒別矢量集方法，該方法雖然有效，但計算時間較長。
  16. Then a new system of nonlinear equations can be formed from the variation gray of same point in multiple images and the optimum solution of the system can be obtained from gauss - newton and levenberg - marquardt algorithms, so that the normal vector at that point of the surface can be defined

    再根據多幅圖像上固定位置一點的灰度值變化列多個非線性方程，以gauss - newton演算法和levenberg - marquardt演算法為基礎求非線性方程組的最優近似解，將選取點的法向量確定下來。
  17. For video images with moving objects, an optimal stitching line was found by heuristic optimal path search algorithm in mosaics of images, and the images were smoothed by multi resolution theory after mosaics of images

    對存在運動物體的視頻圖像，採用啟發式最優路徑搜索演算法尋找到圖像間拼接的最佳縫合線，並使用多解析度原理進行圖像拼接后的平滑處理。
  18. Nowadays, the popular image segmentation methods almost take part in the time space of the image, but in this paper, the processed images are transformed form time space to frequency space. thus avoid dealing with isolated pixels in the image, and use correlated phase function as the judgment rule to search for the optimal threshold value from the global solution space

    目前，大多數圖像分割方法都是在時域進行的;本文將圖像從時域變換到頻域，避免了對圖像中每一個像素進行單獨處理，使用了相位相關性函數作為評價函數，全局搜索最優解。
  19. A kind of heuristic information based on the dannenbring approach is introduced in the procedure of solution construction. the experiment shows that the stagnation step out mechanism and the pheromone trail limit mechanism can help ants stepping out of stagnation and the heuristic information is very effective, in addition, the eligibility trace mechanism in ant - q ( ) algorithm can greatly improve the performance of algorithm based on solution construction graph in arc mode

    模擬試驗表明，信息素的結點模式總體優于孤模式；啟發式信息能較大改進演算法性能； acostag演算法的信息素蹤跡更新過程中的停滯狀態脫離機制以及信息素蹤跡限制機制能幫助螞蟻跳出局部最優解；此外antqo ）演算法的資格跡機制能大大改進採用弧模式解構造圖的蟻群演算法性能。
  20. To make it clear, the article use and analyze numerical value cases from bellmum and zadeh. finally in order to work out the value function in all forms and the expected value of optimization in all aspects easily, we take down all the problem existing in multi - stage stochastic decision processes. the solution of optimum is formed and multi - stage stochastic decision tree - table is introduced

    為說明問題，本文利用bellman和zadeh [ 1 ]的數值例，應用兩種方法進行分析，最後為了更方便的解出對所有形式的評價函數，及其期望值的最優化解對各種進行的發展，把經過多階段概率決策過程的問題記述下來，構成一個最優解的統一圖表，引入了多段概率決策樹表。
分享友人
分享到 Line

分享到臉書