资源列表
[数据结构常用算法] IJIGSP-V3-N3-2
说明:Active contours or \snakes" can be used to segment objects automatically. The basic idea is the evolution of a curve, or curves subject to constraints from the input data. The curve should evolve until its boundary segments the object of intere<patel> 在 2025-06-06 上传 | 大小:240kb | 下载:0
[matlab例程] L03_ACondratovici
说明:Active contours or \snakes" can be used to segment objects automatically. The basic idea is the evolution of a curve, or curves subject to constraints from the input data. The curve should evolve until its boundary segments the object of intere<patel> 在 2025-06-06 上传 | 大小:243kb | 下载:0
[人工智能/神经网络/遗传算法] 12_01_0079_0085_2
说明:Active contours or \snakes" can be used to segment objects automatically. The basic idea is the evolution of a curve, or curves subject to constraints from the input data. The curve should evolve until its boundary segments the object of intere<patel> 在 2025-06-06 上传 | 大小:473kb | 下载:0
[数学计算/工程计算] 205-209
说明:reduces to a standard Hamilton-Jacobi equation. There are several major advantages to this formulation. The rst is that (x y t) always remains a function as long as F is smooth. As the surface evolves, the curve C may break, merge, and chan<patel> 在 2025-06-06 上传 | 大小:348kb | 下载:0
[数值算法/人工智能] Newton-Interpolation
说明:牛顿插值法 均差求取方法: 1. 根据均差的定义实现 caculate() 2. 模拟三角形算法实现-The The Newton interpolation poor method for getting: 1. Achieve caculate the () are poor definition analog triangle algorithm to achieve<龙远思> 在 2025-06-06 上传 | 大小:191kb | 下载:0
[压缩解压] ijicic-10-07033
说明:Another advantage is that geometric properties of the curve are easily determined from a particular level set of the surface . For example, the normal vector for any point on the curve C is given by:<patel> 在 2025-06-06 上传 | 大小:382kb | 下载:0
[数据结构常用算法] Exercise-1
说明:Understanding a Secret Message You have just intercepted an encoded message.<Sasha> 在 2025-06-06 上传 | 大小:193kb | 下载:0
[matlab例程] simulation-of-RADAR
说明:雷达仿真系统的matlab实现,雷达系统功能仿真-Radar simulation system matlab simulation function<地猪> 在 2025-06-06 上传 | 大小:918kb | 下载:0
[数据结构常用算法] FW
说明:Floyd算法又称为弗洛伊德算法,插点法,是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g<liming> 在 2025-06-06 上传 | 大小:1kb | 下载:0