Reputation: 2075
I'm building a segmentation algorithm. I'm segmenting pieces of paper in a book that have been slightly crumpled. Imagine taking a piece of paper, crumpling it into a ball, and then trying to straighten it back out.
The piece of paper is an actually 3D object (has depth -- small but still existent), but I want to segment a 2D plane running through the geometric center of the 3D object. Is this a center of mass problem?
I have a 3D matrix of binary values -- 1 being on the piece of paper, and 0 not on the piece of paper.
What kind of algorithm can I run to find the 2D plane?
Upvotes: 1
Views: 117
Reputation:
You may want a 3D least-squares plane fit. This will minimize the separation between your plane and the voxel points. See here for math and code: http://www.ilikebigbits.com/blog/2015/3/2/plane-from-points
Upvotes: 4