Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

Thread Subject:
complicated situation :'(

Subject: complicated situation :'(

From: Manal

Date: 17 Jun, 2010 22:19:04

Message: 1 of 29

Hi all
I have complicated case and I can't deal with
hope some could give suggestions

http://img687.imageshack.us/img687/7439/screenshot20100617at230.png


in the picture above the border's values are stored in Matrix B ( the index x and y for each point)


it is stored ordered by the value over the axis y


I want to change the matrix order to be start with one point draw all the next points and end with the same point ( like drawing a circle )

its complicated :'(

any ideas ???


thanks in advance

Subject: complicated situation :'(

From: sscnekro

Date: 18 Jun, 2010 00:19:21

Message: 2 of 29

> I want to change the matrix order to be start with one point draw all the next points and end with the same point ( like drawing a circle )

I don't know anything on this, but .. if the points don't really have "neighbouring" coordinates, what would it help to rearrange the order? Do you want to connect them by a line or??

Subject: complicated situation :'(

From: Manal

Date: 18 Jun, 2010 01:04:06

Message: 3 of 29

I'll draw a graph from these points (depending on their index)
they have to be ordered sequentially starting from the head for example and finish at the same point ( the same head point)

I don't know how this can be happen :(

Subject: complicated situation :'(

From: ImageAnalyst

Date: 18 Jun, 2010 01:34:01

Message: 4 of 29

I don't have any idea which of the dozens of "boundary" points should
be attached to the single point in the center, near the centroid. And
I don't know which point of the "main" boundary should be connected to
which, and how many, of the points in the small cluster near the
bottom of the image.

Why don't you take a step back and look at the situation so that you
don't have to solve that problem. So . . . how did you get the points
in the first place? Maybe you can get the boundary at that time, say
with bwboundaries(), and not have to solve the problem that you
initially posed.

Subject: complicated situation :'(

From: someone

Date: 18 Jun, 2010 01:44:03

Message: 5 of 29

"Manal " <be.san@live.com> wrote in message <hvegm6$qn7$1@fred.mathworks.com>...
> I'll draw a graph from these points (depending on their index)
> they have to be ordered sequentially starting from the head for example and finish at the same point ( the same head point)
>
> I don't know how this can be happen :(

If I understand your situation, you might try a procedure something like this:

1) Start with A = M(x1,y1) % an initial point
2) Set M(x1,y1) = [] % remove that point
3) Calculate the minimum distance (or distance squared) to every other point using
      d = min(sqrt((M-x1).2 + (M-y1).2)) % don't really need sqrt
4) Use find to get the index of the minimum distance.
      (You will have to decide what to do in case of ties.)
5) Set A = [A;M(xd,yd)]
6) Set M(xd,yd) = []
7) Repeat steps 3 - 6 until M is empty

A should be a matrix with your desired order.

I'm sure there is lots of optimizing and degugging required with the above procedure, but you should get the idea.

Subject: complicated situation :'(

From: ImageAnalyst

Date: 18 Jun, 2010 02:19:40

Message: 6 of 29

On Jun 17, 9:44 pm, "someone" <some...@somewhere.net> wrote:
> "Manal " <be....@live.com> wrote in message <hvegm6$qn...@fred.mathworks.com>...
> > I'll draw a graph from these points (depending on their index)
> > they have to be ordered sequentially starting from the head for example and finish at the same point ( the same head point)
>
> > I don't know how this can be happen :(
>
> If I understand your situation, you might try a procedure something like this:
>
> 1) Start with A = M(x1,y1) % an initial point
> 2) Set M(x1,y1) = []   % remove that point
> 3) Calculate the minimum distance (or distance squared) to every other point using
>       d = min(sqrt((M-x1).2 + (M-y1).2))  % don't really need sqrt
> 4) Use find to get the index of the minimum distance.
>       (You will have to decide what to do in case of ties.)
> 5) Set A = [A;M(xd,yd)]
> 6) Set M(xd,yd) = []
> 7) Repeat steps 3 - 6 until M is empty
>
> A should be a matrix with your desired order.
>
> I'm sure there is lots of optimizing and degugging required with the above procedure, but you should get the idea.

---------------------------------------------------------------
Yeah I thought of something similar except that you need to find the
TWO closest other points since every point will have two lines leaving
it, not just one. And like I said before (and you hinted at) even
that will break down for certain points (like that point in the middle
which will likely have two strange lines coming from somewhere on the
boundary to snag it). I'd just tackle the problem at an earlier stage
to avoid the mess. For example, he may have got the points from a
binary image and could have just gotten the boundary with
bwboundaries() instead of find() or whatever he did.

Subject: complicated situation :'(

From: Manal

Date: 18 Jun, 2010 10:53:05

Message: 7 of 29

ImageAnalyst <imageanalyst@mailinator.com> wrote in message <2f3f77cc-5532-4603-a02e-952f30d66ce4@z25g2000vbk.googlegroups.com>...
> I don't have any idea which of the dozens of "boundary" points should
> be attached to the single point in the center, near the centroid. And
> I don't know which point of the "main" boundary should be connected to
> which, and how many, of the points in the small cluster near the
> bottom of the image.
>
> Why don't you take a step back and look at the situation so that you
> don't have to solve that problem. So . . . how did you get the points
> in the first place? Maybe you can get the boundary at that time, say
> with bwboundaries(), and not have to solve the problem that you
> initially posed.

thanks for your replay

the centroid is not a problem since its drawn in another stage
the problem is only in the boundary

I was thinking to solve it from earlier stage as you have suggested but I did not found a solution
this boundary has been extracted from the image using Sobel edge detection
B = edge(im1,'sobel'); %finding edges

after that I extracted the none zero values from the B to be the boundary points
if B(i,j)>0
    s(x,1)=i;
    s(x,2)=j;
    x=x+1;
end

I know that the problem start from here
but I don't have any idea how can I solve it

Subject: complicated situation :'(

From: Manal

Date: 18 Jun, 2010 10:57:06

Message: 8 of 29

"someone" <someone@somewhere.net> wrote in message <hvej13$loi$1@fred.mathworks.com>...
> "Manal " <be.san@live.com> wrote in message <hvegm6$qn7$1@fred.mathworks.com>...
> > I'll draw a graph from these points (depending on their index)
> > they have to be ordered sequentially starting from the head for example and finish at the same point ( the same head point)
> >
> > I don't know how this can be happen :(
>
> If I understand your situation, you might try a procedure something like this:
>
> 1) Start with A = M(x1,y1) % an initial point
> 2) Set M(x1,y1) = [] % remove that point
> 3) Calculate the minimum distance (or distance squared) to every other point using
> d = min(sqrt((M-x1).2 + (M-y1).2)) % don't really need sqrt
> 4) Use find to get the index of the minimum distance.
> (You will have to decide what to do in case of ties.)
> 5) Set A = [A;M(xd,yd)]
> 6) Set M(xd,yd) = []
> 7) Repeat steps 3 - 6 until M is empty
>
> A should be a matrix with your desired order.
>
> I'm sure there is lots of optimizing and degugging required with the above procedure, but you should get the idea.


thanks a lot
I'll try your suggestion
it seems reasonable for me
but do I have to calculate the distance from the current point that I am testing point to each other points??
I'll try your code and comeback with the results

thanks a lot

Subject: complicated situation :'(

From: Manal

Date: 18 Jun, 2010 13:15:21

Message: 9 of 29

"someone" <someone@somewhere.net> wrote in message <hvej13$loi$1@fred.mathworks.com>...
> "Manal " <be.san@live.com> wrote in message <hvegm6$qn7$1@fred.mathworks.com>...
> > I'll draw a graph from these points (depending on their index)
> > they have to be ordered sequentially starting from the head for example and finish at the same point ( the same head point)
> >
> > I don't know how this can be happen :(
>
> If I understand your situation, you might try a procedure something like this:
>
> 1) Start with A = M(x1,y1) % an initial point
> 2) Set M(x1,y1) = [] % remove that point
> 3) Calculate the minimum distance (or distance squared) to every other point using
> d = min(sqrt((M-x1).2 + (M-y1).2)) % don't really need sqrt
> 4) Use find to get the index of the minimum distance.
> (You will have to decide what to do in case of ties.)
> 5) Set A = [A;M(xd,yd)]
> 6) Set M(xd,yd) = []
> 7) Repeat steps 3 - 6 until M is empty
>
> A should be a matrix with your desired order.
>
> I'm sure there is lots of optimizing and degugging required with the above procedure, but you should get the idea.



% Reorder the Matrix s
n=x-1;
u=1;
for k=1:n
    A(u,1)=s(k,1);
    A(u,2)=s(k,2);
    s(k,:)=0;
    i=1;
    dt=0;
    for o=1:n
        xt=s(o,2);
        yt=s(o,1);
        dt(i,1) = sqrt((xt-A(u,2))^2 + (yt-A(u,1))^2);
        dt(i,2) = A(u,1);
        dt(i,3) = A(u,2);
        i=i+1;
    end
    u=u+1;
    [r,c,v]=find(min(dt(:,1)));
end

is this true so far??
I feel there is something wrong
how can I find the values that have the minimum distance ??

Subject: complicated situation :'(

From: someone

Date: 18 Jun, 2010 13:52:05

Message: 10 of 29

"Manal " <be.san@live.com> wrote in message <hvfrh9$qpj$1@fred.mathworks.com>...
> "someone" <someone@somewhere.net> wrote in message <hvej13$loi$1@fred.mathworks.com>...
> > "Manal " <be.san@live.com> wrote in message <hvegm6$qn7$1@fred.mathworks.com>...
> > > I'll draw a graph from these points (depending on their index)
> > > they have to be ordered sequentially starting from the head for example and finish at the same point ( the same head point)
> > >
> > > I don't know how this can be happen :(
> >
> > If I understand your situation, you might try a procedure something like this:
> >
> > 1) Start with A = M(x1,y1) % an initial point
> > 2) Set M(x1,y1) = [] % remove that point
> > 3) Calculate the minimum distance (or distance squared) to every other point using
> > d = min(sqrt((M-x1).2 + (M-y1).2)) % don't really need sqrt
> > 4) Use find to get the index of the minimum distance.
> > (You will have to decide what to do in case of ties.)
> > 5) Set A = [A;M(xd,yd)]
> > 6) Set M(xd,yd) = []
> > 7) Repeat steps 3 - 6 until M is empty
> >
> > A should be a matrix with your desired order.
> >
> > I'm sure there is lots of optimizing and degugging required with the above procedure, but you should get the idea.
>
>
>
> % Reorder the Matrix s
> n=x-1;
> u=1;
> for k=1:n
> A(u,1)=s(k,1);
> A(u,2)=s(k,2);
> s(k,:)=0;
> i=1;
> dt=0;
> for o=1:n
> xt=s(o,2);
> yt=s(o,1);
> dt(i,1) = sqrt((xt-A(u,2))^2 + (yt-A(u,1))^2);
> dt(i,2) = A(u,1);
> dt(i,3) = A(u,2);
> i=i+1;
> end
> u=u+1;
> [r,c,v]=find(min(dt(:,1)));
> end
>
> is this true so far??
> I feel there is something wrong
> how can I find the values that have the minimum distance ??

% To find the index (idx) of values that have the minimum distance:
mind = min(dt(:,1));
idx = find(dt(:,1) - mind)

Subject: complicated situation :'(

From: Manal

Date: 18 Jun, 2010 14:09:05

Message: 11 of 29

"someone" <someone@somewhere.net> wrote in message <hvftm5$f59$1@fred.mathworks.com>...
>
> % To find the index (idx) of values that have the minimum distance:
> mind = min(dt(:,1));
> idx = find(dt(:,1) - mind)

idx = find(dt(:,1) - mind)
this returns a vector of values
while it should be two values ( x values and y values ) !!!!!!

Subject: complicated situation :'(

From: Manal

Date: 18 Jun, 2010 14:50:08

Message: 12 of 29

% Reorder the Matrix s
n=x-1;
u=1;
for k=1:n
    A(u,1)=s(k,1);
    A(u,2)=s(k,2);
    s(k,:)=0;
    i=1;
    dt=0;
    for o=1:n
        xt=s(o,2);
        yt=s(o,1);
        dt(i,1) = sqrt((xt-A(u,2))^2 + (yt-A(u,1))^2);
        dt(i,2) = A(u,1);
        dt(i,3) = A(u,2);
        i=i+1;
    end
    u=u+1;
    mind = min(dt(:,1));
    
    idx = find(dt(:,1)== mind);
    A(u,1)=dt(idx,2);
    A(u,2)=dt(idx,3);
    u=u+1;
    
    idx2 = find(s(:,1)== dt(idx,2));
    s(idx2,:)=0;
end
disp(A);
disp('------------------------------------------');
disp(s);


this is the code that I have implemented so far
but I've got an errors in these lines

    A(u,1)=dt(idx,2);
    A(u,2)=dt(idx,3);
    
    idx2 = find(s(:,1)== dt(idx,2));

any help ?? :(

Subject: complicated situation :'(

From: someone

Date: 18 Jun, 2010 19:12:04

Message: 13 of 29

"Manal " <be.san@live.com> wrote in message <hvg12v$o3o$1@fred.mathworks.com>...
> % Reorder the Matrix s
> n=x-1;
> u=1;
> for k=1:n
> A(u,1)=s(k,1);
> A(u,2)=s(k,2);
> s(k,:)=0;
> i=1;
> dt=0;
> for o=1:n
> xt=s(o,2);
> yt=s(o,1);
> dt(i,1) = sqrt((xt-A(u,2))^2 + (yt-A(u,1))^2);
> dt(i,2) = A(u,1);
> dt(i,3) = A(u,2);
> i=i+1;
> end
> u=u+1;
> mind = min(dt(:,1));
>
> idx = find(dt(:,1)== mind);
> A(u,1)=dt(idx,2);
> A(u,2)=dt(idx,3);
> u=u+1;
>
> idx2 = find(s(:,1)== dt(idx,2));
> s(idx2,:)=0;
> end
> disp(A);
> disp('------------------------------------------');
> disp(s);
>
>
> this is the code that I have implemented so far
> but I've got an errors in these lines
>
> A(u,1)=dt(idx,2);
> A(u,2)=dt(idx,3);
>
> idx2 = find(s(:,1)== dt(idx,2));
>
> any help ?? :(

doc find

% Basically, (if i remember right),
% find returns the index of a vector whose value is zero.
% so, try replacing
idx2 = find(s(:,1)== dt(idx,2));
% with something like
idx2 = find(s(:,1) - dt(idx,2));

Subject: complicated situation :'(

From: us

Date: 18 Jun, 2010 19:56:04

Message: 14 of 29

"Manal " <be.san@live.com> wrote in message <hve70o$2dg$1@fred.mathworks.com>...
> Hi all
> I have complicated case and I can't deal with
> hope some could give suggestions
>
> http://img687.imageshack.us/img687/7439/screenshot20100617at230.png
>
>
> in the picture above the border's values are stored in Matrix B ( the index x and y for each point)
>
>
> it is stored ordered by the value over the axis y
>
>
> I want to change the matrix order to be start with one point draw all the next points and end with the same point ( like drawing a circle )
>
> its complicated :'(
>
> any ideas ???
>
>
> thanks in advance

a hint:
- this FEX submission will help you to achieve what you want...
- look at the accompanying published M-file (towards the end)...

http://www.mathworks.com/matlabcentral/fileexchange/6760

us

Subject: complicated situation :'(

From: ImageAnalyst

Date: 18 Jun, 2010 22:14:25

Message: 15 of 29

On Jun 18, 6:53 am, "Manal " <be....@live.com> wrote:

>
> thanks for your replay
>
> the centroid is not a problem since its drawn in another stage
> the problem is only in the boundary
>
> I was thinking to solve it from earlier stage as you have suggested but I did not found a solution
> this boundary has been extracted from the image using Sobel edge detection
> B = edge(im1,'sobel'); %finding edges
>
> after that I extracted the none zero values from the B to be the boundary points
> if B(i,j)>0
>     s(x,1)=i;
>     s(x,2)=j;
>     x=x+1;
> end
>
> I know that the problem start from here
> but I don't have any idea how can I solve it
---------------------------------------------------------------------------------------

Aha! Now the problem has suddenly become much clearer. You started
out with a bad image to begin with - the one that edge gave you. What
you should have done was to use fspecial() and imfilter() instead of
edge() and then pick a more appropriate threshold than edge() does.
Then use imclose() to do a morphological closing on your edge blobs to
close up the gaps. Then use bwboundaries. Like I do in this demo to
find boundaries around that difficult cell in the standard cell.tif
image:

clc; % Clear the command window.
close all; % Close all figures (except those of imtool.)
imtool close all; % Close all imtool figures.
clear; % Erase all existing variables.
workspace; % Make sure the workspace panel is showing.
fontSize = 20;

% Change the current folder to the folder of this m-file.
if(~isdeployed)
cd(fileparts(which(mfilename)));
end

% Read in a standard MATLAB gray scale demo image.
folder = 'C:\Program Files\MATLAB\R2010a\toolbox\images\imdemos';
baseFileName = 'cell.tif';
fullFileName = fullfile(folder, baseFileName);
grayImage = imread(fullFileName);
% Get the dimensions of the image. numberOfColorBands should be = 1.

% Display the original gray scale image.
subplot(2, 2, 1);
imshow(grayImage, []);
title('Original Grayscale Image', 'FontSize', fontSize);
set(gcf, 'Position', get(0,'Screensize')); % Enlarge figure to full
screen.

% Do a Sobel filter - a real one, not the thresholded one edge() does.
H = fspecial('sobel');
verticalEdges = imfilter(grayImage, H, 'replicate');
horizontalEdges = imfilter(grayImage, H', 'replicate');
edgeImage = max(verticalEdges, horizontalEdges);
subplot(2,2,2);
imshow(edgeImage, []);
title('Edge Image', 'FontSize', fontSize);

% Make the edges more "solid" by closing them
se = strel('disk',10);
closedImage = imclose(edgeImage, se);
subplot(2,2,3);
imshow(closedImage, []);
title('Closed Image', 'FontSize', fontSize);

binaryImage = closedImage > 50;
subplot(2,2,4 );
imshow(binaryImage, []);
title('Thresholded Image', 'FontSize', fontSize);

% Find boundaries
boundaries = bwboundaries(binaryImage);

% Done! Now, plot the boundaries over the original image
numberOfBoundaries = size(boundaries);
subplot(2,2,1);
hold on;
for k = 1 : numberOfBoundaries
thisBoundary = boundaries{k};
plot(thisBoundary(:,2), thisBoundary(:,1), 'g', 'LineWidth', 2);
end
hold off;

Don't be put off by the above - it's mostly just code to initialize
and display things - the key code (calls to fspecial, imfilter,
imclose, thresholding, and bwboundaries) is really only 5 lines. Try
it with your image. If it doesn't work, then post your original image
somewhere.

It's much better to start off doing things in the right way than to
try some programmatical gynmnastics to fix up a bad result.

Subject: complicated situation :'(

From: Manal

Date: 19 Jun, 2010 02:27:04

Message: 16 of 29

ImageAnalyst <imageanalyst@mailinator.com> wrote in message <3e5fe037-b050-4136-8b77-7c8aca895672@y4g2000yqy.googlegroups.com>...
> Don't be put off by the above - it's mostly just code to initialize
> and display things - the key code (calls to fspecial, imfilter,
> imclose, thresholding, and bwboundaries) is really only 5 lines. Try
> it with your image. If it doesn't work, then post your original image
> somewhere.
>
> It's much better to start off doing things in the right way than to
> try some programmatical gynmnastics to fix up a bad result.
>

thanks a lot for your replay
your write, it will be better if I could solve the solution from earlier stages as reordering the bordered get worst so far

I tried your code and started it with
grayImage = imread('n.png');
grayImage=rgb2gray(grayImage);

but I got this result
http://img532.imageshack.us/img532/8501/screenshot20100619at031.png

:(

Subject: complicated situation :'(

From: ImageAnalyst

Date: 19 Jun, 2010 03:57:12

Message: 17 of 29

You didn't adjust the threshold for your image, did you?
You also may have to adjust the window size because it doesn't look
like it's getting the right edge of the man.
Post your original image. I can't do anything (easily) with just a
screenshot.

Subject: complicated situation :'(

From: Manal

Date: 19 Jun, 2010 12:18:04

Message: 18 of 29

ImageAnalyst <imageanalyst@mailinator.com> wrote in message <8744ca2e-4b5d-4120-b3ef-411b5f819092@z8g2000yqz.googlegroups.com>...
> You didn't adjust the threshold for your image, did you?
> You also may have to adjust the window size because it doesn't look
> like it's getting the right edge of the man.
> Post your original image. I can't do anything (easily) with just a
> screenshot.

I don't know how to adjust it :(
this is the original image

http://img215.imageshack.us/img215/3063/34659690.jpg

thanks a lot for your help I really appreciate that

Subject: complicated situation :'(

From: Manal

Date: 19 Jun, 2010 18:21:07

Message: 19 of 29

"someone" <someone@somewhere.net> wrote in message <hvej13$loi$1@fred.mathworks.com>...
> "Manal " <be.san@live.com> wrote in message <hvegm6$qn7$1@fred.mathworks.com>...
> > I'll draw a graph from these points (depending on their index)
> > they have to be ordered sequentially starting from the head for example and finish at the same point ( the same head point)
> >
> > I don't know how this can be happen :(
>
> If I understand your situation, you might try a procedure something like this:
>
> 1) Start with A = M(x1,y1) % an initial point
> 2) Set M(x1,y1) = [] % remove that point
> 3) Calculate the minimum distance (or distance squared) to every other point using
> d = min(sqrt((M-x1).2 + (M-y1).2)) % don't really need sqrt
> 4) Use find to get the index of the minimum distance.
> (You will have to decide what to do in case of ties.)
> 5) Set A = [A;M(xd,yd)]
> 6) Set M(xd,yd) = []
> 7) Repeat steps 3 - 6 until M is empty
>
> A should be a matrix with your desired order.
>
> I'm sure there is lots of optimizing and degugging required with the above procedure, but you should get the idea.


I follow your procedure and implemented the following code

% Reorder the Matrix s
[w,q]=size(s);
%n=x-1;
u=1;
for k=1:w

    if((s(k,1)~= 0) && (s(k,2)~= 0))
    A(u,1)=s(k,1);
    A(u,2)=s(k,2);
    
    s(k,:)=0;
    [w,q]=size(s);

    i=1;
      
    for o=1:w
        if((s(o,1)~= 0) && (s(o,2)~= 0))
        xt=s(o,2);
        yt=s(o,1);
        
        dt(i,1) = sqrt((xt-A(u,2))^2 + (yt-A(u,1))^2);
        dt(i,2) = yt;
        dt(i,3) = xt;
        i=i+1;
        end
    end
    u=u+1;
    mind = min(dt(:,1));
    idx = find(dt(:,1)== mind);
    
    [t,tt]=size(idx);
    if(t>1)
        for p=1:t
            A(u,1)=dt(idx(t),2);
            A(u,2)=dt(idx(t),3);
            u=u+1;
            idx2 = find(s(:,1)== dt(idx(t),2));
            s(idx2,:)=0;
            [w,q]=size(s);
        end
    else
        A(u,1)=dt(idx,2);
        A(u,2)=dt(idx,3);
        u=u+1;
        idx2 = find(s(:,1)== dt(idx,2) & s(:,2)== dt(idx,3));
        s(idx2,:)=0;
        [w,q]=size(s);
    end
    [w,q]=size(s);
    end
end
disp(A);
 
it is run correctly and draw the border but not in the circle order that I need
I don't what is the wrong
it becomes complicated more and more :(

Subject: complicated situation :'(

From: Manal

Date: 20 Jun, 2010 13:44:07

Message: 20 of 29

ImageAnalyst <imageanalyst@mailinator.com> wrote in message <8744ca2e-4b5d-4120-b3ef-411b5f819092@z8g2000yqz.googlegroups.com>...
> You didn't adjust the threshold for your image, did you?
> You also may have to adjust the window size because it doesn't look
> like it's getting the right edge of the man.
> Post your original image. I can't do anything (easily) with just a
> screenshot.

I posted my image here
hope you can help me

final chance for me

Subject: complicated situation :'(

From: us

Date: 20 Jun, 2010 13:55:25

Message: 21 of 29

"Manal " <be.san@live.com> wrote in message <hvl5v7$en0$1@fred.mathworks.com>...
> ImageAnalyst <imageanalyst@mailinator.com> wrote in message <8744ca2e-4b5d-4120-b3ef-411b5f819092@z8g2000yqz.googlegroups.com>...
> > You didn't adjust the threshold for your image, did you?
> > You also may have to adjust the window size because it doesn't look
> > like it's getting the right edge of the man.
> > Post your original image. I can't do anything (easily) with just a
> > screenshot.
>
> I posted my image here
> hope you can help me
>
> final chance for me

where's here...

us

Subject: complicated situation :'(

From: ImageAnalyst

Date: 20 Jun, 2010 14:28:29

Message: 22 of 29

On Jun 20, 9:44 am, "Manal " <be....@live.com> wrote:
> I posted my image here
> hope you can help me
>
> final chance for me
--------------------------------------------------------------
Are you requiring that you get the guy's hands and face too? They're
brighter than the immediate background but also the same intensity as
other background pixels?
But I won't be able to do anything. Starting this morning, I'm going
to be pretty tied up until Wednesday.
-ImageAnalyst

Subject: complicated situation :'(

From: Manal

Date: 20 Jun, 2010 15:38:04

Message: 23 of 29

ImageAnalyst <imageanalyst@mailinator.com> wrote in message <cf73e1b9-36c2-4eca-8e6a-36591aeb9b54@i31g2000yqm.googlegroups.com>...
> On Jun 20, 9:44 am, "Manal " <be....@live.com> wrote:
> > I posted my image here
> > hope you can help me
> >
> > final chance for me
> --------------------------------------------------------------
> Are you requiring that you get the guy's hands and face too? They're
> brighter than the immediate background but also the same intensity as
> other background pixels?
> But I won't be able to do anything. Starting this morning, I'm going
> to be pretty tied up until Wednesday.
> -ImageAnalyst

if I got the most far points in the hands and the head it will fine
just to determine its position
thanks a lot for your help
I'll be waiting for you
you are my final chance
I've tried all the suggestions and it does not work

Subject: complicated situation :'(

From: us

Date: 20 Jun, 2010 15:49:05

Message: 24 of 29

"Manal " <be.san@live.com> wrote in message <hvlcks$433$1@fred.mathworks.com>...
> ImageAnalyst <imageanalyst@mailinator.com> wrote in message <cf73e1b9-36c2-4eca-8e6a-36591aeb9b54@i31g2000yqm.googlegroups.com>...
> > On Jun 20, 9:44 am, "Manal " <be....@live.com> wrote:
> > > I posted my image here
> > > hope you can help me
> > >
> > > final chance for me
> > --------------------------------------------------------------
> > Are you requiring that you get the guy's hands and face too? They're
> > brighter than the immediate background but also the same intensity as
> > other background pixels?
> > But I won't be able to do anything. Starting this morning, I'm going
> > to be pretty tied up until Wednesday.
> > -ImageAnalyst
>
> if I got the most far points in the hands and the head it will fine
> just to determine its position
> thanks a lot for your help
> I'll be waiting for you
> you are my final chance
> I've tried all the suggestions and it does not work

well... let's just hope you do a bit more than just ...waiting for godot... who - as we all know - never made it to save the world...

us

Subject: complicated situation :'(

From: Manal

Date: 20 Jun, 2010 16:20:05

Message: 25 of 29

"us " <us@neurol.unizh.ch> wrote in message <hvld9h$de6$1@fred.mathworks.com>...
> "Manal " <be.san@live.com> wrote in message <hvlcks$433$1@fred.mathworks.com>...
> > ImageAnalyst <imageanalyst@mailinator.com> wrote in message <cf73e1b9-36c2-4eca-8e6a-36591aeb9b54@i31g2000yqm.googlegroups.com>...
> > > On Jun 20, 9:44 am, "Manal " <be....@live.com> wrote:
> > > > I posted my image here
> > > > hope you can help me
> > > >
> > > > final chance for me
> > > --------------------------------------------------------------
> > > Are you requiring that you get the guy's hands and face too? They're
> > > brighter than the immediate background but also the same intensity as
> > > other background pixels?
> > > But I won't be able to do anything. Starting this morning, I'm going
> > > to be pretty tied up until Wednesday.
> > > -ImageAnalyst
> >
> > if I got the most far points in the hands and the head it will fine
> > just to determine its position
> > thanks a lot for your help
> > I'll be waiting for you
> > you are my final chance
> > I've tried all the suggestions and it does not work
>
> well... let's just hope you do a bit more than just ...waiting for godot... who - as we all know - never made it to save the world...
>
> us

I am not just waiting
I am searching for another way to plot the detected border
or even change the whole border detecting algorithm
hoping to solve this problem from beginning step

thanks

Subject: complicated situation :'(

From: Bruno Luong

Date: 20 Jun, 2010 17:09:05

Message: 26 of 29

"Manal " <be.san@live.com> wrote in message <hvlf3l$4i5$1@fred.mathworks.com>...
> "us " <us@neurol.unizh.ch> wrote in message <hvld9h$de6$1@fred.mathworks.com>...

>
> I am not just waiting
> I am searching for another way to plot the detected border
> or even change the whole border detecting algorithm
> hoping to solve this problem from beginning step

I wonder why you don't use CONTOUR with appropriate threshold on the image instead of detect a bunch of unrelated points then reconstruct the boundary by connecting them. Throwing the information away and trying to recover from it is always a bad strategy.

Bruno

Subject: complicated situation :'(

From: Manal

Date: 20 Jun, 2010 17:23:05

Message: 27 of 29

"Bruno Luong" <b.luong@fogale.findmycountry> wrote in message <hvlhvh$ssh$1@fred.mathworks.com>...
> "Manal " <be.san@live.com> wrote in message <hvlf3l$4i5$1@fred.mathworks.com>...
> > "us " <us@neurol.unizh.ch> wrote in message <hvld9h$de6$1@fred.mathworks.com>...
>
> >
> > I am not just waiting
> > I am searching for another way to plot the detected border
> > or even change the whole border detecting algorithm
> > hoping to solve this problem from beginning step
>
> I wonder why you don't use CONTOUR with appropriate threshold on the image instead of detect a bunch of unrelated points then reconstruct the boundary by connecting them. Throwing the information away and trying to recover from it is always a bad strategy.
>
> Bruno

I did not find any other helpful contour algorithm
what did you mean by CONTOUR??
is it a predefined function??

sorry, this is my first project in both matlab and image processing

Subject: complicated situation :'(

From: Bruno Luong

Date: 20 Jun, 2010 17:36:06

Message: 28 of 29

"Manal " <be.san@live.com> wrote in message <hvlipp$jha$1@fred.mathworks.com>...
>
>
> I did not find any other helpful contour algorithm
> what did you mean by CONTOUR??
> is it a predefined function??

When I type
>> lookfor contour

It returns no less than 15 entries. Are you sure you did look for that?

Bruno

Subject: complicated situation :'(

From: Manal

Date: 20 Jun, 2010 18:32:05

Message: 29 of 29

"Bruno Luong" <b.luong@fogale.findmycountry> wrote in message <hvlji6$6l2$1@fred.mathworks.com>...
> "Manal " <be.san@live.com> wrote in message <hvlipp$jha$1@fred.mathworks.com>...
> >
> >
> > I did not find any other helpful contour algorithm
> > what did you mean by CONTOUR??
> > is it a predefined function??
>
> When I type
> >> lookfor contour
>
> It returns no less than 15 entries. Are you sure you did look for that?
>
> Bruno

Thanks for your suggestion
I try this function
I really did know about it

thanks

Tags for this Thread

What are tags?

A tag is like a keyword or category label associated with each thread. Tags make it easier for you to find threads of interest.

Anyone can tag a thread. Tags are public and visible to everyone.

Contact us