findmcttrp.m

来自「beamlet变化的工具箱」· M 代码 · 共 36 行

%  FindMCTTRP -- find minimum cost to time ratio path in the beamlet graph
%   Usage
%     [vlist,ratio] = FindMCTTRP(cost,time,v0,v1,uppertime,uppernlist,stoptime);
%   Inputs
%     cost        cost values for beams
%     time        time values for beams
%     v0          starting vertex
%     v1          end vertex
%     uppertime   maximum possible time,         default = 10*n
%     uppernlist  maximum number of quadruplets, default = 1000
%     stoptime    stopping time,                 default = 8*n*n*log2(n), |E|
%   Outputs
%     vlist     list of traversing vertices
%     ratio     cost to time ratio
%   Description
%      1. Use a dynamic programming approach in "Using beamlet pyramid and
%       dynamic programming to extract filament from very noisy image data".
%      2. Require O(n+1 * n+1 * uppernlist * 5) storage
%   See Also
%      FindConnVert, Vert2Indx, IsDominated, IsCross,
%      ScanTList, AddNewDP, ExtractPath.
%
%
% Part of BeamLab Version:200
% Built:Friday,23-Aug-2002 00:00:00
% This is Copyrighted Material
% For Copying permissions see COPYING.m
% Comments? e-mail [e-mail]
%
%
% Part of BeamLab Version:200
% Built:Saturday,14-Sep-2002 00:00:00
% This is Copyrighted Material
% For Copying permissions see COPYING.m
% Comments? e-mail [e-mail]
%