Track_4

模拟闪变仪，用于检测电压波动与闪变，满足IEC推荐的平方检测法。(Analog Flickermeter for detecting a voltage fluctuation and flicker, meet IEC square detection method recommended.)

屏幕放大镜源码，程序调用API函数，在时钟的周期事件下设置窗口透明样式并复制放大图像，形成放大镜的效果。(Screen magnifier source , the program calls API functions , set the window transparent style event in the cycle of the clock and copies enlarge the image , forming a magnifying glass effect.)

箔条干扰的特性与雷达抗箔条技术研究，对雷达制导导引头的干扰技术进行系统研究(Characteristics of the anti-radar chaff and chaff research technology, the interference radar guidance seeker system research)

剪切波是最近几年发展的图像处理的有利工具，这是几篇不错的论文，希望可以对大家有所帮助。(Shear wave is the last few years the development of image processing tool, this is a few good paper, hope to help everyone.)

维纳滤波，图像恢复，通过用matllab编辑的程序实现以上功能-wena (Wiener filtering, image restoration, with matllab editing program to achieve the above functions-wena)

算法程序可以求解带时间窗的车辆路径问题，期望大家上传的都是有说明的可以使用的程序(the program for the vehicle routing problem with time windows)

hough变换，用于直线和圆，椭圆的检测，很实用(hough transform for line and circle, ellipse detection, it is practical)

提取SIFT特征点，配准拼接的代码，能运行(detect sift features)

GDI 绘图实例

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)