Finding the best trade-off point on a curve

by

A quick way of finding the elbow is to draw a line from the first to the last point of the curve and then find the data point that is farthest away from that line.

This is of course somewhat dependent on the number of points you have in the flat part of the line, but if you test the same number of parameters each time, it should come out reasonably ok.

curve = [8.4663 8.3457 5.4507 5.3275 4.8305 4.7895 4.6889 4.6833 4.6819 4.6542 4.6501 4.6287 4.6162 4.585 4.5535 4.5134 4.474 4.4089 4.3797 4.3494 4.3268 4.3218 4.3206 4.3206 4.3203 4.2975 4.2864 4.2821 4.2544 4.2288 4.2281 4.2265 4.2226 4.2206 4.2146 4.2144 4.2114 4.1923 4.19 4.1894 4.1785 4.178 4.1694 4.1694 4.1694 4.1556 4.1498 4.1498 4.1357 4.1222 4.1222 4.1217 4.1192 4.1178 4.1139 4.1135 4.1125 4.1035 4.1025 4.1023 4.0971 4.0969 4.0915 4.0915 4.0914 4.0836 4.0804 4.0803 4.0722 4.065 4.065 4.0649 4.0644 4.0637 4.0616 4.0616 4.061 4.0572 4.0563 4.056 4.0545 4.0545 4.0522 4.0519 4.0514 4.0484 4.0467 4.0463 4.0422 4.0392 4.0388 4.0385 4.0385 4.0383 4.038 4.0379 4.0375 4.0364 4.0353 4.0344];

%# get coordinates of all the points
nPoints = length(curve);
allCoord = [1:nPoints;curve]';              %'# SO formatting

%# pull out first point
firstPoint = allCoord(1,:);

%# get vector between first and last point - this is the line
lineVec = allCoord(end,:) - firstPoint;

%# normalize the line vector
lineVecN = lineVec / sqrt(sum(lineVec.^2));

%# find the distance from each point to the line:
%# vector between all points and first point
vecFromFirst = bsxfun(@minus, allCoord, firstPoint);

%# To calculate the distance to the line, we split vecFromFirst into two 
%# components, one that is parallel to the line and one that is perpendicular 
%# Then, we take the norm of the part that is perpendicular to the line and 
%# get the distance.
%# We find the vector parallel to the line by projecting vecFromFirst onto 
%# the line. The perpendicular vector is vecFromFirst - vecFromFirstParallel
%# We project vecFromFirst by taking the scalar product of the vector with 
%# the unit vector that points in the direction of the line (this gives us 
%# the length of the projection of vecFromFirst onto the line). If we 
%# multiply the scalar product by the unit vector, we have vecFromFirstParallel
scalarProduct = dot(vecFromFirst, repmat(lineVecN,nPoints,1), 2);
vecFromFirstParallel = scalarProduct * lineVecN;
vecToLine = vecFromFirst - vecFromFirstParallel;

%# distance to line is the norm of vecToLine
distToLine = sqrt(sum(vecToLine.^2,2));

%# plot the distance to the line
figure('Name','distance from curve to line'), plot(distToLine)

%# now all you need is to find the maximum
[maxDist,idxOfBestPoint] = max(distToLine);

%# plot
figure, plot(curve)
hold on
plot(allCoord(idxOfBestPoint,1), allCoord(idxOfBestPoint,2), 'or')

More Related Contents:

  1. Faster version of find for sorted vectors (MATLAB)
  2. Random points inside a parallelogram
  3. Custom Weighted Scale [closed]
  4. Expand a random range from 1–5 to 1–7
  5. Quicksort: Choosing the pivot
  6. Breadth First Vs Depth First
  7. Why doesn’t Dijkstra’s algorithm work for negative weight edges?
  8. What is the fastest algorithm to calculate the minimum distance between two sets of points?
  9. What is pseudopolynomial time? How does it differ from polynomial time?
  10. Is there an efficient algorithm to generate a 2D concave hull?
  11. True random number generator [closed]
  12. Programming theory: Solve a maze
  13. Algorithm for finding numerical permutation given lexicographic index
  14. Algorithm to find two repeated numbers in an array, without sorting
  15. How to implement depth first search for graph with a non-recursive approach
  16. Why is the time complexity of both DFS and BFS O( V + E )
  17. How to split a string into words. Ex: “stringintowords” -> “String Into Words”?
  18. Create non-intersecting polygon passing through all given points
  19. Enumerating all paths in a directed acyclic graph
  20. generate all partitions of a set [closed]
  21. Efficiently selecting a set of random elements from a linked list
  22. Find if a point is inside a convex hull for a set of points without computing the hull itself
  23. Myers diff algorithm vs Hunt–McIlroy algorithm
  24. Given Prime Number N, Compute the Next Prime?
  25. What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point?
  26. Why use binary search if there’s ternary search?
  27. Bridges in a connected graph
  28. Breadth First Search and Depth First Search
  29. Algorithm for reflecting a point across a line
  30. Portable efficient alternative to PDEP without using BMI2?

Leave a Comment