klt-compression

由Matlab编写的实现lv-svm分类的源码程序(Prepared by the Matlab implementation of lv-svm classification of source programs)

如果你有一个三维校准对象，你可以应付一个单一的形象。为了获得令人满意的校正结果，对象应包括整个图像以及可能的。此外，多张图片的支持。那么， 图像应捕获不同的观点改变了相机 方向和距离。如果在一个平面标定目标单一 形象是不够的和一套图像是需要解决所有 摄像机的参数。的坐标平面控制点应 被选中，这样的Z坐标成为为零。三维坐标股 毫米和图像坐标单位是像素。校准坐标 系统是用右手。原产地的图像坐标系中 左上角， X轴是正确的和Y轴向下。(If you have a three-dimensional calibration object, you can cope with a single image. Calibration In order to obtain satisfactory results, the target should include the entire image, as well as possible. In addition, the support of many pictures. Then, the image should capture different points of view camera has changed the direction and distance. If a planar calibration target at a single image is not enough and a set of images are necessary to solve all the camera parameters. The coordinates of horizontal control points should be selected, such as Z coordinates become zero. Unit-mm three-dimensional coordinates and image coordinates are pixel units. Calibration are right-handed coordinate system. Origin of the image coordinate system in the upper left corner, X-axis and Y are correct under axial.)

此函数的功能为一个一维时间序列的多重分形特征(The function of this function for a one-dimensional time series of multi-fractal characteristics of)

matlab实现图像分割剪裁放大缩小等操作(Image segmentation matlab operations such as cutting Zoom)

Matlab code Hurst and rescaled range

work in matlab, iris detection

多机通信可靠性在matlab上的模拟实现(Simulation of multi machine communication reliability in matlab implementation)

THE CODE IS ABOUT FINGER PRINT

针对二维矩形条带装箱问题提出了一种启发式布局算法，即底部左齐择优匹配算法（lowest—level left align bestfit，简称LLABF）．LLABF算法遵循最佳匹配优先原则，该原则综合考虑完全匹配优先、宽度匹配优先、高度匹配优先、组合宽度匹配优先及可装入优先等启发式规则．与BL（bottom-left），IBL（improved-bottom-left）与BLF（bottom—left-fill）等启发算法不同的是，LLABF能够在矩形装入过程中自动选择与可装区域匹配的下一个待装矩形．计算结果表明，LLABF结合遗传算法（genetie algorithm,简称GA）解决二维条带装箱问题更加有效．(A heuristic placement algorithm for two-dimensional rectangular strip packing problem is proposed, which is called bottom-level left align best fit algorithm (LLABF). Different from BL (bottom-left), IBL (improved-bottom-left) and BLF (bottom-left-fill) heuristic algorithms, LLABF can automatically select the next rectangle to be loaded that matches the mountable region during the rectangular loading process. Genetie algorithm (GA) is more effective to solve the two-dimensional strip packing problem.)

说明：  BLMS算法实现，即块LMS算法，是lms算法的的一种优化，值得大家研究(The implementation of BLMs algorithm, block LMS algorithm, is an optimization of LMS algorithm, which is worth studying)