登录
首页 » Visual C++ » ImgZoom

ImgZoom

于 2007-01-28 发布 文件大小:2KB
0 291
下载积分: 1 下载次数: 339

代码说明:

  图像局部放大功能。包括主要的三个消息处理函数,由鼠标拖动画出需放大区域,松开即将图像局部放大到整个客户区,能够实现层层放大。(enlarge images partial function. Including the three main message processing function, the mouse scrolling painted by the need to enlarge the regional, Loosen the forthcoming local enlarge images of the entire client area, can be achieved at every level to enlarge.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Jpeg
    说明:  Jpeg算法源代码,包含jpeg的各种算法实现的vc++的源代码(Jpeg algorithm source code, including the various algorithms jpeg of vc++ source code)
    2010-04-28 16:05:05下载
    积分:1
  • number
    将图片转化为BMP位图,然后通过逐行扫描识别图片中的数字。(A picture into a BMP bitmap, and then through the progressive scanned image in the figure.)
    2009-10-15 16:05:44下载
    积分:1
  • GraphCut
    图像分割经典算法GraphCut的实现代码,亲测可用。(An implementation of GraphCut Algorithm, which is a classical method in image segmentation field.)
    2020-09-29 17:27:43下载
    积分:1
  • DDE
    本程序的作用,完成了一种图像的DDE算法,数字图像细节增强。(The role of this procedure, the completion of an image of the DDE algorithm, digital image detail enhancement.)
    2021-02-02 22:49:59下载
    积分:1
  • DetectionofTonguesCrackBasedonAdaptiveThreshold
    摘 要:舌象中的裂纹是中医舌诊中的重要内容。由于拍摄条件的不同,舌象质量有较大差异,传统的阈值选取方法并不 适用。文中提出一种舌象裂纹检测的自适应阈值选择方法。该方法利用舌象的L 3 a 3 b 色彩特征及区域的分裂- 合并, 对舌象进行区域分割,自适应地选取舌中部区域的色彩值作为阈值,对整个舌象进行裂纹提取。经验证,本方案对不同的 舌象能较好地提取出裂纹,实现舌象裂纹诊断的客观化。(Tongue’ s crack is a very important part of herbalist doctor diagnosis. For the different screen conditions , there are many differ2 ences on the tongue’ s quality. It is not effective to use the t raditional threshold ext raction algorithm. In order to solve this problem , pro2 pose a new adaptive threshold algorithm. Present the segmentation of the image of tongue by using the feature on tongue in the L 3 a 3 b color space and the split- combining algorithm. Then use the threshold , which is the color value ext racted automatically in the middle of the tongue , to detect the crack of the whole tongue. The experiments show that this approach is able to distill the crack effectively to different tongue images , and achieve the objectivity of the diagnosis based on the tongue’ s crack.)
    2020-08-27 19:58:13下载
    积分:1
  • report-of-tuxingxue
    实验一 直线生成算法 实验二 圆弧生成算法 实验三 窗口菜单交互界面 实验四 区域填充算法 实验五 裁剪算法算法 实验六 图形软件开发包/库应用 实验七 曲线的生成算法 实验八 曲面生成算法 实验九 二维图形变换(Experimental line generation algorithm experiment two arcs to generate the algorithm experimental three-window menu interface experiment four regional filling algorithm experimental five-clipping algorithm algorithm experiment six graphics software development package/library application experiment seven curve generation algorithm experiment eight surface generation algorithm experiments ninety-two dimensional graphics transform)
    2020-10-22 13:57:23下载
    积分:1
  • CUDA
    将传统的串行均值滤波算法修改为基于CUDA的并行的滤波算法(Modify traditional serial mean filtering algorithm based on CUDA parallel filtering algorithm)
    2020-12-13 21:49:14下载
    积分:1
  • MatchLSM
    1.打开左右两张影像2.Harris算法提取同名点3.显示提取同名点(若要进行下一步匹配则不建议显示,这里只是用于查看是否提取出)4.相关系数匹配(只在找出的同名点内匹配)5.LSM最小二乘匹配(先进行粗匹配,再精匹配)(1 Open the left and right images 2.Harris algorithm to extract two tie points 3 shows the extraction of corresponding points (not recommended to proceed to the next match show, here is used to see if extracted) 4. Correlation coefficient matching (just looking match within a point of the same name) 5.LSM least squares matching (rough first match, then fine match))
    2013-08-28 15:45:57下载
    积分:1
  • Graph
    输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用prim算法实现构造该带权无向图的最小生成树,并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)
    2020-12-13 15:29:15下载
    积分:1
  • HuffmanExp
    实现对灰度图像的哈夫曼编码,对于其他图像,也可以类似的完成。(Realize grayscale images of hoffmann coding, for other image, also can be similar to the finish.)
    2010-11-13 09:58:54下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载