首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 156 毫秒
1.
2.
In this paper we propose a two-dimensional multiple maximum scatter difference (2DMMSD) method for face representation and recognition. The new algorithm is based on multiple maximum scatter difference (MMSD) discriminant criterion and image matrices projection technique. The 2DMMSD method does not need to transform image matrix into a vector prior to feature extraction so that it is computationally more efficient and accurate than MMSD in extracting the facial features. Experimental results on ORL and Yale face databases demonstrate the effectiveness and robustness of the proposed method.  相似文献   

3.
The time-dependent differential equations of elasticity for 2D quasicrystals with general structure of anisotropy (dodecagonal, octagonal, decagonal, pentagonal, hexagonal, triclinic) are considered in the paper. These equations are written in the form of a vector partial differential equation of the second order with symmetric matrix coefficients. The fundamental solution (matrix) is defined for this vector partial differential equation. A new method of the numerical computation of values of the fundamental solution is suggested. This method consists of the following: the Fourier transform with respect to space variables is applied to vector equation for the fundamental solution. The obtained vector ordinary differential equation has matrix coefficients depending on Fourier parameters. Using the matrix computations a solution of the vector ordinary differential equation is numerically computed. Finally, applying the inverse Fourier transform numerically we find the values of the fundamental solution. Computational examples confirm the robustness of the suggested method for 2D quasicrystals with arbitrary type of anisotropy.  相似文献   

4.
This paper presents panoramic unmanned aerial vehicle (UAV) image stitching techniques based on an optimal Scale Invariant Feature Transform (SIFT) method. The image stitching representation associates a transformation matrix with each input image. In this study, we formulate stitching as a multi-image matching problem, and use invariant local features to find matches between the images. An improved Geometric Algebra (GA-SIFT) algorithm is proposed to realize fast feature extraction and feature matching work for the scanned images. The proposed GA-SIFT method can locate more feature points with greater accurately than the traditional SIFT method. The adaptive threshold value method proposed solves the limitation problem of high computation load and high cost of stitching time by greater feature points extraction and stitching work. The modified random sample consensus method is proposed to estimate the image transformation parameters and to determine the solution with the best consensus for the data. The experimental results demonstrate that the proposed image stitching method greatly increases the speed of the image alignment process and produces a satisfactory image stitching result. The proposed image stitching model for aerial images has good distinctiveness and robustness, and can save considerable time for large UAV image stitching.  相似文献   

5.
Even though a very large number of solution methods has been developed for the job-shop scheduling problem, a majority has been designed for the makespan criterion. In this paper, we propose a general approach for optimizing any regular criterion in the job-shop scheduling problem. The approach is a local search method that uses a disjunctive graph model and neighborhoods generated by swapping critical arcs. The connectivity property of the neighborhood structure is proved and a novel efficient method for evaluating moves is presented. Besides its generality, another prominent advantage of the proposed approach is its simple implementation that only requires to tune the range of one parameter. Extensive computational experiments carried out on various criteria (makespan, total weighted flow time, total weighted tardiness, weighted sum of tardy jobs, maximum tardiness) show the efficiency of the proposed approach. Best results were obtained for some problem instances taken from the literature.  相似文献   

6.
Maximum Genus of Strong Embeddings   总被引:4,自引:0,他引:4  
The strong embedding conjecture states that any 2-connected graph has a strong embedding on some surface. It implies the circuit double cover conjecture: Any 2-connected graph has a circuit double cover.Conversely, it is not true. But for a 3-regular graph, the two conjectures are equivalent. In this paper, a characterization of graphs having a strong embedding with exactly 3 faces, which is the strong embedding of maximum genus, is given. In addition, some graphs with the property are provided. More generally, an upper bound of the maximum genus of strong embeddings of a graph is presented too. Lastly, it is shown that the interpolation theorem is true to planar Halin graph.  相似文献   

7.
将一种基于特征提取的ε-不灵敏支持向量机方法用于非线性系统辨识.对输入输出数据首先进行核主元特征提取,将特征提取后的数据作为支持向量机的训练数据.将该方法与基于主元特征提取的方法和直接应用ε-不灵敏支持向量机的方法进行含噪和不含噪情况下的仿真比较,结果表明,方法的拟合性能和抗干扰能力优于其他两种方法.  相似文献   

8.
A closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a cycle in the graph. The strong embedding conjecture says that every 2-connected graph has a closed 2-cell embedding in some surface. In this paper, we prove that any 2-connected graph without V8 (the Möbius 4-ladder) as a minor has a closed 2-cell embedding in some surface. As a corollary, such a graph has a cycle double cover. The proof uses a classification of internally-4-connected graphs with no V8-minor (due to Kelmans and independently Robertson), and the proof depends heavily on such a characterization.  相似文献   

9.
The traditional method of fundamental solutions (MFS) based on the “global” boundary discretization leads to dense and non-symmetric coefficient matrices that, although smaller in sizes, require huge computational cost to compute the system of equations using direct solvers. In this study, a localized version of the MFS (LMFS) is proposed for the large-scale modeling of two-dimensional (2D) elasticity problems. In the LMFS, the whole analyzed domain can be divided into small subdomains with a simple geometry. To each of the subdomain, the traditional MFS formulation is applied and the unknown coefficients on the local geometric boundary can be calculated by the moving least square method. The new method yields a sparse and banded matrix system which makes the method very attractive for large-scale simulations. Numerical examples with up to 200,000 unknowns are solved successfully using the developed LMFS code.  相似文献   

10.
The concept of a matroid vertex is introduced. The vertices of a matroid of a 3-connected graph are in one-to-one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3-connected graphs implies isomorphism. The concept of a vertex of a matroid leads to an equally simple proof of Whitney's theorem on the unique embedding of a 3-connected planar graph in the sphere. It also leads to a number of new facts about 3-connected graphs. Thus, consideration of a vertex in a matroid that is the dual of the matroid of a graph leads to a natural concept of a nonseparating cycle of a graph. Whitney's theorem on cyclic isomorphism can be strengthened (even if the nonseparating cycles of a graph are considered, the theorem is found to work) and a new criterion for planarity of 3-connected graphs is obtained (in terms of nonseparating cycles).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号