Faster way of writing this code: (finding index)

7 views (last 30 days)
Evan
Evan on 22 Dec 2012
The code I want to optimize is:
index_min = sum( input > quantiles );
where quantiles is a vector of doubles in increasing order. I am using the sum function to find the index of quantiles that corresponds to the value of input. I think the "find" function is actually slower.
  2 Comments
Roger Stafford
Roger Stafford on 22 Dec 2012
Since the quantiles are in ascending order, it would likely be faster to use the 'histc' function with quantiles as the 'edges' vector and input as the first argument. The second returned argument (bin) would index the appropriate bin and thereby give you the index you seek.
Image Analyst
Image Analyst on 22 Dec 2012
Edited: Image Analyst on 22 Dec 2012
Just how much speed do you require? Is this for a real time app, like for video processing? How much slower? Are we talking nanoseconds here?

Sign in to comment.

Answers (2)

Matt Fig
Matt Fig on 22 Dec 2012
That code does not return an index, but it does return the number of values in vector quantiles that are smaller than input.
  2 Comments
Walter Roberson
Walter Roberson on 22 Dec 2012
Because the values are in order, this is equivalent to returning the index of the last such value.
Matt Fig
Matt Fig on 22 Dec 2012
Yes, it will return the last value. How large is quantiles?

Sign in to comment.


Matt J
Matt J on 23 Dec 2012

Categories

Find more on Operating on Diagonal Matrices in Help Center and File Exchange

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!