搜索资源列表
spheresubdivision
- Approximating the sphere by a subdivision mesh. Start from the icosahedron base mesh and iteratively refine the subdivision. Require OpenGL(R). snapshot level 2 PNG, snapshot level 4PNG. -Approximating the sphere by a su
game_ink_blot9
- Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square is marked with the number ‘1’. All free, valid squares north, south, east and west around the number ‘1‘ a
grid_segmentation.zip
- This paper presents a novel segmentation algorithm for metallographic images, especially those objects without regular boundaries and homogeneous intensity. In metallographic quantification, the complex microstructures m
Image Segmentation Using Iterative Watersheding
- This paper presents a novel segmentation algorithm for metallographic images, especially those objects without regular boundaries and homogeneous intensity. In metallographic quantification, the complex microstructures m
spheresubdivision
- Approximating the sphere by a subdivision mesh. Start from the icosahedron base mesh and iteratively refine the subdivision. Require OpenGL(R). snapshot level 2 PNG, snapshot level 4PNG. -Approximating the sphere by a su
game_ink_blot9
- Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square is marked with the number ‘1’. All free, valid squares north, south, east and west around the number ‘1‘ a
Turbo_simulink
- 生成一个好的Turbo码，并且用MAP方法进行解码- Generate a turbo code, and decode the code iteratively using MAP detectors
Bisection
- he basic idea of the method of bisection is to start with an initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that there is at least one root of the function f(x) within the initial i
Detection-of-ellipses-by-a-modified-Hough-transfor
- 这是一篇关于椭圆检测的文章:对于做人脸识别,模式识别的同行应该会有所帮助.找了好久,才下到,上传来共享下.-abstract:The Hough transformation can detect straight lines in an edge-enhanced picture, however its extension torecover ellipses requires too long a computing time
An-Efficient-Method-of-Texture-Synthesis-Based-on-
- 提出一种带边界匹配的基于 Graph Cut 的快速纹理合成算法.通过将纹理样本以不同的位移贴到输出图中完成合成 ,重叠区域的像素取值由 Graph Cut 确定.引入边界图辅助位移搜索 ,以增强合成结果的边界连续性 在预处理过程中计算 2 个相同样本在所有相对位移下的匹配误差 ,选取一部分误差最小的位移组成 “优选位移” 集合 ,合成过程中的块间相对位移仅从此集合中选取 ,大大地提高了合成速度.-This paper propos
SelectionSort
- C++ Class/Header file / Driver (main file) . implementing Selection Sort Algorithm in Recursively and Iteratively both-C++ Class/Header file/Driver (main file) . implementing Selection Sort Algorithm in Recur
MMA14
- conpressive sensing 的MMA新程序- This is an example using the Subspace Pursuit Algorithm of Wei Dai and Olgica Milenkovic "Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Compl
MMA14ver2
- compressive sensing 新版本MMA14- This is an example using the Subspace Pursuit Algorithm of Wei Dai and Olgica Milenkovic "Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Comp
relaxation08_3
- 松弛法进行迭代，求解方程组的解。先输入矩阵维数、迭代最高次数、松弛因子、误差范围，然后输入系数矩阵、长数矩阵，程序自动根据松弛法进行迭代求解。-Iterative relaxation method, to solve equations. Input matrix dimension, the maximum number of iterations, relaxation factor, error range, then ente
NUIRLSNon-negativeUnder-determinedIterativelyRewe
- simulation of Non-negative Under-determined Iteratively Reweighted Least Squares
AMSS
- 为了提高布匹瑕疵图像的滤波效果,针对检测过程中图像易受到多种混合噪声污染的特点,提出一种基于多尺度迭 代思想以改进AMSS 算子。将偏微分方程中的AMSS 方程以有限差分的形式离散化,依据量化尺度参数t 和尺度步长Δt ,采 用小尺度步长对污染图像进行多次迭代滤波。针对改进AMSS 算子的滤波结果,介绍了一种采用水平线算法进行效果分析 的新方法。实验结果表明,和其他算法相比,该滤波算法在滤除受未知混合噪声污染图像干扰的同时,
IterativeDecodingofBinary
- In this paper, energy efficient VLSI architectures for linear turbo equalization are studied. Linear turbo equalizers exhibit dramatic bit error rate (BER) improvement over conventional equalizers by enabling a form of
nMatReg
- In this model we take sums of u Xv and iteratively optimize parameters of the sums. For paper(s) see pd.hacker.lt
irntv
- TV正则化去卷积the Iteratively Reweighted Norm algorithm for solving the generalized TV functional, which includes the L2-TV and and L1-TV problems-An Iteratively Reweighted Norm Algorithm for Minimization of Total Variation
NewtonIterative
- 牛顿迭代法求解方程，给定计算初值和程序运行终止条件，根据读入的方程次数以及方程系数，反复计算求出方程的解-Newton used for questing function iteratively