查询词典 graph

It solves the problem that the unitary contour presentation can not correctly extract face contour in a face image which suffers from scale, rotation etc. The definition of the internal and external energy function is provided. At the same time, the global matching algorithm and local matching algorithm is given. The experiment shows that this presentation and the accompanying matching algorithm can be used to extract the face contour very well. So the image segmentation can be implemented by using it.②By analyzing the recognition principle of PCA method, we can conclude that the face images coming from different surrounding consist of different face image space. This is the essential reason that makes the generality of PCA method worse. Also, we give a measurement means to measure the distance from different face image space, so we can analyze face image space more conveniently.③We also construct various scale models and rotation pose models to detect the scale and rotating angle of face image to be recognized. The experiment results show that the detecting precision is very high. So it is good for face image feature extraction and face image representation.④Similarly, we construct local feature models of face image and utilize them to detect the local feature of face image. At the same time, we put forward a novel face image local feature detection algorithm, locating step by step. The experiment results show that this method can accurately detect the location of local face feature in a image.⑤A novel face image presentation model, dual attribute graph , is put forward. Firstly, it utilizes attribute graph to present the face image, then exact the local principal component coefficient and Gabor transform coefficient of thc pixels which corresponds to the nodes of the graph as the attribute of the nodes. This representation fully makes use of the statistical characteristic of the local face feature and utilizes Gabor transform to present the topographical structure of face image. So DAG has more general property.⑥Based on the DAG presentation, we give a DAG matching function and matching algorithm. During the design of the function and algorithm, the noise factor, e. g., lighting, scale and rotation pose are considered and tried to be eliminated. So the algorithm can give more general property.⑦A general face image recognition system is implemented. The experiment show the system can get better recognition performance under the noise surrounding of lighting, scale and rotation pose.

本文在上述研究的基础上，取得了如下主要研究成果：①构造了一个通用的人脸轮廓模型表示，解决了由于人脸图象尺度、旋转等因素而使得仅用单一轮廓表示无法正确提取人脸轮廓的问题，并给出了模型内、外能函数的定义，同时给出了模型的全局与局部匹配算法，实验表明，使用这种表示形式以及匹配算法，能够较好地提取人脸图象的轮廓，可实际用于人脸图象的分割；②深入分析了PCA方法的识别机制，得出不同成象条件下的人脸图象构成不同的人脸图象空间的结论，同时指出这也是造成PCA方法通用性较差的本质原因，并给出了不同人脸空间距离的一种度量方法，使用该度量方法能够直观地对人脸图象空间进行分析；③构造了各种尺度模板、旋转姿势模板以用于探测待识人脸图象的尺度、旋转角度，实验结果表明，探测精确度很高，从而有利于人脸图象特征提取，以及图象的有效表示；④构造了人脸图象的各局部特征模板，用于人脸图象局部特征的探测；同时提出了一种新的人脸图象局部特征探测法---逐步求精定位法，实验结果表明，使用这种方法能够精确地得到人脸图象各局部特征的位置；⑤提出了一种新的人脸图象表示法---双属性图表示法；利用属性图来表示人脸图象，并提取图节点对应图象位置的局部主成分特征系数以及Gabor变换系数作为图节点的属性，这种表示方法充分利用了人脸图象的局部特征的统计特性，并且使用Gabor变换来反映人脸图象的拓扑结构，从而使得双属性图表示法具有较强的通用性；⑥在双属性图表示的基础上，给出双属性图匹配函数及匹配算法，在函数及算法设计过程中，考虑并解决了光照、尺度、旋转姿势变化等因素对人脸图象识别的影响，使得匹配算法具有较强的通用性；⑦设计并实现了一个通用的人脸图象识别系统，实验结果表明，该系统在图象光照、尺度、旋转姿势情况下，得到了较好的识别效果。

As a graphical framework for formally describing interactive system, basic graph can represent processes and the interaction between processes in two ways: one is graphical representation, where a graph corresponds to a process and reduction in a graph corresponds to interaction between processes; the other is using term algebra consisting a set of terms and an equational theory on terms.

基本图是一种描述并发交互系统的形式化方法，它具有描述简洁、清晰和直观的特点。在基本图中，进程以及进程间的交互行为，既可以用图表示方法(其中一个图对应一个进程，图之间的归约对应进程之间的交互行为)，又可以用项代数来表示。

With the popularization and application of computer-making-graph technique in all trades and professions, this new technical medium is widely used in graph of function teaching as auxiliary mathematical classroom teaching at home and abroad, as strongly advances an in-depth study in graph of function teaching.

伴随着电脑作图技术在各行业的普及与应用，国内外函数图像教学中普遍采用这一新的技术手段辅助数学课堂教学，有力的促进了函数教学向纵深阶段发展。

Let G = V(G,E be a simple graph with |V| vertices and |E| edges. Let |V|= p,|E|= q, if there exists f: V →{1,2,...,p} be an injective mapping, and define an inducedfunction f":E→{1,2,...,q} by setting f"=|f-f| for all∈E. If f maps E onto {1,2,...,q}, then f is said to be a Skolem-graceful labeling of G, the graph G is said to be a Skolem-graceful graph.

对一个给定的简单图G=V(G，E，|V|和|E|分别是图G的顶点数和边数，令|V|=p，|E|=q，如果存在一个一一映射f：V→{1，2，…，p}，使得对所有边∈E，由f′=|f-f|所导出的映射函数f′：E→{1，2，…，q}是一一对应关系，则称f是图G的一个Skolem优美标号，图G被称为Skolem优美图。

By using the algebraic method, we obtain a new formula for the expected hitting time of random walks on strong-connected and aperiodic digrahs (irreducible and aperiodic Markov chain). From this formula, we obtain the explicit expressions for the expected hitting times of random walks on directed de Bruijn graph, directed Kautz graph and some graphs constructed from strong regular graph, etc.

利用代数方法给出了强连通非周期有向图上随机游动（即不可约非周期马尔可夫链）平均首达时间一个新的表达式，并利用这个表达式得到了有向de Bruijn图，有向Kautz图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。

A graph G is edge reconstructible if every edge reconstruction of graph G is isomorphic to graph G.

如果图G的每个边重构图都与图G同构，则称图G是边可重构的。

And in the same paper, Rose proved that if G is a graph with q edges, then graph K_{2q+1} can be partitioned into 2q+1 graphs which are isomorphic to graph G.

Rose在文献[2]中指出了Ringel猜想的证明与优美树猜想有关，并给出了一般的结论：设G是一个q条边的优美图，那么K_2q+1可分解出2q+1个图都同构于G。

E. MCNG-ISOMAP (Minimal Connected Neighborhood Graph-based ISOMAP), which can prune effectively "shortcut" edges, existed possibly in the neighborhood graph, based on that the minimal connected neighborhood graph can avoid "shortcut" edges effectively.

该算法能在一定程度上避免邻域大小难以有效选取的问题，同时还能在不依赖于邻域大小的情况下发现数据真正的固有维数。

A free edge in a Ramsey graph of K n is defined as whatever does the edge to be colored by one of two colors respectively,the graph will keep to be a Ramsey graph of K n.

在 Ramsey图 Kn中一条自由边定义为，即使单独改变这条边的颜色，所得到的新图仍是一个二色 Ramsey图 Kn 。

To prove one edge union of k-shell graph is cordial, firstly fix the labeling of vertex of common edge(label u with 0 and v with 1), then according to the value of the graph order n module 4 to class the k shell gaphs to four cases, and to divide to small cases in every shell graph.

本文研究k-贝壳图的亲切标号时，在固定了公共边上的点的标号(对u标号0且v标号为1)之后，我们采用如下方法：首先，以每个贝壳图的顶点数对4取模的余数来分类，这样就得到了四种(来源：d1ABC论文网www.abclunwen.com)不同情况的贝壳图；然后在每个贝壳图中再分情形进行标号；最后，通过证明得到这种标号方法是满足亲切标号的定义的，从而证明了k-贝壳图的亲切性，成功的解决了Sethuramam和Selvaraju猜想，证明了其正确性。

Breath, muscle contraction of the buttocks; arch body, as far as possible to hold his head, right leg straight towards the ceiling (peg-leg knee in order to avoid muscle tension).

呼气，收缩臀部肌肉；拱起身体，尽量抬起头来，右腿伸直朝向天花板（膝微屈，以避免肌肉紧张）。

The cost of moving grain food products was unchanged from May, but year over year are up 8%.

粮食产品的运输费用与5月份相比没有变化，但却比去年同期高8％。