leidachengxu

This paper addresses the problem of segmenting an image into regions. We defi ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an effi cient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the al-gorithm to image segmentation using two diff erent kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions.

很好用的带静止无功补偿器（statcom）的基于psat的14节点仿真图，很方便，希望对大家有所帮助。(Good use with a static var compensator (statcom) psat-based simulation of the 14 node graph, it is convenient, we want to help.)

使用蚁群算法解决最短路径问题的通用的Matlab程序(The shortest path using ant colony algorithm to solve a common problem in Matlab)

使用matlab编译的基于颜色直方图特征的彩色图像检索技术的研究(Compiled using matlab image retrieval system)

创建一个高斯分布并画出其PDF曲线，文件设置为均值为0.其分散为1，参数可以调节(Create a Gaussian distribution, and Draw the PDF curve, the file is set to mean 0. The spread is 1, the parameter can be adjusted)

潮流计算程序用matlab进行开发，支持多节点的潮流计算，并可设置迭代次数与精度(Flow calculation)

PWM for SERVOMOTOR (VIGOR-VS-1) to move it 180 degree and 0 degree using mc 89V51RD2 while crystal is taken 11.0592. Textlast.c

基于OFDM/QPASK信号的周期循环频谱感知算法 认知无线电应用(Based on OFDM/QPASK signal cycle of the spectrum perception algorithm)

利用遗传算法求解旅行商问题 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 (Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.)

Bi-dimensional Gabor filter with DC component compensation This version of the 2D Gabor filter is basically a bi-dimensional Gaussian function centered at origin (0,0) with variance S modulated by a complex sinusoid with polar frequency (F,W) and phase P described by the following equation: G(x,y,S,F,W,P)=k*Gaussian(x,y,S)*(Sinusoid(x,y,F,W,P)-DC(F,S,P)), where: Gaussian(x,y,S)=exp(-pi*S^2*(x^2+y^2)) Sinusoid(x,y,F,W,P)=exp(j*(2*pi*F*(x*cos(W)+y*sin(W))+P))) DC(F,S,P)=exp(-pi*(F/S)^2+j*P) File Id: 13776 Average rating: 0.0 Size: 1 KB # of reviews: 0 Submitted: 2007-01-26 Downloads: 274 Subscribers: 0 Keywords: gabor filter Stiven Schwanz Dias (Bi-dimensional Gabor filter with DC compo .. compensation This version of the 2D Gabor f ilter is basically a bi-dimensional Gaussian f unction centered at origin (0, 0) with variance S modulated by a complex sinuso id with polar frequency (F, W) and phase P described by the following equati on : G (x, y, S, F, W, P) = k* Gaussian (x, y, S)* (Sinusoid (x, y, F, W, P)- DC (F, S, P)), where : Gaussian (x, y, S) = exp (-pi* S* 2 ^ (x ^ 2 y ^ 2)) Sinusoid (x, y, F, W, P) = exp (j* (2* pi* F* (x* cos (W) y* sin (W)) P))) D C (F, S, P) = exp (-pi* (F/S) ^ 2* P j) File Id : 13776 Average rating : 0.0 Size :# 1 KB of reviews : 0 Submitted : 2007-01-26 Downloads : 274 Subscribers : 0 Keywords : gabor filter Stiven Schwanz Dias)