gangjingshushu

自己编写fft2和ifft2程序并进行快速傅里叶变换试验(fft2 and ifft2)

采用的是基于弦中点的hough变换椭圆检测算法，大家可以在百度上搜这篇论文，由于不是用的标准hough变换的算法，所以运行速度还不错(Used is based on the midpoint of the chord hough transform ellipse detection algorithm, we can search on Baidu paper, because the algorithm is not used in standard hough transform, so the speed is also good)

这篇文章是一种特征降维的方法，不过跟一般的计较离散度的方法不同，这个特征变换的准则是：尽可能地保留原始样本的熵(Kernel Entropy Component Analysis Jenssen, R Pattern Analysis and Machine Intelligence, IEEE Transactions on Volume: PP , Issue: 99 )

图像处理中的数字识别代码，包括数字训练集合和训练分类算法，可以实际应用。(digital recognition)

antenna dipole of 3d antenna

经典矩量法点匹配程序，重推导，注释说明详细(Classical point matching moment method procedure)

基于matlab的各种三维画图，种类比较齐全(All kinds of three-dimensional drawings based on MATLAB are quite complete)

基于sift算法的图像匹配。并用RANSEC算法去除错误匹配。最后还给出了sift算法的图像拼接。(Sift-based image matching algorithm. And use RANSEC algorithm to remove false matches. Finally, given the sift algorithm for image stitching.)

说明：  matlab编写的纹理图像分割，用c-v模型进行图像分割(matlab prepared texture image segmentation, cv model using image segmentation)

读入图像，对图像进行预处理，随后检测边缘，对得到的图像进行二值化，然后进行hough变换，获得圆边界，将此图与原图叠加，增强边缘(Read in the image, the image pre-processing, followed by edge detection, binarization on the image to get, and then the hough transform to obtain the circular boundary, this map and the original image overlay to enhance the edge)