Date: Feb 23, 2013 8:55 AM
Author: Abder-Rahman
Subject: Distance between vectors, and does “bsxfun” do a<br> nything here?

Say we have the following matrix x:

x = [1 4 3; 6 4 3; 6 9 3; 2 4 3; 5 4 0; 5 3 1; 6 4 7];

And, say that from that matrix, we selcted the following pixels to be our points of interest:

p = [4 6 9 0];

For each element in x, say we have a degree of membership that ranges from 0-1 and which represents how much oes that element belong to some region.

Say, also, that we have some elements as a vector from that region of interest and which were set to 1 as follows:

C = [1 1 1 1 1 1 1];

Provided that the degree of membership values of those elements = 1

Let us assume that the degree of membership values of each element represents the feature of that element, my question is: How can we select the point p that minimizes the distance between x & C?

Does bsxfun help in anyway here?

Thanks.