| Who | When |
Messages | |
|
|
|
| Tom Duerig
|
6
|
 |
|
09-26-2006 03:36 PM ET (US)
|
|
How many degrees of freedom in thier model for deformation? Dunno if they said, but I must have missed it if they did. I'm guessing it has to be a low number if they're running a ransac or ransac based algorithm for the matching.
|
| Deborah
|
7
|
 |
|
09-26-2006 03:37 PM ET (US)
|
|
Just to clarify, keypoints are single pixels, right? (not clusters of pixels?) If so, I am curious how robust the authors' method is when varying the resolution of the images.
|
| Deborah
|
8
|
 |
|
09-26-2006 03:52 PM ET (US)
|
|
hmm... I see.. The keypoint is one pixel, and for each keypoint, they choose a neighborhood of pixels around it. All these neighborhoods of keypoints from all the images help generate the view set. I wonder how they control for the size of neighborhood? Perhaps that does depends on the image resolution. (Perhaps [19] talks more about this.)
|
| Carolina
|
9
|
 |
|
09-26-2006 03:58 PM ET (US)
|
|
I think it is very interesting to see the keypoint matching problem formulated as a classification problem, in order to reduce the run time complexity. The synthesize view sets is a good idea to fight distortions and blur, but I guess they depend on the object to detect, since some objects may fire just few keypoints (or way to many). Adding white noise should help for recognize keypoints in cluttered backgrounds? This is still not very clear to me. Using randomized trees it would indeed make fast matching, since we store a bunch of patch examples, but it is concerning that we have to deal with the issue of storing them on memory (It is still a lot just for one object). Building more than one tree seems to be a good approach for searching, but it is still not optimal (same size still). The comparison made with SIFT keypoints may not be fair, since the software used could be the demo and not the licenced (or real) SIFT version. Moreover, other descriptors should have been good to include in the comparison. This approach should work very efficiently for tracking objects, since the tree implementation uses simple and efficient tests.
|
| Felicia_do
|
10
|
 |
|
06-14-2007 06:58 AM ET (US)
|
|
|
| Anastasia_pt
|
11
|
 |
|
06-14-2007 06:58 AM ET (US)
|
|
|
| Edward_mo
|
12
|
 |
|
06-17-2007 05:27 PM ET (US)
|
|
|
| Frank_wc
|
13
|
 |
|
06-17-2007 05:27 PM ET (US)
|
|
|
| Ryan_bm
|
14
|
 |
|
06-17-2007 05:27 PM ET (US)
|
|
|
| AAS@yahoo.com
|
15
|
 |
|
06-22-2007 10:04 AM ET (US)
|
|
9j3jLV Hey, there is what you need.
|
| Vilyammf
|
16
|
 |
|
08-08-2007 06:50 PM ET (US)
|
|
Hello! great idea of color of this siyte!
|
| Alexzzp
|
17
|
 |
|
10-03-2007 07:02 AM ET (US)
|
|
If you want do delete your site from our spam bases - just email us with domain of your site:
abuse-here@inbox.ru
thank you!
|
| John Doe
|
18
|
 |
|
11-07-2007 07:52 AM ET (US)
|
|
97749c0399788455b22cf5837aabe4d4
|
| Brin
|
19
|
 |
|
12-02-2007 03:30 PM ET (US)
|
|
Hello, nice site :)
|
| |
Messages 20-21 deleted by topic administrator between 03-27-2008 02:20 AM and 10-07-2008 02:32 AM |