Discover georgeglidden/edge-repair Open Source project

Stars
3
Rank 3,963,521 (Top 79 %)
Language
Python
Created over 5 years ago
Updated almost 4 years ago

georgeglidden

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

modified the approach outlined in "A Fast and Robust Ellipse Detection-Method ..." (https://www.researchgate.net/publication/261999152_A_Fast_and_Robust_Ellipse-Detection_Method_Based_on_Sorted_Merging) to use line segments and calculated curvature to repair errors in edge maps caused by noise or occlusion.

rutabaga

a repository for scripts and tools created while investigating the roots of q polynomials and other related mathematical objects

Jupyter Notebook

radish

a rudimentary database application for fractal datasets

Julia

edge-segmentation

a canny bitmap is used to extract contiguous regions as defined by being entirely enclosed by edge pixels. a time complexity of O((a + b)n) is achieved by using node forests and pixel tags to create an equivalent structure to the final result while the image is being iterated. the equivalent structure is then reduced by collapsing node trees from the forest and extracted regions are output as python lists of pixel coordinates. O((a + b)n) where a is the complexity of the edge map, b is the average height of a node tree in the forest, and n is the total number of pixels in the image (width * height).

Python

georgeglidden/edge-repair

georgeglidden

Reviews

Repository Details

More Repositories