Timeline for Efficient Marker Detection for Images
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 17, 2023 at 9:52 | comment | added | Tolga Birdal | Ah you updated, just saw. Thank you. | |
| Apr 17, 2023 at 9:51 | comment | added | Tolga Birdal | Are you sure? I just clicked all the links and they seem all okay. | |
| S Apr 14, 2023 at 17:42 | history | edited | lennon310 | CC BY-SA 4.0 | Better link description |
| S Apr 14, 2023 at 17:42 | history | suggested | Eric Johnson | CC BY-SA 4.0 | Better link description |
| Apr 14, 2023 at 13:38 | comment | added | Eric Johnson | @TolgaBirdal, The 2nd implementation link is dead. | |
| Apr 14, 2023 at 13:38 | review | Suggested edits | |||
| S Apr 14, 2023 at 17:42 | |||||
| Feb 24, 2019 at 11:45 | vote | accept | mnemosyn | ||
| Jun 15, 2017 at 20:13 | history | edited | Tolga Birdal | CC BY-SA 3.0 | added 491 characters in body |
| Jan 8, 2015 at 0:01 | comment | added | Tolga Birdal | Well, these are not search operators. They directly operate on image values and benefit from the specific mathematical characteristic. I would say O(kN), where k is some constant and N refers to # pixels. | |
| Jan 7, 2015 at 23:28 | comment | added | mnemosyn | Thanks for your answer, that looks promising, especially the paper. Since I'll have to implement everything in JS or shaders, I'll first need to understand how to implement it (manually, so to speak), and how complex that is (in terms of amount of coding work required). Is there any information on the theoretical runtime complexity for this approach with regard to the image size? The NCC is roughly O(N * M) where N is the number of pixels in haystack, and M is the number of pixels in needle, a number that grows pretty huge. I'll read up on nonlinear programming tomorrow... | |
| Jan 7, 2015 at 16:07 | history | answered | Tolga Birdal | CC BY-SA 3.0 |