Contour Correspondence via Ant Colony Optimization: simmat_euclidean(g1, g2) - File Exchange

Code covered by the BSD License

Highlights from
Contour Correspondence via Ant Colony Optimization

[BH,mean_dist]=sc_compute(Bsa... [BH,mean_dist]=sc_compute(Bsamp,Tsamp,mean_dist,nbins_theta,nbins_r,r_inner,r_outer,out_vec);
[C,T]=hungarian(A) % HUNGARIAN Solve the Assignment problem using the Hungarian method.
aco_matching(Y1, Y2, Dist1, D... % Compute a matching between two shapes using the ACO algorithm
area_normalize(old_c) % This function normalizes the area enclosed by a closed 2D contour
bipartite_matching(Y1, Y2, S) % Compute the bipartite matching between two shapes according to the
construct_matching(G, S, Dist... % This function constructs a matching for the ACO algorithm
contour_area(c) % This function computes the area enclosed by a closed 2D contour.
contour_length(X) % This function computes the length of a contour
dist2(x, c) DIST2 Calculates squared distance between two sets of points.
distance_matrix(Y) % Compute the pairwise distances between vertices/points of a 2D shape
evaluate_matching(G, S, Dist1... % This function computes the cost for a given matching
extract_descriptor(Y, descrip... % Compute a shape descriptor for a given shape
extract_shape_context(Y) % Compute shape context descriptor
order_preserving_matching(Y1,... % Compute an order preserving matching between two shapes according to
pairwise_geodesic_dist(Y, ope... % Compute pairwise geodesic distances for an open or closed 2D contour
shape_matching(Y1, Y2, vararg... % Compute the matching between two 2D shapes (contours or general sets
show_contour(c, varargin) % This function plots a contour specified by a list of 2D points
signed_triangle_area(A, B, C) % This function returns the *signed* area of a triangle
simmat_chisquare(g1, g2) % This function returns a similarity matrix for two sets of
simmat_euclidean(g1, g2) % This function returns a similarity matrix for two sets of
update_pheromones(G, matching... % This function updates the pheromone matrix according to a set of
valid_range(vertex, matching,... % This function computes the range of valid assignments for a vertex,
viz_matching(Y1, Y2, K, varar... % This function uses numerical labelling to show the correspondence
set_global.m
View all files

from Contour Correspondence via Ant Colony Optimization by Oliver van Kaick
Computes a correspondence between two shapes based on ant colony optimization (ACO).

simmat_euclidean(g1, g2)

%
% This function returns a similarity matrix for two sets of
% signatures g1 and g2 based on the Euclidean distance
%
%   S = simmat_euclidean(g1, g2)
%
% -----------------------------------------------------------------
% (C) Richard (Hao) Zhang (2006)
%
function M = simmat_euclidean(g1, g2)

n1 = length(g1(:,1));
n2 = length(g2(:,1));

S = zeros(n1, n2);

for i = 1:n1
    for j = 1:n2
        S(i,j) = norm(g1(i,:) - g2(j,:));
    end
end

% Create structure
M.max_value = max(max(S));
M.value = S;

Highlights from Contour Correspondence via Ant Colony Optimization

Highlights from
Contour Correspondence via Ant Colony Optimization