Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - n2-1
Search - n2-1 - List
读取BMP 8bit文件(size n1*n2),输出整个文件[n1]*[n2]的像素值,像素值的范围0-255,并统计每个像素质的数量-BMP 8bit file read (size n1* n2), the output document as a whole [n1]* [n2] the pixel value, pixel value range of 0-255, and the quality of statistics like the number of each
Date : 2026-01-09 Size : 433kb User : cao

NOTES: 1. This implemention borrowed some basic framework from Rabner s original EMD code. 2. Histogram matrices are assumed to be arranged in the "matlab" style, i.e, the [i,j,k]-th element is located in the position i*(n2*n3) + j*(n3) + k 3. The example usage of the code is demonstrated in emdL1_test.cpp 4. This is version 2. It has been tested using VC++ 6.0, and VC 2005 (professional version).-NOTES: 1. This implemention borrowed some basic framework from Rabner s original EMD code. 2. Histogram matrices are assumed to be arranged in the "matlab" style, i.e, the [i,j,k]-th element is located in the position i*(n2*n3)+ j*(n3)+ k 3. The example usage of the code is demonstrated in emdL1_test.cpp 4. This is version 2. It has been tested using VC++ 6.0, and VC 2005 (professional version).
Date : 2026-01-09 Size : 11kb User : 束鑫

测帧间位移的一种方法:下采样后相位相关(精度可到亚像素)N1,N2需要是4的整倍数。-Interframe displacement measurement methods: phase correlation after the down-sampling (sub-pixel accuracy can be) N1, N2 need is a whole multiple of 4.
Date : 2026-01-09 Size : 1kb User : 付中梁

Gaussian Filter with example The functions used in the main.m file Function d2gauss.m: This function returns a 2D Gaussian filter with size n1*n2 theta is the angle that the filter rotated counter clockwise and sigma1 and sigma2 are the standard deviation of the Gaussian functions.-Gaussian Filter with example The functions used in the main.m file Function d2gauss.m: This function returns a 2D Gaussian filter with size n1*n2 theta is the angle that the filter rotated counter clockwise and sigma1 and sigma2 are the standard deviation of the Gaussian functions.
Date : 2026-01-09 Size : 165kb User : ALEX

Otsu算法步骤如下: 设图象包含L个灰度级(0,1…,L-1),灰度值为i的的象素点数为Ni ,图象总的象素点数为N=N0+N1+...+N(L-1)。灰度值为i的点的概率为: P(i) = N(i)/N. 门限t将整幅图象分为暗区c1和亮区c2两类,则类间方差σ是t的函数: σ=a1*a2(u1-u2)^2 (2) 式中,aj 为类cj的面积与图象总面积之比,a1 = sum(P(i)) i->t, a2 = 1-a1 uj为类cj的均值,u1 = sum(i*P(i))/a1 0->t, u2 = sum(i*P(i))/a2, t+1->L-1 该法选择最佳门限t^ 使类间方差最大,即: 令Δu=u1-u2,σb = max{a1(t)*a2(t)Δu^2}-int otsu (IplImage*image, int rows, int cols, int x0, int y0, int dx, int dy, int vvv) { unsigned char*np // 图像指针 int thresholdValue=1 // 阈值 int ihist[256] // 图像直方图,256个点 int i, j, k // various counters int n, n1, n2, gmin, gmax double m1, m2, sum, csum, fmax, sb ·····
Date : 2026-01-09 Size : 1.48mb User : 燕子一舞
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.