rlm@371
|
1 When I write my thesis, I want it to have links to every
|
rlm@371
|
2
|
rlm@371
|
3
|
rlm@371
|
4
|
rlm@369
|
5 * Object Recognition from Local Scale-Invariant Features, David G. Lowe
|
rlm@369
|
6
|
rlm@369
|
7 This is the famous SIFT paper that is mentioned everywhere.
|
rlm@369
|
8
|
rlm@369
|
9 This is a way to find objects in images given an image of that
|
rlm@369
|
10 object. It is moderately risistant to variations in the sample image
|
rlm@369
|
11 and the target image. Basically, this is a fancy way of picking out
|
rlm@369
|
12 a test pattern embedded in a larger pattern. It would fail to learn
|
rlm@369
|
13 anything resembling object categories, for instance. Usefull concept
|
rlm@369
|
14 is the idea of storing the local scale and rotation of each feature
|
rlm@369
|
15 as it is extracted from the image, then checking to make sure that
|
rlm@369
|
16 proposed matches all more-or-less agree on shift, rotation, scale,
|
rlm@369
|
17 etc. Another good idea is to use points instead of edges, since
|
rlm@369
|
18 they seem more robust.
|
rlm@369
|
19
|
rlm@369
|
20 ** References:
|
rlm@369
|
21 - Basri, Ronen, and David. W. Jacobs, “Recognition using region
|
rlm@369
|
22 correspondences,” International Journal of Computer Vision, 25, 2
|
rlm@369
|
23 (1996), pp. 141–162.
|
rlm@369
|
24
|
rlm@369
|
25 - Edelman, Shimon, Nathan Intrator, and Tomaso Poggio, “Complex
|
rlm@369
|
26 cells and object recognition,” Unpublished Manuscript, preprint at
|
rlm@369
|
27 http://www.ai.mit.edu/edelman/mirror/nips97.ps.Z
|
rlm@369
|
28
|
rlm@369
|
29 - Lindeberg, Tony, “Detecting salient blob-like image structures
|
rlm@369
|
30 and their scales with a scale-space primal sketch: a method for
|
rlm@369
|
31 focus-of-attention,” International Journal of Computer Vision, 11, 3
|
rlm@369
|
32 (1993), pp. 283–318.
|
rlm@369
|
33
|
rlm@369
|
34 - Murase, Hiroshi, and Shree K. Nayar, “Visual learning and
|
rlm@369
|
35 recognition of 3-D objects from appearance,” International Journal
|
rlm@369
|
36 of Computer Vision, 14, 1 (1995), pp. 5–24.
|
rlm@369
|
37
|
rlm@369
|
38 - Ohba, Kohtaro, and Katsushi Ikeuchi, “Detectability, uniqueness,
|
rlm@369
|
39 and reliability of eigen windows for stable verification of
|
rlm@369
|
40 partially occluded objects,” IEEE Trans. on Pattern Analysis and
|
rlm@369
|
41 Machine Intelligence, 19, 9 (1997), pp. 1043–48.
|
rlm@369
|
42
|
rlm@369
|
43 - Zhang, Z., R. Deriche, O. Faugeras, Q.T. Luong, “A robust
|
rlm@369
|
44 technique for matching two uncalibrated images through the recovery
|
rlm@369
|
45 of the unknown epipolar geometry,” Artificial In- telligence, 78,
|
rlm@369
|
46 (1995), pp. 87-119.
|
rlm@369
|
47
|
rlm@369
|
48
|
rlm@369
|
49
|
rlm@369
|
50
|
rlm@369
|
51
|
rlm@371
|
52 * Alignment by Maximization of Mutual Information, Paul A. Viola
|
rlm@371
|
53
|
rlm@371
|
54 PhD Thesis recommended by Winston. Describes a system that is able
|
rlm@371
|
55 to align a 3D computer model of an object with an image of that
|
rlm@371
|
56 object.
|
rlm@371
|
57
|
rlm@371
|
58 - Pages 9-19 is a very adequate intro to the algorithm.
|
rlm@371
|
59
|
rlm@371
|
60 - Has a useful section on entropy and probability at the beginning
|
rlm@371
|
61 which is worth reading, especially the part about entropy.
|
rlm@371
|
62
|
rlm@371
|
63 - Differential entropy seems a bit odd -- you would think that it
|
rlm@371
|
64 should be the same as normal entropy for a discrete distrubition
|
rlm@371
|
65 embedded in continuous space. How do you measure the entropy of a
|
rlm@371
|
66 half continuous, half discrete random variable?
|
rlm@371
|
67
|
rlm@371
|
68 - Expectation Maximation (Mixture of Gaussians cool stuff)
|
rlm@371
|
69 (Dempster 1977)
|
rlm@371
|
70
|
rlm@371
|
71 - Good introduction to Parzen Window Density Estimation. Parzen
|
rlm@371
|
72 density functions trade construction time for evaulation
|
rlm@371
|
73 time.(Pg. 41)
|
rlm@371
|
74
|
rlm@371
|
75 Occlusion? Seems a bit holistic.
|
rlm@371
|
76
|
rlm@371
|
77
|
rlm@371
|
78 ** References
|
rlm@371
|
79 - "excellent" book on entropy (Cover & Thomas, 1991)
|
rlm@371
|
80 |