Toolbox Fast Marching: nb_dims(x) - File Exchange

Code covered by the BSD License

Highlights from
Toolbox Fast Marching

Toolbox Fast Marching - A too...
callback_active_contour(x, op... callback_active_contour - callback for conjugate gradient
check_face_vertex(vertex,face... check_face_vertex - check that vertices and faces have the correct size
clamp(x,a,b)
compute_alpha_map(aname, opti... compute_alpha_map - set up alphamap
compute_bending_invariant(ver... compute_bending_invariant - compute bending invariants
compute_cuvilinear_abscice(c) compute_cuvilinear_abscice - compute the curvilinear abscice of a curve
compute_distance_landmark(sta... compute_distance_landmark - compute an heuristic using landmark points
compute_distance_to_points(X,... compute_distance_to_points - compute euclidean distance to a set of points.
compute_eccentricity_transfor... compute_eccentricity_transform - compute the eccentricity of a binary shape
compute_edge_energy(M,s,epsi,... compute_edge_energy - compute an energy for fast marching.
compute_edge_face_ring(face) compute_edge_face_ring - compute faces adjacent to each edge
compute_edges(face) compute_edges - from a list of faces, compute the list of (unique) edges.
compute_gaussian_filter(n,s,N... compute_gaussian_filter - compute a 1D or 2D Gaussian filter.
compute_geodesic(D, x, option... compute_geodesic - extract a discrete geodesic in 2D and 3D
compute_geodesic_mesh(D, vert... compute_geodesic_mesh - extract a discrete geodesic on a mesh
compute_grad(M,options) compute_grad - compute the gradient of an image using central differences
compute_heuristic_landmark(DL... compute_heuristic_landmark - compute an heuristic using landmark points
compute_heuristic_multiresolu... % compute coarse resolution map
compute_levelset_shape(name, ... compute_levelset_shape - compute some basic level set shapes
compute_saddle_points(Q,D,mas... compute_saddle_points - compute saddle points of a Voronoi segmentation
compute_shape_boundary(M) compute_shape_boundary - extract boundary points
compute_vertex_ring(face) compute_vertex_ring - compute the 1 ring of each vertex in a triangulation.
compute_voronoi_triangulation... compute_voronoi_triangulation - compute a triangulation
compute_voronoi_triangulation... compute_voronoi_triangulation_mesh - compute a triangulation
convert_distance_color(D,M) convert_distance_color - convert a distance function to a color image
crop(M,n,c) crop - crop an image to reduce its size
display_eccentricity(E, mode) display_eccentricity - display the transform
display_segmentation(B,M) display_segmentation - display a level set segmentation
divgrad(M,options) divgrad - compute either gradient or divergence.
eucdist2(varargin) EUCDIST2 Compute 2-D Euclidean distance transform.
generate_constrained_map(M,nb... generate_constrained_map - generate a constraint map from a 2D map.
getoptions(options, name, v, ... getoptions - retrieve options parameter
image_resize(img,p1,q1,r1) image_resize - resize an image using bicubic interpolation
imageplot(M,str, a,b,c) imageplot - diplay an image and a title
load_image(type, n, options) load_image - load benchmark images.
load_potential_map(name, n, o... load_potential_map - prepare a potential map for FM computations
mmax(A) mmax - maximum entry from a matrix.
nb_dims(x) nb_dims - debugged version of ndims.
num2string_fixeddigit(num, d) num2string_fixeddigit - convert a number to string with a fixed number of digits
perform_active_contour(D0, mo... perform_active_contour - perform active contour resolution
perform_blurring(M, sigma, op... perform_blurring - gaussian blurs an image
perform_circular_fast_marchin... perform_circular_fast_marching_2d - launch the Fast Marching algorithm for circular propagation.
perform_conjugate_gradient(A,... perform_conjugate_gradient - perform conjugate gradient
perform_contour_extraction(M,... perform_contour_extraction - exctract the geometry of
perform_convolution(x,h, boun... perform_convolution - compute convolution with centered filter.
perform_curve_extraction(M, t... perform_curve_extraction - extract level set curves from an image.
perform_curve_resampling(c, s... perform_curve_resampling - resample a curve
perform_farthest_landmark_sam... perform_farthest_landmark_sampling - samples landmark using least error seeding strategy
perform_farthest_point_sampli... perform_farthest_point_sampling - samples points using farthest seeding strategy
perform_farthest_point_sampli... perform_farthest_point_sampling - samples points using farthest seeding strategy
perform_farthest_point_sampli... perform_farthest_point_sampling - samples points using farthest seeding strategy
perform_fast_marching(W, star... perform_fast_marching - launch the Fast Marching algorithm, in 2D or 3D.
perform_fast_marching(W, star... perform_fast_marching - launch the Fast Marching algorithm, in 2D or 3D.
perform_fast_marching_mesh(ve... perform_fast_marching_mesh - launch the Fast Marching algorithm on a 3D mesh.
perform_fmstar_2d(W, start_po... perform_fmstar_2d - launch the Fast Marching* algorithm.
perform_fmstar_3d(W, start_po... perform_fmstar_3d - launch the Fast Marching* algorithm in 3D.
perform_front_propagation_2d_... [D,S] = perform_front_propagation_2d_slow(W,start_points,end_points,nb_iter_max,H);
perform_geodesic_interpolatio... perform_geodesic_interpolation - interpolate function values
perform_histogram_equalizatio... perform_histogram_equalization - perform histogram equalization
perform_lloyd_mesh(vertex,fac... perform_lloyd_mesh - perform lloyd relaxation to sample point on a mesh
perform_redistancing(D, optio... perform_redistancing - redistance a function
perform_tensor_recomp(e1,e2,l... perform_tensor_recomp - create the tensor field corresponding to the given eigendecomposition.
perform_vf_normalization(v1) perform_vf_normalization - renormalize a vf.
pick_curves(mask) pick_curves - ask for the user to build a set of curves
pick_start_end_point(M, no_en... pick_start_end_point - pick start/end points for front propagation.
plot_constrained_path_planing... plot_constrained_path_planing - plot the result of the fast marching.
plot_edges(edges, vertex, col... plot_edges - plot a list of edges
plot_fast_marching_2d(W,S,pat... plot_fast_marching_2d - plot the result of the fast marching.
plot_fast_marching_3d(W,S,pat... plot_fast_marching_3d - plot the result of the fast marching.
plot_fast_marching_mesh(verte... plot_fast_marching_mesh - plot the result of the fast marching on a mesh.
plot_mesh(vertex,face,options...
plot_volumetric_data(W, nb_co... plot_volumetric_data - plot a cube of data.
prod_vf_sf(v1,s) prod_vf_sf - compute the product of a vector field by a scalar field.
progressbar(n,N,w) progressbar - display a progress bar
publish_html(filename, output... publish_html - publish a file to HTML format
read_mesh(file)
read_off(filename) read_off - read data from OFF file.
rescale(x,a,b)
triangulation2adjacency(face,... triangulation2adjacency - compute the adjacency matrix
vol3d(varargin)
batch_landmarks_error.m
batch_propagation_mesh.m
batch_shape_meshing.m
compile_mex.m
perform_front_propagation_2d.m
testFM2dAniso.m
test_active_contour.m
test_anisotropic.m
test_anisotropic_feth.m
test_anisotropic_fm.m
test_anisotropic_fm_old.m
test_bending_invariants.m
test_bug.m
test_circular.m
test_circular_fast_marching_2...
test_circular_prior.m
test_constrained_map.m
test_distance_approximation.m
test_distance_compression.m
test_eccentricity.m
test_eucldist.m
test_farthest_sampling_2d.m
test_farthest_sampling_3d.m
test_farthest_sampling_mesh.m
test_farthest_sampling_shape.m
test_fast_marching_2d.m
test_fast_marching_3d.m
test_fmstar_2d.m
test_fmstar_3d.m
test_fmstar_error.m
test_fmstar_landmark.m
test_fmstar_path_planing.m
test_fmstar_weight_2d.m
test_geodesic_interpolation.m
test_geodesic_vs_euclidean.m
test_heuristic_mesh.m
test_influence.m
test_landmark.m
test_landmark_error.m
test_multiple_paths_2d.m
test_multiple_paths_3d.m
test_path_planing.m
test_propagation_2d.m
test_propagation_mesh.m
test_propagation_shape.m
test_redistancing.m
test_segmentation.m
test_skeleton.m
test_vol3d.m
test_voronoi_segmentation.m
test_voronoi_triangulation.m
toolbox_fast_marching.m
View all files

from Toolbox Fast Marching by Gabriel Peyre
A toolbox for the computation of the Fast Marching algorithm in 2D and 3D.

nb_dims(x)

function d = nb_dims(x)

% nb_dims - debugged version of ndims.
%
%   d = nb_dims(x);
%
%   Copyright (c) 2004 Gabriel Peyr

if isempty(x)
    d = 0;
    return;
end

d = ndims(x);

if d==2 && (size(x,1)==1 || size(x,2)==1)
    d = 1;
end

Highlights from Toolbox Fast Marching

Highlights from
Toolbox Fast Marching