-
IPLib2.0
一套基于VC++的遥感影象处理系统,可以实现空间域,频率域以及光谱的处理(yi tao ji yu VC++ de yaohan yingxiang chuli xitong)
- 2021-01-05 09:48:54下载
- 积分：1
-
ImageMatch
遥感摄影测量专业相邻相片同名点之间的匹配，交互界面，可以人工选点(Remote Sensing Photogrammetry Professional adjacent matching interface point between the photo of the same name, you can manually choose the point)
- 2014-04-29 00:59:22下载
- 积分：1
-
yasuoer
该源程序可以实现BMP图片的压缩(BMP pictures)
- 2012-11-21 11:33:15下载
- 积分：1
-
wavelettrans
文件包提供小波变换的vc实现，包含基于小波变换的图像小波域分析，为后续处理提供参考(Package provided by wavelet transform vc realize that contains the image based on wavelet transform wavelet-domain analysis, provide a reference for follow-up treatment)
- 2008-05-06 17:00:40下载
- 积分：1
-
CEGUIDemo3
介绍CEGUI中所给的例子的的文档，很详细.(Introduce the samples in the CECUI,very detailed!)
- 2009-05-19 15:07:56下载
- 积分：1
-
Mybole
实现对酒瓶子的边缘检测，背景差分，垂直和水平投影等，并可实现计数功能。(Achieve the bottles of edge detection, background difference, the vertical and horizontal projection, and to achieve counting.)
- 2011-07-30 17:07:43下载
- 积分：1
-
Coltransfer
一个vc编的图像处理的程序，处理不同颜色图像(a series of image processing procedures for handling images in different colors)
- 2007-04-01 07:34:09下载
- 积分：1
-
view
Matlab time-frequency analysis supporting the source code of chapter 12, please share
- 2017-08-03 03:15:27下载
- 积分：1
-
Hough-transform
基于规格化Hough变换的天波超视距雷达检测前跟踪算法(Hough transform based on the normalized horizon radar detection and tracking algorithms)
- 2013-12-09 16:41:57下载
- 积分：1
-
algorithm-of-findpath
绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区
域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行
定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解
决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻
接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每
个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(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)
- 2012-12-09 23:26:22下载
- 积分：1
