资源列表
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:
1
- used to get quantitative estimates of organ sizes and provide aid in any necessary diagnoses. Another important application is registration. It may be easier, or at least less error prone to segment objects in multiple images prior to registrat
ANAFDLLI
- Segmentation of structure in medical images is an important research topic. It has applications in patient diagnoses, image-guided surgery, and medical data visualization. One approach to solving this problem is the use of active contours or \s
zlib1_20523
- 这是zlib1.dll压缩解压资源，内包含帮助说明文档及使用实例，非常好用-This is ZIP.dll compression decompression resources contained within to help explain the documents and use cases, and very easy to use
zlib_algorithm
- zlib压缩算法的VC++实现，实现对图像的压缩，工程完整，注释详细，可以直接编译运行。-zlib compression algorithm VC++ implementation of image compression, complete engineering, detailed notes, you can compile and run directly.
wangshangshudian
- 用C#开发的网上书店，可以在网上进行购书，其主要功能包括注册会员，新闻浏览，图书查询，最新图书，购物车，在线客服，文件管理，会员管理，订单管理，新闻管理。-C# development of the online bookstore, online books, its main functions include registered member, press browse, search for a book, the latest books, shopping cart, online
quantizer
- 量化：用max algorithm设计量化器。探究随着量化点数量的变化，Rate-distortion的变化-Quantization: the max algorithm design quantizer. Inquiry, Rate-distortion changes with the change in the number of quantization point
omp
- omp算法：1-D信号压缩传感的实现(正交匹配追踪法Orthogonal Matching Pursuit)-The omp algorithm :1-D signal compressed sensing to achieve (orthogonal matching pursuit method Orthogonal Matching Pursuit)
20090325090533_jpegsrc.v6b
- 基于V4L架构的jpeg图像压缩代码分析-Based the V4L architecture jpeg image compression code analysis
chazhi
- 线性插值法，水库水位库容曲线、水电站机组特性曲线插值，-The water level in the reservoir storage capacity, the reservoir unit characteristic curve interpolation
Joseph
- 约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的人的序号为5，4，6，2，3。最后剩下1号。 假定在圈子里前K个为好人，后K个为坏人，你的任务是确定这样的最少M，使得所有的坏人在第一个好人之前被杀掉。-Joseph problem is a well-known problem: N personal circle, began to count off from the first, the M-th
lisp
- 简单的LISP计算表达式计算器 计算表达式的值 输入表达式 能自动识别 有美丽的界面设计-The simple LISP calculated expression evaluator