/*==================================================================
= 代码内容:GVF Snake
= 修改日期: 2010.10.20
= 作者:BeanYoung
= email:guobasanxian@gmail.com
====================================================================*/
#include "stdafx.h"
#include "GVFFun.h"
#include <iostream>
/////////////////////////////////////////////////////////////////////////
//function [x,y] = snakedeform(x,y,alpha,beta,gamma,kappa,fx,fy,ITER)
//% SNAKEDEFORM Deform snake in the given external force field
//% [x,y] = snakedeform(x,y,alpha,beta,gamma,kappa,fx,fy,ITER)
//%
//% alpha: elasticity parameter 弹性参数
//% beta: rigidity parameter 刚性参数
//% gamma: viscosity parameter 粘性参数
//% kappa: external force weight 权重
//% fx,fy: external force field 力量场
//
//% Chenyang Xu and Jerry L. Prince, 4/1/95, 6/17/97
//% Copyright (c) 1995-97 by Chenyang Xu and Jerry L. Prince
//% Image Analysis and Communications Lab, Johns Hopkins University
//
//
//% generates the parameters for snake
//
//N = length(x); % x的长度
//
//alpha = alpha* ones(1,N);
//beta = beta*ones(1,N);
//
//% produce the five diagnal vectors
//alpham1 = [alpha(2:N) alpha(1)];
//alphap1 = [alpha(N) alpha(1:N-1)];
//betam1 = [beta(2:N) beta(1)];
//betap1 = [beta(N) beta(1:N-1)];
//
//a = betam1;
//b = -alpha - 2*beta - 2*betam1;
//c = alpha + alphap1 +betam1 + 4*beta + betap1;
//d = -alphap1 - 2*beta - 2*betap1;
//e = betap1;
//
//% generate the parameters matrix
//A = diag(a(1:N-2),-2) + diag(a(N-1:N),N-2);
//A = A + diag(b(1:N-1),-1) + diag(b(N), N-1);
//A = A + diag(c);
//A = A + diag(d(1:N-1),1) + diag(d(N),-(N-1));
//A = A + diag(e(1:N-2),2) + diag(e(N-1:N),-(N-2));
//
//invAI = inv(A + gamma * diag(ones(1,N)));
//
//for count = 1:ITER,
// vfx = interp2(fx,x,y,'*linear');
// vfy = interp2(fy,x,y,'*linear');
//
// % deform snake
// x = invAI * (gamma* x + kappa*vfx);
// y = invAI * (gamma* y + kappa*vfy);
//end
/////////////////////////////////////////////////////////////////
using namespace std;
void SnakeDeform( std::vector<CvPoint>& Contour,
double alpha,
double beta,
double gamma,
double kappa,
CvMat* u,
CvMat* v,
int iter )
{
//a = betam1;
//b = -alpha - 2*beta - 2*betam1;
//c = alpha + alphap1 +betam1 + 4*beta + betap1;
//d = -alphap1 - 2*beta - 2*betap1;
//e = betap1;
double l_dA = beta;
double l_dB = - alpha - 4.0 * beta;
double l_dC = 2.0 * alpha + 6.0 * beta;
double l_dD = - alpha - 4.0 * beta;
double l_dE = beta;
int l_ContourSize = Contour.size();
//求解A
CvMat* A = cvCreateMat( l_ContourSize, l_ContourSize, CV_32FC1 );
cvZero( A );
//A = diag(a(1:N-2),-2) + diag(a(N-1:N),N-2);
//A = A + diag(b(1:N-1),-1) + diag(b(N), N-1);
//A = A + diag(c);
//A = A + diag(d(1:N-1),1) + diag(d(N),-(N-1));
//A = A + diag(e(1:N-2),2) + diag(e(N-1:N),-(N-2));
for ( int j = 0; j < l_ContourSize; j ++ )
{
int l_ap = ( j + 2 + l_ContourSize ) % l_ContourSize;
int l_bp = ( j + 1 + l_ContourSize ) % l_ContourSize;
int l_cp = j;
int l_dp = ( j - 1 + l_ContourSize ) % l_ContourSize;
int l_ep = ( j - 2 + l_ContourSize ) % l_ContourSize;
cvmSet( A, l_ap, j, l_dA );
cvmSet( A, l_bp, j, l_dB );
cvmSet( A, l_cp, j, l_dC );
cvmSet( A, l_dp, j, l_dD );
cvmSet( A, l_ep, j, l_dE );
}//for ( int j = 0; j < l_ContourSize; j ++ )
//invAI = inv(A + gamma * diag(ones(1,N)));
for ( int i = 0; i < l_ContourSize; i ++ )
{
double l_dGamma = cvmGet( A, i, i ) + gamma;
cvmSet( A, i, i, l_dGamma );
}//for ( int i = 0; i < l_ContourSize; i ++ )
cvInvert( A, A );
//for count = 1:ITER,
// vfx = interp2(fx,x,y,'*linear');
// vfy = interp2(fy,x,y,'*linear');
//
// % deform snake
// x = invAI * (gamma* x + kappa*vfx);
// y = invAI * (gamma* y + kappa*vfy);
//end
//存储点的横纵坐标
CvMat* l_mXi = cvCreateMat( l_ContourSize, 1, CV_32FC1 );
CvMat* l_mYi = cvCreateMat( l_ContourSize, 1, CV_32FC1 );
for ( int i = 0; i < l_ContourSize; i ++ )
{
cvmSet( l_mXi, i, 0, Contour[ i ].x );
cvmSet( l_mYi, i, 0, Contour[ i ].y );
}//for ( int i = 0; i < l_ContourSize; i ++ )
CvMat* l_mVfx = cvCreateMat( l_ContourSize, 1, CV_32FC1 );
CvMat* l_mVfy = cvCreateMat( l_ContourSize, 1, CV_32FC1 );
for ( int k = 0; k < iter; k ++ )
{
for ( int i = 0; i < l_ContourSize; i ++ )
{
int l_iXi = ( int )cvmGet( l_mXi, i, 0 );
int l_iYi = ( int )cvmGet( l_mYi, i, 0 );
double l_dVfx = cvmGet( u, l_iYi, l_iXi );
double l_dVfy = cvmGet( v, l_iYi, l_iXi );
cvmSet( l_mVfx, i, 0, l_dVfx );
cvmSet( l_mVfy, i, 0, l_dVfy );
}//for ( int i = 0; i < l_ContourSize; i ++ )
// x = invAI * (gamma* x + kappa*vfx);
// y = invAI * (gamma* y + kappa*vfy);
cvConvertScale( l_mXi, l_mXi, gamma );
cvConvertScale( l_mYi, l_mYi, gamma );
cvConvertScale( l_mVfx, l_mVfx, kappa );
cvConvertScale( l_mVfy, l_mVfy, kappa );
cvAdd( l_mXi, l_mVfx, l_mVfx );
cvAdd( l_mYi, l_mVfy, l_mVfy );
cvmMul( A, l_mVfx, l_mXi );
cvmMul( A, l_mVfy, l_mYi );
Contour.clear();
for ( int i = 0; i < l_ContourSize; i ++ )
{
int l_tempX = ( int )cvmGet( l_mXi, i, 0 );
int l_tempY = ( int )cvmGet( l_mYi, i, 0 );
Contour.push_back( cvPoint( l_tempX, l_tempY ) );
}//for ( int i = 0; i < l_ContourSize; i ++ )
}//for ( int k = 0; k < iter; k ++ )
}
没有合适的资源?快使用搜索试试~ 我知道了~
GVF_snake-Cpp.zip_GVF snake_GVF模型_snake gvf_snake 算法_snake模型算法
共38个文件
jpg:18个
cpp:12个
h:6个
1.该资源内容由用户上传,如若侵权请联系客服进行举报
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
版权申诉
0 下载量 81 浏览量
2022-09-24
07:27:56
上传
评论
收藏 562KB ZIP 举报
温馨提示
这是用matlab编写的边缘检测算法GVF-Snack模型算法的程序
资源推荐
资源详情
资源评论
收起资源包目录
GVF_snake-Cpp.zip (38个子文件)
GVF_snake-Cpp
GVF_line
GlobalFun.cpp 3KB
GlabalData.cpp 1KB
GlobalFun.h 765B
test.JPG 12KB
GVF_Line.cpp 4KB
rect.jpg 2KB
GlobalData.h 1KB
slin.JPG 2KB
SnakeInterp.cpp 2KB
SnakeDeform.cpp 6KB
GVFC.cpp 5KB
GVFFun.h 926B
GVF_space
GlobalFun.cpp 3KB
ct1.jpg 5KB
GlabalData.cpp 1KB
GlobalFun.h 765B
space.JPG 11KB
test.JPG 12KB
rect.jpg 2KB
test100.JPG 10KB
s5.bmp 512KB
GVF_Snake.cpp 4KB
s4.bmp 337KB
GlobalData.h 1KB
SnakeInterp.cpp 3KB
SnakeDeform.cpp 6KB
line1.JPG 6KB
line.JPG 6KB
cell.jpg 12KB
moon.JPG 16KB
test40.JPG 10KB
ct2.jpg 4KB
test400.JPG 25KB
apple.jpg 5KB
GVFC.cpp 5KB
GVFFun.h 926B
football.jpg 26KB
lena.jpg 90KB
共 38 条
- 1
资源评论
邓凌佳
- 粉丝: 65
- 资源: 1万+
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功