|
ABSTRACT
In this paper, a multiobjective (MO) learning approach to image feature extraction is described, where Pareto-optimal interest point (IP) detectors are synthesized using genetic programming (GP). IPs are image pixels that are unique, robust to changes during image acquisition, and convey highly descriptive information. Detecting such features is ubiquitous to many vision applications, e.g. object recognition, image indexing, stereo vision, and content based image retrieval. In this work, candidate IP operators are automatically synthesized by the GP process using simple image operations and arithmetic functions. Three experimental optimization criteria are considered: 1) the repeatability rate; 2) the amount of global separability between IPs; and 3) the information content captured by the set of detected IPs. The MO-GP search considers Pareto dominance relations between candidate operators, a perspective that has not been contemplated in previous research devoted to this problem. The experimental results suggest that IP detection is an illposed problem for which a single globally optimum solution does not exist. We conclude that the evolved operators outperform and dominate, in the Pareto sense, all previously man-made designs.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
P. R. Beaudet. Rotational invariant image operators. In Proceedings of the 4th International Joint Conference on Pattern Recognition (ICPR 1978),Tokyo, Japan, pages 579--583, 1978.
|
| |
3
|
|
| |
4
|
|
| |
5
|
W. Förstner and E. Gülch. A fast operator for detection and precise location of distinct points, corners and centres of circular features. In ISPRS Intercommission Conference on fast processing of photogrammetric data, pages 149--155, 1987.
|
| |
6
|
C. Harris and M. Stephens. A combined corner and edge detector. In Proceedings from the Fourth Alvey Vision Conference, volume 15, pages 147--151, 1988.
|
| |
7
|
|
| |
8
|
L. Kitchen and A. Rosenfeld. Gray-level corner detection. Pattern Recognition Letters, 1:95--102, December 1982.
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
K. Mikolajczyk , T. Tuytelaars , C. Schmid , A. Zisserman , J. Matas , F. Schaffalitzky , T. Kadir , L. Van Gool, A Comparison of Affine Region Detectors, International Journal of Computer Vision, v.65 n.1-2, p.43-72, November 2005
[doi> 10.1007/s11263-005-3848-x]
|
| |
16
|
H. P. Moravec. Towards automatic visual obstacle avoidance. In IJCAI, page 584, 1977.
|
| |
17
|
|
| |
18
|
V. Pareto. Cours D'Economie Politique. Rouge, Lausanne, 1896.
|
| |
19
|
B. Platel, E. Balmachnova, L. Florack, and B. M. ter Haar Romeny. Top-points as interest points for image matching. In A. Leonardis et al., editors, Proceedings from ECCV 2006, 9th European Conference on Computer Vision, Graz, Austria, May 7-13, 2006, Part I, volume 3951 of Lecture Notes in Computer Science, pages 418--429. Springer, 2006.
|
 |
20
|
|
| |
21
|
|
| |
22
|
|
| |
23
|
J. Shi and C. Tomasi. Good features to track. In Proceedings of the 1994 IEEE Conference on Computer Vision and Pattern Recognition (CVPR'94), June 1994, Seattle, WA, USA, pages 593--600. IEEE Computer Society, 1994.
|
| |
24
|
P. Tissainayagam and D. Suter. Assessing the performance of corner detectors for point feature tracking applications. Image Vision Comput., 22(8):663--679, 2004.
|
 |
25
|
|
| |
26
|
|
| |
27
|
|
| |
28
|
H. Wang and J. Brady. Corner detection for 3d vision using array processors. In Proceedings from BARNAIMAGE 91, Barcelona, Spain, Secaucus, NJ, USA, 1991. Springer-Verlag.
|
| |
29
|
Gehua Yang , Charles V. Stewart , Michal Sofka , Chia-Ling Tsai, Registration of Challenging Image Pairs: Initialization, Estimation, and Decision, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.29 n.11, p.1973-1989, November 2007
[doi> 10.1109/TPAMI.2007.1116]
|
| |
30
|
E. Zitzler, M. Laumanns, and L. Thiele. Spea2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In Evolutionary Methods for Design, Optimisation, and Control, pages 19--26, 2002.
|
|