![]() ![]() I'd be happy to share some code, but the hundred-liners don't exactly fit smoothly in here. 8-way edge tracing can be really hard to bend your head around (choosing between on-pixel or between-pixel edges and how to latch onto edges). Other reading materials include Gonzalez & Woods' Digital Image Processing (seems to be an older edition) for segmentation and edge tracing. Median Filtering Constant time (get the PDF) Note: I have an implementation of this in C# using Mono/SIMD to accelerate histogram coalescence, however it only seems better than the O( r) algorithm when the diameter exceeds ~60 pixels due to the comparable number of add/sub instructions (the break-even point), a C++ implementation is probably much better suited to harness SIMD.Fast Median and Bilateral Filtering (get the PDF).Once you get the idea of Huang's algorithm, implementing a box blur filter is a delicious piece of cake. ![]() Keep in mind that median and box blur filters can be implemented with linear time complexity w.r.t. These are fairly basic and all very easy to implement.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |