Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - minimum energy
Search - minimum energy - List
这是自己用c#写的一段关于图的最小切的算法,主要参考了论文: 《An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision》 此文中的算法是目前比较优秀的最小切算法-This is their use of c# Write a paragraph on the minimum cut graph algorithm, the main reference of the thesis:
Date : 2025-12-23 Size : 3kb User : 张曦

如何利用Graph cuts 快速逼近最小化能量。-How to use Graph cuts fast approaching the minimum energy.
Date : 2025-12-23 Size : 81kb User : 余丽红

用opencv实现的用snake求物体边缘的例子。执行时先框住一个物体,然后就根据snake算法求最小能量曲线,即得到物体的边缘。框子越接近物体,效果越好。 运行需要opencv库。在VS2005下做的。-Opencv realize with the use of snake for example the edge of objects. When the first live implementation of an object box, and then snake algorithm based on minimum energy demand curve, that is to be the edge of objects. Framed and the closer objects, the better. Opencv library needed for the operation. In VS2005 to do the next.
Date : 2025-12-23 Size : 4.44mb User : cwl

用VC编写的彩色图像处理程序,实现了:提取图像中平均、最大、最小灰度,在此基础上可以对图像二值化;可以进行图像边缘提取(有laplace1、laplace2、Robot的提取方法) ;对图像进行卷积滤波(高能滤波,水平、垂直、双向增强,低通滤波);实现的图像的:锐化、浮雕、反相、平滑化、霓虹、马赛克、柔化、曝光过度,扩散处理。是学习VC彩图处理不可多得的代码。-VC prepared using color image processing procedures, to achieve: the extraction of images the average, maximum and minimum gray-scale, on this basis can the image binarization image edge extraction can be carried out (have laplace1, laplace2, Robot extraction method) image convolution filtering (high-energy filter, horizontal, vertical, two-way enhanced, low-pass filter) realize image: Sharpen, Emboss, RP, smooth, and neon, mosaic, blur, over-exposure, the proliferation of treatment. VC deal is to learn from rare color code.
Date : 2025-12-23 Size : 122kb User : 杜红艳

将原图像看做是自相关及其功率谱是各向同性的一阶马尔可夫过程,采用基于方向微分的运动模糊方向鉴别方法,对运动模糊图像进行方向性的高通滤波(方向微分),当滤波方向为运动模糊方向时 ,由于此方向模糊图像对应的高频成分最少,高通滤波(方向微分)使模糊图像能量损失最大,得到的微分图像灰度值(双线性插值)之和必然最小.所以方向微分得到的图像灰度值之和中的最小值对应的方向即为运动模糊的方向-The original image as is the autocorrelation and power spectrum is isotropic first-order Markov process, the use of motion blur based on the direction of the direction of the differential method of identifying the direction of motion blurred images of high-pass filter (the direction of derivative) When the filter direction is the direction of motion blur, due to the blurred image corresponding to the direction of high frequency components at least, high pass filter (the direction of derivative) to the maximum energy loss of blurred images, the resulting differential image intensity value (bilinear interpolation) of and the inevitable minimum. So the direction of differential image intensity values ​ ​ obtained and the minimum in the corresponding direction is the direction of motion blur
Date : 2025-12-23 Size : 29kb User : ouyangsir

流放圆饼规则 当圆饼移动完毕而总势能又不为0时,根据拟人策略,需要流放一个圆饼再重新启动移动规则直到下一次完毕。而到底流放的是相对挤压弹性势能最大的圆饼还是绝对挤压弹性势能最小的圆饼则要取决于上次流放的圆饼了。怎么确定相对挤压弹性势能最大的圆饼和绝对挤压弹性势能最小的圆饼以及如何控制流放的圆饼?-Pie rules exile movement is completed when the round cake and the total potential energy is not 0, according to the proposed one strategy, you need to exile a round cake and then restart the rule until the next move is completed. And in the end of exile is the greatest relative extrusion elastic potential energy pie is absolutely the smallest extrusion elastic potential energy will have to depend on the last round cake round cake of exile. How to determine the relative extrusion elastic potential energy and the absolute maximum squeeze round cake round cake elastic potential energy minimum, and how to control the exile of the round cake?
Date : 2025-12-23 Size : 1kb User : jerry

阿尔茨海默病目前在临床上的诊断标准就是判断是否发生了海马体积上变异,该病的程度与海马体积的萎缩量有着密切的关系。 分水岭算法最大的缺陷是过分割问题比较严重,利用分水线处能量值最小的理论,可以调整分水岭算法获得的轮廓,限制过分割。 -Alzheimer' s disease currently in clinical diagnostic criteria is to determine whether the mutation occurred on hippocampal volume, extent of the disease and the shrinkage of hippocampal volume is closely related to the amount. Watershed algorithm is the biggest flaw is more serious problem of over-segmentation using watershed line of the theoretical minimum energy value, can be adjusted to obtain the outline of the watershed algorithm to limit over-segmentation.
Date : 2025-12-23 Size : 1.77mb User : fuky

这是一种图割算法的实现,包含标签的设置、能量函数的构造以及最大流/最小割算法的实现-This is a graph cut algorithm, including the Settings tab, the structure and function of the maximum energy flow/minimum cut algorithm implementation
Date : 2025-12-23 Size : 146kb User : renmeimei

该类方法主要指的是活动轮廓模型(active contour model)以及在其基础上发展出来的算法,其基本思想是使用连续曲线来表达目标边缘,并定义一个能量泛函使得其自变量包括边缘曲线,因此分割过程就转变为求解能量泛函的最小值的过程,一般可通过求解函数对应的欧拉(Euler.Lagrange)方程来实现,能量达到最小时的曲线位置就是目标的轮廓所在。-Such methods mainly refers to the active contour model (active contour model) and the algorithm developed at its foundation, the basic idea is the use of a continuous curve to express the target edge and define an energy functional so that its arguments include edge curve Therefore segmentation process is transformed into solving process minimum energy functional, and can be obtained by solving the corresponding Euler function (Euler.Lagrange) equation to achieve, achieve energy curve position the hour is the goal of the contour lies.
Date : 2025-12-23 Size : 39kb User : 毛巴马

采用matlab编写的程序,利用最小能量法,实现图像立体匹配-Using matlab program, using the minimum energy method, the realization of stereo image matching
Date : 2025-12-23 Size : 2.01mb User : 李华

使用最小割最大流实现图割的立体匹配算法,建立匹配能量函数,构造网格图并求得最小值,匹配效率高时间短,内附说明文档及分析用法。 -The use of the maximum flow minimum cut graph cut algorithm for stereo matching, matching of energy function, and obtain the minimum mesh structure, high efficiency, short time, containing documentation and analysis.
Date : 2025-12-23 Size : 7.17mb User : helloC

使用能量最小法中的图割法,解决图像分类问题,最大流=最小割(The minimum method of energy in the map cut method to solve the problem of image classification)
Date : 2025-12-23 Size : 28kb User : 111111111111
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.