Thread Subject:

Finding the N maximum values in a matrix

Hi

Is there any way to find n maximum/minimum values in a matrix without going through the for loop.

let's say we are looking for finding n=4 maximum number from following matrix
A = [7 1 19;
      16 13 1;
      14 8 10]

I am looking for finding the triplets of [r,c,v] as following:
[1,3,19] -> 1st maximum value
[2,1,16] -> 2nd maximum value
[3,1,14] -> 3rd maximum value
[3,3,10] -> 4th maximum value

in [r,c,v] triplet, [r,c] indicate the row and column position of the n-th maximum value and v is it's value.


due to the very huge size of matrix A (like 10000*10000) and large n (like 100) I really want to avoid going through loops in matlab.


Thanks a lot in advance

-Mohammad

"Mohammad Nasr" <mohammad.nasr@gmail.com> wrote in message <h5brc0$7qs$1@fred.mathworks.com>...
> Hi
>
> Is there any way to find n maximum/minimum values in a matrix without going through the for loop.
>
> let's say we are looking for finding n=4 maximum number from following matrix
> A = [7 1 19;
> 16 13 1;
> 14 8 10]
>
> I am looking for finding the triplets of [r,c,v] as following:
> [1,3,19] -> 1st maximum value
> [2,1,16] -> 2nd maximum value
> [3,1,14] -> 3rd maximum value
> [3,3,10] -> 4th maximum value
>
> in [r,c,v] triplet, [r,c] indicate the row and column position of the n-th maximum value and v is it's value.
>
>
> due to the very huge size of matrix A (like 10000*10000) and large n (like 100) I really want to avoid going through loops in matlab.
>
>
> Thanks a lot in advance
>
> -Mohammad

one of the many solutions

% the data
     n=4;
     m=[
          7,1,19
          16,13,1
          14,8,10
     ];
% the engine
     [ms,mx]=sort(m(:),'descend');
     [rx,cx]=ind2sub(size(m),mx);
     r=[rx,cx,ms];
     r=r(1:n,:);
% the result
     disp(r);
%{
% row# col# val
          1 3 19
          2 1 16
          3 1 14
          2 2 13
%}

us

"Mohammad Nasr" <mohammad.nasr@gmail.com> wrote in message <h5brc0$7qs$1@fred.mathworks.com>...
> Hi
>
> Is there any way to find n maximum/minimum values in a matrix without going through the for loop.
>
> let's say we are looking for finding n=4 maximum number from following matrix
> A = [7 1 19;
> 16 13 1;
> 14 8 10]
>
> I am looking for finding the triplets of [r,c,v] as following:
> [1,3,19] -> 1st maximum value
> [2,1,16] -> 2nd maximum value
> [3,1,14] -> 3rd maximum value
> [3,3,10] -> 4th maximum value
>
> in [r,c,v] triplet, [r,c] indicate the row and column position of the n-th maximum value and v is it's value.
>
>
> due to the very huge size of matrix A (like 10000*10000) and large n (like 100) I really want to avoid going through loops in matlab.
>
>
> Thanks a lot in advance
>
> -Mohammad

This is what you are looking for.
http://www.mathworks.com/matlabcentral/fileexchange/23576

Bruno

"us " <us@neurol.unizh.ch> wrote in message <h5brsp$cfu$1@fred.mathworks.com>...
> "Mohammad Nasr" <mohammad.nasr@gmail.com> wrote in message <h5brc0$7qs$1@fred.mathworks.com>...
> > Hi
> >
> > Is there any way to find n maximum/minimum values in a matrix without going through the for loop.
> >
> > let's say we are looking for finding n=4 maximum number from following matrix
> > A = [7 1 19;
> > 16 13 1;
> > 14 8 10]
> >
> > I am looking for finding the triplets of [r,c,v] as following:
> > [1,3,19] -> 1st maximum value
> > [2,1,16] -> 2nd maximum value
> > [3,1,14] -> 3rd maximum value
> > [3,3,10] -> 4th maximum value
> >
> > in [r,c,v] triplet, [r,c] indicate the row and column position of the n-th maximum value and v is it's value.
> >
> >
> > due to the very huge size of matrix A (like 10000*10000) and large n (like 100) I really want to avoid going through loops in matlab.
> >
> >
> > Thanks a lot in advance
> >
> > -Mohammad
>
> one of the many solutions
>
> % the data
> n=4;
> m=[
> 7,1,19
> 16,13,1
> 14,8,10
> ];
> % the engine
> [ms,mx]=sort(m(:),'descend');
> [rx,cx]=ind2sub(size(m),mx);
> r=[rx,cx,ms];
> r=r(1:n,:);
> % the result
> disp(r);
> %{
> % row# col# val
> 1 3 19
> 2 1 16
> 3 1 14
> 2 2 13
> %}
>
> us

thanks but I guess sorting that huge matrix to find relatively very small number of values is not saving time complexity

"Bruno Luong" <b.luong@fogale.findmycountry> wrote in message <h5bu26$5r5$1@fred.mathworks.com>...
> "Mohammad Nasr" <mohammad.nasr@gmail.com> wrote in message <h5brc0$7qs$1@fred.mathworks.com>...
> > Hi
> >
> > Is there any way to find n maximum/minimum values in a matrix without going through the for loop.
> >
> > let's say we are looking for finding n=4 maximum number from following matrix
> > A = [7 1 19;
> > 16 13 1;
> > 14 8 10]
> >
> > I am looking for finding the triplets of [r,c,v] as following:
> > [1,3,19] -> 1st maximum value
> > [2,1,16] -> 2nd maximum value
> > [3,1,14] -> 3rd maximum value
> > [3,3,10] -> 4th maximum value
> >
> > in [r,c,v] triplet, [r,c] indicate the row and column position of the n-th maximum value and v is it's value.
> >
> >
> > due to the very huge size of matrix A (like 10000*10000) and large n (like 100) I really want to avoid going through loops in matlab.
> >
> >
> > Thanks a lot in advance
> >
> > -Mohammad
>
> This is what you are looking for.
> http://www.mathworks.com/matlabcentral/fileexchange/23576
>
> Bruno


thanks a lot Bruno
quick sort is not a bad idea.

"Mohammad Nasr" <mohammad.nasr@gmail.com> wrote in message <h5c35a$m3h$1@fred.mathworks.com>...

>
> thanks a lot Bruno
> quick sort is not a bad idea.

Sorry to be pedantic, but it's *Partial* quicksort, which is not the same thing. In any case it will do the job in an optimal way.

Bruno

Bruno Luong wrote:
> "Mohammad Nasr" <mohammad.nasr@gmail.com> wrote in message
> <h5c35a$m3h$1@fred.mathworks.com>...
>
>> thanks a lot Bruno quick sort is not a bad idea.
>
> Sorry to be pedantic, but it's *Partial* quicksort, which is not the
> same thing. In any case it will do the job in an optimal way.

What about the max() by row, then order that vector?

--

dpb <none@non.net> wrote in message <h5cfrp$u6o$1@news.eternal-september.org>...
> Bruno Luong wrote:
> > "Mohammad Nasr" <mohammad.nasr@gmail.com> wrote in message
> > <h5c35a$m3h$1@fred.mathworks.com>...
> >
> >> thanks a lot Bruno quick sort is not a bad idea.
> >
> > Sorry to be pedantic, but it's *Partial* quicksort, which is not the
> > same thing. In any case it will do the job in an optimal way.
>
> What about the max() by row, then order that vector?
>
> --

but - this would not work for, eg,

     m=[
          7,1,19
          16,13,1
          14,8,10
     ];
     r=max(m,[],2).'
% r = 19 16 14 % <- however, the OP wants 4 maxs - the 13 is missing...

us

us wrote:
> dpb <none@non.net> wrote in message <h5cfrp$u6o$1@news.eternal-september.org>...
...

>> What about the max() by row, then order that vector?
>>
>> --
>
> but - this would not work for, eg,
>
> m=[
> 7,1,19
> 16,13,1
> 14,8,10
> ];
> r=max(m,[],2).'
> % r = 19 16 14 % <- however, the OP wants 4 maxs - the 13 is missing...

Yeah, it falls down doesn't it...oh well, just a thought (I didn't say
it was a _good_ thought... :) )

--