I remember looking into pix_blobtracker but I don't remember why I didn't use it. In any case, I wrote a Pd abstraction last weekend which I called nearest-neighbor which I think might do the same thing: it looks for the shortest euclidean distances between blobs of the current frame with blobs of the last frame and reorders the blobs in the matrix accordingly. I made a test patch for tracking 8 blobs --- if pix_multiblob sees less than 8, the abstraction just copies the missing rows from the last frame --- a real kludge I know.
Definitely better ways to do this...and...this code is UGLY...but it is getting the job done for my application at least...
Attached is the abstraction with test patch (multiblob-test).
HTH,
-John
2011/2/18 Jack jack@rybn.org
Ah, good to know. I will give it a try. Thanx. ++
Jack
Le vendredi 18 février 2011 à 16:11 +0100, IOhannes zmölnig a écrit :
On 02/18/2011 02:07 PM, Jack wrote:
Do you know if there is an external to track multiblob with a constant ID (the ID doesn't change in the time when two or more blobs move). For example, with [pix_multiblob], the ID of the blob is given by its position relative to the lower left corner (or i'm wrong), so it is not good for my application.
there is an abstraction that comes with Gem called [pix_blobtracker] that try to label the blobs (based on a least error algorithm) it uses iemmatrix, but apart from that, no extra externals are involved.
gfmadr IOhannes
Pd-list@iem.at mailing list UNSUBSCRIBE and account-management ->
http://lists.puredata.info/listinfo/pd-list
Pd-list@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list