搜索资源列表
li4_13
- 高通滤波使低频分量得到抑制，从而达到增强高频分量，使图像的边沿或线条变得清晰，实现图像的锐化。-High-pass filter allows low-frequency component is suppressed, so as to enhance the high-frequency component image to the edges or lines become clear, for image sharpening.
Curvelet
- Image fusion algorithm to fuse images different modalities based on the integration of Fast Discrete Curvelet Transform (FDCT) and the Singular Value Decomposition (SVD).The experimental results show that the proposed algorithm is efficiently handlin
PCA
- the edges and the other curved shapes in the images to be fused. The overall execution time of the fusion process is very low compared with the other fast algorithms such as Discrete Wavelet Transform (DWT) fusion algorithm.
DWT
- the edges and the other curved shapes in the images to be fused. The overall execution time of the fusion process is very low compared with the other fast algorithms such as Discrete Wavelet Transform (DWT) fusion algorithm.
DT-CWT
- the edges and the other curved shapes in the images to be fused. The overall execution time of the fusion process is very low compared with the other fast algorithms such as Discrete Wavelet Transform (DWT) fusion algorithm.
DTCWT2
- the edges and the other curved shapes in the images to be fused. The overall execution time of the fusion process is very low compared with the other fast algorithms such as Discrete Wavelet Transform (DWT) fusion algorithm.
gn
- Market Newman写的复杂网络的加权GN算法 算法用Python写的 其基本思想是不断的删除网络中具有相对于所有源节点的最大的边介数(ege betweenness)的边，然后，再重新计算网络中剩余的边的相对于所有源节点的边介数-The basic idea is to delete the network with respect to all of the source nodes of the largest betweenness (EGE betweenness) edge
bound
- 基于图像分割的边缘处理函数，包括空洞边缘的提取，这是在原图像上的操作-Image segmentation based on edge processing functions, including the extraction of empty edges, which is the operation of the original image
Edges
- 基于水平集的图像分割，无须判定收敛条件，效果非常好。- Level set image segmentation, the effect is very good.
java
- JAVA实现多边形填充。单击画多边形的边，双击围成多边形，三击开始填充。并且可以修改多边形边的颜色，填充色。-mplemented with JAVA polygon fill. Click the picture side of the polygon, double-click the enclosed polygon, three-hit start filling. And can modify the color of the polygon edges, filled with co
bwtext
- Finding Edges Gaussian Blur Rotation Skew Averaging filter
Combined-with-Canny
- 对经典的二值化方法Ostu 算法和Bernsen 算法中存在的缺点进行了分析, 提出一种结合Canny 算子的图像 二值化方法.该方法综合考虑了边缘信息和灰度信息, 通过边缘附近种子点在高阈值二值化图像中的填充和低阈值 图像对它的修补而得到二值化结果图像, 较好地解决了经典二值化方法中存在的抗噪能力差、边缘粗糙、伪影现象 等缺点.实验结果证明, 该方法能够较好地解决低对比度图像和目标像素灰度不均匀图像的二值化问题-The disadvantage of the classical
figure-dege
- 边缘提取算法，适用于将图片的边缘特征提取，获得的信息较为完整-Edge detection algorithm is applied to the edges of the image feature extraction, to obtain more complete information
viewTree
- Graphs visualization with vertices and edges coloring. On C++/Qt
Image
- 索贝尔算子(Sobel operator)是图像处理中的算子之一，主要用作边缘检测。在技术上，它是一离散性差分算子，用来运算图像亮度函数的梯度之近似值。在图像的任何一点使用此算子，将会产生对应的梯度矢量或是其法矢量 Sobel算子有两个，一个是检测水平边沿的；另一个是检测垂直平边沿的。Sobel算子另一种形式是各向同性Sobel (Isotropic Sobel)算子，也有两个，一个是检测水平边沿的，另一个是检测垂直边沿的各向同性Sobel算子和普通Sobel算子相比，它的位置加权系数更为准
Untitled4
- 实验实现邻接表表示下无向图的广度优先遍历。 程序的输入是图的顶点序列和边序列(顶点序列以*为结束标志，边序列以-1,-1为结束标志)。程序的输出为图的邻接表和广度优先遍历序列。例如： 程序输入为： a b c d e f * 0,1 0,4 1,4 1,5 2,3 2,5 3,5 -1,-1 程序的输出为： the ALGraph is a 4 1 b
afafa
- 本实验实现邻接表表示下无向图的广度优先遍历。 程序的输入是图的顶点序列和边序列(顶点序列以*为结束标志，边序列以-1,-1为结束标志)。程序的输出为图的邻接表和广度优先遍历序列。例如： 程序输入为： a b c d e f * 0,1 0,4 1,4 1,5 2,3 2,5 3,5 -1,-1 程序的输出为： the ALGraph is a 4 1 b
bfs
- 程序的输入是图的顶点序列和边序列(顶点序列以*为结束标志，边序列以-1,-1为结束标志)。程序的输出为图的邻接表和广度优先遍历序列。-Input to the program is a sequence of vertices and edges of a sequence diagram (sequence of vertices with* marks the end edge sequence-1,-1 for the end marker). The output of the prog
Canny
- anny边缘检测算子是John F. Canny于 1986 年开发出来的一个多级边缘检测算法。 Canny边缘检测算法： step1:用高斯滤波器平滑图象； step2:用一阶偏导的有限差分来计算梯度的幅值和方向； step3:对梯度幅值进行非极大值抑制； step4:用双阈值算法检测和连接边缘。-anny edge detection operator is John F. Canny developed in 1986 out of a multi-level
Laplace-sharpening
- 数字图像处理的laplace锐化，可以凸显图像的高频成分，比如边缘和突变点，是图像细节更加丰富-Digital image processing of laplace sharpening can highlight the high frequency components of the image, such as edges and mutations, which are more richer in image detail