Timeline for otsu_threshold Template Function Implementation for Image in C++
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7 at 19:48 | vote | accept | JimmyHu | ||
| Mar 7 at 15:25 | comment | added | Cris Luengo | Sorry, Wikipedia is not very clear, the MATLAB code is hard to read and the Python code is just dumb (doesn’t even use a histogram?). Other tutorials online seem to be just as bad, showing how to implement a O(n^2) algorithm. I didn’t know the state of the internet these days was so bad! You can take a look at my implementation here: github.com/DIPlib/diplib/blob/… | |
| Mar 7 at 15:05 | comment | added | Cris Luengo | You implement a O(n^2) algorithm, Otsu can famously be computed in O(n). Take a look for example at the Wikipedia page for “Otsu’s method”. | |
| Mar 6 at 12:50 | history | became hot network question | |||
| Mar 6 at 9:40 | answer | added | G. Sliepen | timeline score: 4 | |
| Mar 6 at 8:13 | history | edited | JimmyHu | CC BY-SA 4.0 |
Update code
|
| Mar 6 at 6:50 | history | edited | JimmyHu | CC BY-SA 4.0 |
Update code
|
| Mar 6 at 5:41 | history | edited | JimmyHu | CC BY-SA 4.0 |
Add output image
|
| Mar 6 at 5:20 | history | edited | JimmyHu | CC BY-SA 4.0 |
Update code
|
| Mar 6 at 4:41 | history | asked | JimmyHu | CC BY-SA 4.0 |