algorithmimage-processingmathematical-morphology# Algorithm for ring or hollow artifact detection in binary images

Does anyone know of an algorithm that can detect rings or hollow objects, and their respective pixel sets for binary images?

I'd rather it be automatic due to the sheer number and minute size the of hollow artefacts (*fingerprints processed with boundary extraction*).

I'm currently working out a pixel connection algorithm that should give results, however it is by no means efficient in terms of performance.

Solution

Have you tried using something like OpenCV's cvFindContours?

Here is an example that uses it to locate ellipses/circles. I don't think it would be very difficult to extend it to look for rings -- you would just have to match up two contours of different sizes with approximately the same center.

If you're after a framework-agnostic approach, then have a read of the paper that cvFindContours is based on:

"Topological structural analysis of digitized binary images by border following" Satoshi Suzuki and Keiichi Abe. [suzuki85]

- Difference between back tracking and dynamic programming
- How can we optimize this algorithm from O(N ** 2) to better complexity in order to pass performance test?
- How do I predict the required size of a Base32 Decode output?
- Reversing AND Bitwise
- Why does my binary search need an extra comparison? log2(N)+1
- How to build a trie for finding exact phonetic matches, sorted globally by weight, and paginated? (Building off this example)
- What is the Time Complexity and Space Complexity of extending a string according to a rule?
- Skyscraper puzzle algorithm
- Check if all elements in a list are equal
- Bitwise Interval Arithmetic
- fast algorithm for drawing filled circles?
- How to find distance from the latitude and longitude of two locations?
- Determine if two rectangles overlap each other?
- Randomly Splitting a Graph according to Conditions
- Maximize distance while pushing crates
- Free a binary tree without recursion
- How can I estimate number of nodes in given tree structure?
- Explanation of class Definition for Binary Trees in leetcode
- Procedural Generation of 2D Rooms
- Is there an algorithm to find the closest element to X in an unsorted array in Ω(logN)?
- Advanced Java idiom for 2+ classes implementing a generic interface
- Is there any algorithm in c# to singularize - pluralize a word?
- Number of Common sub sequences of two strings
- Trying to solve problem 19 on Euler Project
- is a "non-decreasing" sequence "increasing"?
- Is it possible to get the original value of a number, after several multiplications **with overflow**?
- Algorithm to determine the highest and lowest possible finishing position of a team in a league
- Algorithm to calculate the number of divisors of a given number
- Rolling or sliding window iterator?
- best way to pick a random subset from a collection?