fina_deconvolution_code

说明：  基于活动轮廓模型的图割算法，实现图像的高效分割！非常好的代码。希望帮助大家！(Graph cuts based active contours which is used for image segmentation.Excellent source code!)

双目立体匹配，使用SAD，SSD，NCC算法，比较多种常见算法的优劣，对其优化实现快速准确匹配。(Binocular stereo matching, the use of SAD, SSD, NCC algorithm, compare the merits of a variety of common algorithms, and its optimization to achieve fast and accurate matching)

igmt one of geo-image software

改程序是用来行人检测的，有源代码，可以轻松学习并参考。(The reform program is used for pedestrian detection, source code, you can easily learn and reference.)

基于小波变换的图像修复算法基于小波变换的图像修复算法(Wavelet-Based Image Inpainting Algorithm Based on Wavelet Transform Algorithm for Image Inpainting)

给予matlab的图像分割例程，内附相关图片及程序。(Image segmentation routine MATLAB, containing the relevant pictures and program. )

这是一个MATLAB工具箱包括32个降维程序，主要包括 pca,lda,MDS等十几个程序包，对于图像处理非常具有参考价值！！( ，This Matlab toolbox implements 32 techniques for dimensionality reduction. These techniques are all available through the COMPUTE_MAPPING function or trhough the GUI. The following techniques are available: - Principal Component Analysis ( PCA ) - Linear Discriminant Analysis ( LDA ) - Multidimensional scaling ( MDS ) - Probabilistic PCA ( ProbPCA ) - Factor analysis ( FactorAnalysis ) - Sammon mapping ( Sammon ) - Isomap ( Isomap ) - Landmark Isomap ( LandmarkIsomap ) - Locally Linear Embedding ( LLE ) - Laplacian Eigenmaps ( Laplacian ) - Hessian LLE ( HessianLLE ) - Local Tangent Space Alignment ( LTSA ) - Diffusion maps ( DiffusionMaps ) - Kernel PCA ( KernelPCA ) - Generalized Discriminant Analysis ( KernelLDA ) )

图像压缩编码，dct变换，量化， Z字形扫描 行程编码(Image compression, dct transform, quantization, Z-shaped scan length encoding)

颜色、形状、纹理特征提取算法及应用,各种方法都有，很有用。(Color, shape, texture feature extraction algorithms and applications, various methods are very useful.)

rgb to HSV，很有用，调试成功，可以应用(rgb to HSV，#include "stdafx.h" #include <iostream.h> void main(float R, float G, float B, float& H, float& S, float&V) { // r,g,b values are from 0 to 1 // h = [0,360], s = [0,1], v = [0,1] // if s == 0, then h =-1 (undefined) float min, max, delta,tmp tmp = R>G?G:R min = tmp>B?B:tmp tmp = R>G?R:G max = tmp>B?tmp:B V = max // v delta = max- min if( max != 0 ) S = delta/max // s else { // r = g = b = 0 // s = 0, v is undefined S = 0 H = 0 return } if (delta == 0){ H = 0 return } else if(R == max){ if (G >= B) H = (G- B)/delta // between yellow & magenta else H = (G- B)/delta+ 6 } else if( G == max ) H = 2+ ( B- R )/delta // between cyan & yellow else if (B == ma)