Faster way of writing this code: (finding index)

조회 수: 4 (최근 30일)
Evan 2012년 12월 22일
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
Roger Stafford
Roger Stafford 2012년 12월 22일
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 2012년 12월 22일
편집: Image Analyst 2012년 12월 22일
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?

댓글을 달려면 로그인하십시오.

답변 (2개)

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

댓글을 달려면 로그인하십시오.

Matt J
Matt J 2012년 12월 23일


Help CenterFile Exchange에서 Operating on Diagonal Matrices에 대해 자세히 알아보기

Community Treasure Hunt

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

Start Hunting!

Translated by