Stable bounded canonical sets and image matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3757 LNCS, Issue , 2005, Pages 316-331

  Novatnack, John ^a   Denton, Trip ^a   Shokoufandeh, Ali ^a   Bretzner, Lars ^b  

^a Drexel University   (United States)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE SETS; IMAGE MATCHING; STABLE BOUNDED CANONICAL SET (SBCS);

COMPUTATION THEORY; COMPUTATIONAL METHODS; IMAGE ANALYSIS; PATTERN MATCHING; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

SET THEORY;

EID: 33646581034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11585978_21     Document Type: Conference Paper

References (34)

1. Huttenlocher, D.P., Ullman, S.: Recognizing solid objects by alignment with an image. International Journal of Computer Vision 5:2 (1990) 195-212
2. Lindeberg, T.: Detecting Salient Blob-Like Image Structures and Their Scales With a Scale-Space Primal Sketch - A Method for Focus-of-Attention. IJCV 11 (1993) 283-318
3. Bretzner, L., Lindeberg, T.: Qualitative multi-scale feature hierarchies for object tracking. In: Journal of Visual Communication and Image Representation. Volume 11. (2000) 115-129
4. Goemans, M.X., Williamson, D.P.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. Assoc. Comput. Mach. 42 (1995) 1115-1145
5. Denton, T., Abrahamson, J., Shokoufandeh, A.: Approximation of canonical sets and their application to 2d view simplification. In: CVPR. (2004) Volume 2, p550-557
6. Denton, T., Demirci, M.F., Abrahamson, J., Shokoufandeh, A.: Selecting canonical views for view-based 3-d object recognition. In: ICPR. (2004) pp. 273-276
7. Cover, T., Thomas, J.: Elements of Information Theory: Rate Distortion Theory. John Wiley & Sons (1991)
8. Tishby, N., Pereira, F., Bialek, W.: The information bottleneck method. In: Proceedings of the 37-th Annual Allerton Conference on Communication, Control and Computing. (1999) 368-377
9. Hermes, L., Zoller, T., Buhmann, J.M.: Parametric distributional clustering for image segmentation. In: Proceedings, European Conference on Computer Vision. (2002) 577-591
10. Gordon, S., Greenspan, H., Goldberger, J.: Applying the information bottleneck principle to unsupervised clustering of discrete and continuous image representations. In: Proceedings, International Conference on Computer Vision, Nice, France (2003)
11. Liu, H., Motoda, H.: Feature transformation and subset selection. IEEE Intelligent Systems 13 (1998) 26-28
12. th Inter. Conf. Comp. Vision. (2001) 254-261
13. Goemans, M.X., Williamson, D.P.:.878-approximation algorithms for max cut and max 2sat. In: Twenty-sixth Annual ACM Symposium on Theory of Computing, New York (1994) 422-431
14. Goemans, M.X.: Semidefinite programming in combinatorial optimization. Mathematical Programming 79 (1997) 143-161
15. Mahajan, S., Ramesh, H.: Derandomizing approximation algorithms based on Semidefinite programming. SIAM Journal on Computing 28 (1999) 1641-1663
16. Huttenlocher, D., Ullman, S.: Object recognition using alignment. In: Proceedings, First International Conference on Computer Vision, London, UK (1987) 102-111
17. Huttenlocher, D., Ullman, S.: Recognizing solid objects by alignment with an image. International Journal of Computer Vision 5 (1990) 195-212
18. Irani, S., Raghavan, P.: Combinatorial and experimental results for randomized point matching algorithms. In: SCG '96: Proceedings of the twelfth annual symposium on Computational geometry, New York, NY, USA, ACM Press (1996) 68-77
19. Ratan, A.L., Grimson, W.E.L., W. M. Wells, I.: Object detection and localization by dynamic template warping. International Journal on Computer Vision 36 (2000) 131-147
20. Meer, P., Lenz, R., Ramakrishna, S.: Efficient invariant representations. Int. J. Comput. Vision 26 (1998) 137-152
21. Harris, C., Stephens, M.: A combined corner and edge detector. In: In 4th ALVEY vision conference. (1988) 147-151
22. Lowe, D.G.: Object recognition from local scale-invariant features. In: Proc. of the International Conference on Computer Vision ICCV, Corfu. (1999) 1150-1157
23. Blum, A.L., Langley, P.: Selection of relevant features and examples in machine learning. Artificial Intelligence 97 (1997) 245-271
24. Berchtold, S., Böhm, C., Kriegel, H.P.: The pyramid-tree: Breaking the curse of dimensionality. In Haas, L.M., Tiwary, A., eds.: SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA, ACM Press (1998) 142-153
25. Pagel, B.U., Korn, F., Faloutsos, C.: Deflating the dimensionality curse using multiple fractal dimensions. In: ICDE '00: Proceedings of the 16th International Conference on Data Engineering, Washington, DC, USA, IEEE Computer Society (2000) 589
26. Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979) (ND2, SR1).
27. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Co., Baltimore (1979)
28. Ehrgott, M.: Multicriteria Optimization. Volume 491 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, New York (2000)
29. Miettinen, K.M.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Dordrecht, Netherlands (1999)
30. Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5 (1995) 13-51
31. Toh, K.C., Todd, M.J., Tutuncu, R.: SDPT3 - a Matlab software package for semidefinite programming. Optimization Methods and Software 11 (1999) 545-581
32. Golub, G., Loan, C.: Matrix Computations. The Johns Hopkins University Press, Baltimore (1996)
33. Nene, S.A., Nayar, S.K., Murase, H.: Columbia object image library: Coil (1996)
34. Demirci, M.F., Shokoufandeh, A., Dickinson, S., Keselman, Y., Bretzner, L.: Many-to-many graph feature matching using spherical coding of directed graphs. In: ECCV. (2004)