Thanks for the links! The first one looks like it has a lot of good info. I guess I should clarify that I am not afraid of the math heavy papers (image process

Thanks for the links! The first one looks like it has a lot of good info. I guess I should clarify that I am not afraid of the math heavy papers (image processing is by nature math heavy) but what I meant by overly academic is proving something just to write a paper. For instance sometimes they write a paper on a solved problem to take the overall asymptotic running time down a bit but increase the constant factor and code complexity by a large amount. Think quickSelect vs Deterministic select. Quickselect only breaks down if every random pick of the pivot is the worst one whereas the deterministic select guarantees O(n) but with a constant in the 10's (I could be off on this number but it's high)