2

I'm trying to fit two ellipses to what happens to be the top view / outline of a body. For simplicity let's use the following example:

enter image description here

As you can see, this simple body is made up of a long core (blue) and a head (red). In reality this outline would be in one color, I'm just using two colors for visualization purposes here.

I know how to fit a single ellipse to either parts of that outline, but I do not know how to do the fit to two ellipses, given the constraint that these two ellipses are actually connected. In this particular case the constraint is that the two ellipses will never part and that there can only be a certain angle between ellipse 1 and ellipse 2.

I'm grateful for any pointers that tell me how to write a function, so that after calling magic_fitting_function(body_outline) the program returns to me the coordinates of the two underlying ellipses:

enter image description here

EDIT1: what is are the minimal requirements that could make solving this problem easier? E.g. if I were given one point, two points, etc, how would that possibly simplify the problem?

EDIT2: I'm looking for a programming language independent solution.

EDIT3: any hints on how to formulate the constraint of these two ellipses being located in a certain relationship to each other programmatically? E.g.: I know that the small ellipse will always be located at one end of the major axis of the big ellipse. Plus the small ellipse can only rotate by +- 90 degrees relative to the big ellipse.

memyself
  • 11,907
  • 14
  • 61
  • 102

4 Answers4

1

I have never solved this problem, so I'm just throwing out a suggestion.

First, generate a bounding ellipse for the entire figure in order to determine what are the topmost and the bottommost points. (This step may not be necessary if you have a better way of finding these points.)

Next, detect the location of the "neck" by using a modified binary search. (Here I'm assuming that your bounding ellipse has a vertical orientation, as though the figure were standing up or standing on its head.) Generate two sets of bounding ellipses: one with an ellipse from the top of the figure to the 1/4 point of the figure (meaning if you draw a line through the bounding ellipse then the 1/4 point is between the top-left point and the middle) and with an ellipse from the 1/4 point to the bottom of the figure, and one with an ellipse from the top of the figure to the 3/4 point and with an ellipse from the 3/4 point to the bottom of the figure; the set of ellipses with the smaller total area is the one that is better encapsulating the head. Continue the search (e.g. next test an ellipse from the top to the 1/8 point / 7/8 point, and/or from the top to the 3/8 point / 5/8 point) until you've minimized the total bounding area of the set of ellipses; the point at which the ellipses meet is the neck. (No need to be too precise with this, it probably doesn't make much difference if you put the neck at the 34/256ths point or at the 35/256ths point.)

To detect the neck you may want to use bounding boxes instead of bounding ellipses.

Finally, adjust the two bounding ellipses in order to meet their angle constraints, e.g. by moving their extreme points in 5% increments (so assuming that the head ellipse's extreme points are on the y-coordinates 0 and 50 and the body ellipse's extreme points are on the y-coordinates 50 and 200, adjust them so that their extreme y-coordinates are on 0 and 60 and on 40 and 200).

Zim-Zam O'Pootertoot
  • 17,888
  • 4
  • 41
  • 69
1

If you have the complete outline, you can find where the two ellipses intersect - just look for the two sharp corners where the first derivative of your outline becomes discontinuous. Then, draw a straight line between those corners.

Everything on one side of the line is in ellipse A, everything on the other side is in ellipse B. The sharp corners are in both ellipses. Now, just fit a single ellipse to each of the two ellipses you've found and recalculate the points where the fitted ellipses intersect.

user1245262
  • 6,968
  • 8
  • 50
  • 77
1
  1. Find the two points that are furthest from each other. One will belong to Ellipse1, the other to Ellipse2.
  2. Check the nearest neighbors of these points to get 5 points belonging to Ellipse1, and 5 to Ellipse2.
  3. Check out Wikipedia, and choose your favorite equation of an ellipse.
  4. Using junior high algebra, for each ellipse, plug in the points to get 5 simultaneous equations, and solve these to get the 5 parameters that define your ellipse.

EDIT

I didn't realize this was tagged "matlab". In that case, once you have identified some points for each ellipse, there are matlab functions for fitting the points to an ellipse.

Community
  • 1
  • 1
mbeckish
  • 10,485
  • 5
  • 30
  • 55
  • this method is not robust because it assumes perfect ellipses with no noise, otherwise one would want to use as many point as possible to get the ellipses figured. – bla Jun 28 '13 at 17:20
  • @natan - Yes, if exact equation solving doesn't work out, then use a [best-fit algorithm](http://skotagiri.wordpress.com/2010/06/19/c-implementation-for-fitting-an-ellipse-for-a-set-of-points/) instead. – mbeckish Jun 28 '13 at 17:24
  • @mbeckish so 2x 5 points around the extreme points is all I need? wouldn't it make sense to also use the constraint that these two ellipses are located in a certain position to each other? – memyself Jun 29 '13 at 09:32
  • @memyself - Check it out and see if you can reliably identify points that belong to either ellipse. If you are able to fit your points exactly to the equation of an ellipse, then 5 points per ellipse is all you need. If not, and you need to do a "best-fit" algorithm, then the more points you use, the closer the ellipse will come to intersecting all of the points. – mbeckish Jul 01 '13 at 19:55
1

You can try isolating ellipses using the Hough transform. There are some FEX tools out there that are worth trying, for example this Ellipse Detection Using 1D Hough Transform.

bla
  • 25,846
  • 10
  • 70
  • 101