# How to get around Overlapping Problem?

Is there some algorithm that bypass the overlapping problem? I know that watershed algo can make it, however if the object is totally or almost totally overlapped it is inneficient. Doing some search I found this and the page 2 of this doc, explains what i am saying.

Basically, the camera uses mirrors and have two different views of the object. Is there an algorithm that makes it? Or another way to get around overlapping? When objects are falling, they overlap each other. And with watershed algorithm, the error is high. Is there an algorithm that uses 2 views and uses it to compensate overlapping objects. Like the one on the document on the link?

sorry, but it's entirely unclear, what you have or what you need. "overlapping problem" ? "mirrors" ?

When objects are falling, they overlap each other. And with watershed algorithm, the error is high. Is there an algorithm that uses 2 views and uses it to compensate overlapping objects. Like the one on the document on the link?

Its still quite unclear to me how overlapping and watershed are related xD but hey that might be me.

It is not just watershed, but watershed algo with distance transform, like the example of the cards: http://docs.opencv.org/3.1.0/d2/dbd/t...

I agree, but still then I am not really sure how you will be able to solve the overlap problem...

Yes, me neither =[ So i did some research and found that someone used mirrors to get around this problem. However, it seems to not be the best way to solve the problem