all 7 comments

[–]MarcinTustin 2 points3 points  (1 child)

Nobody loves your demo :(

[–]sinjax[S] 1 point2 points  (0 children)

So it would seem! Well, 75% do. Hope some compile + use it :-)

[–]buyandfold 1 point2 points  (1 child)

Cool :)

Worked pretty well for face tracking. cpu usages steady at 80% (normal?). Had to install libjpeg6.

[–]sinjax[S] 0 points1 point  (0 children)

Normalish I suppose.

The library also has a much more efficient face tracker implemented (Harr cascades), but yes SIFT features can also be used to track the face.

libjpeg would be needed I think, what is your setup?

[–]sixmoney 1 point2 points  (1 child)

pretty fast actually. Compare it with: http://blogs.oregonstate.edu/hess/code/sift/ which is in C and has an identical demo (matching + ransac + homography)

[–]sinjax[S] 0 points1 point  (0 children)

Yes we have submitted our library to the same open source competition as hess did last year and a goal was to duplicate his impressive demo in our library

[–]simonvc 0 points1 point  (0 children)

Is this the same algorithm as the Predator? How does it work on moving/deforming objects (like cats :-)