Can I sort Find function base on rows?
Ältere Kommentare anzeigen
Hello
I use find function to find location of a vector on my Image, It works, but I have location Order by column.I mean at firs I have location of pixels on column1 then column2,..... Can I change find function to have location of pixels on row1,row2,.....?
I'll appreciate your help.
3 Kommentare
Roger Stafford
am 4 Mär. 2014
I don't understand your question, Bkshn. Matlab's 'find' function finds the locations of individual nonzero elements within arrays. It doesn't find "location of a vector on my Image". Could you please explain what you mean by "location of pixels on column1" and "location of pixels on row1,row2,.....?" Please give some very simple examples.
Image Analyst
am 4 Mär. 2014
Bearbeitet: Image Analyst
am 4 Mär. 2014
I agree - totally confusing. Posting the image would probably help, as well as reading this. And say what you want to do once you have this. Because I suspect you don't even need it. I think you might be able to do what you want to do just with a binary image - no need to get (x,y) coordinates of every single non-zero pixel. I mean, why? Why do you think you need that? There are some situations (e.g. edge linking) but I'd like to know your reason.
bkshn
am 5 Mär. 2014
Bearbeitet: Walter Roberson
am 15 Mär. 2014
Antworten (2)
Julian
am 3 Aug. 2023
1 Stimme
I couldn't find a nice solution in the documentation, so I assume the best way is instead of:
A = [1 0;
0 1;
1 0];
[row, col] = find(A);
% Results:
% row = [1; 3; 2]
% col = [1; 1; 2]
Transpose the matrix A and exchange the row and column:
[col, row] = find(A.');
% Results:
% row = [1; 2; 3]
% col = [1; 2; 1]
Walter Roberson
am 4 Mär. 2014
[row, col] = find(.....);
cr = sortrows([col(:), row(:)];
r = cr(:,2);
c = cr(:,1);
now r(K), c(K) is a (row, column) pair and the pairs are ordered so that column varies more slowly. But it normally would anyhow. So perhaps what you want is
[row, col = find(.....);
rc = sortrows([row(:), col(:)]);
r = rc(:,1);
c = rc(:,2);
and that should be ordered with row varying more slowly, "going along rows", the opposite of what would normally happen.
6 Kommentare
Image Analyst
am 4 Mär. 2014
Which would be slower than the "normal" way of going down rows in a column before moving over to the next column. So why is this wanted? I'm still waiting to hear.
bkshn
am 5 Mär. 2014
bkshn
am 14 Mär. 2014
Walter Roberson
am 15 Mär. 2014
With regards to your March 5 response, it appears you missed the line
[row, col] = find(.....);
which give values to row and col.
With regards to your more recent question, you have not defined what you want to have happen when there are multiple entries with the same row but with different columns. When you define what you want to have happen in that case, the code can be adjusted.
bkshn
am 16 Mär. 2014
Walter Roberson
am 16 Mär. 2014
sort(A,2)
but you are now not working with vectors returned from find(), which are indices with row(K) corresponding to col(K) after the find and row(K), col(K) giving the location of what was found; you are now sorting by array content based upon the full array, which is a different task.
Kategorien
Mehr zu Matrix Indexing finden Sie in Hilfe-Center und File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
