 | 1 | initial version |
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?
| | 2 | No.2 Revision |
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?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?
| | 3 | No.3 Revision |
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?
