Context driven matching in structural pattern recognition
暂无分享,去创建一个
Publisher Summary This chapter examines the problem of structural pattern recognition using graph structures. To speed up the correspondence problem, the chapter proposes a histogram technique which characterizes the context of a primitive within a pattern and allows indexing in the model database with polynomial complexity. The chapter presents a new iterative matching technique based on a histogram of structural context information. Experiments show a good noise suppressing ability while retaining adequate recognition results with minimal false alarms. Because scene primitives are structurally mapped onto the model, orientation and scale can be hypothesized from a match, whereas the model can be used to direct a search for missing information, thereby improving or ignoring the match. This will be the subject for further work.
[1] Sidharta Gautama,et al. Automatic induction of relational models , 1996, Defense, Security, and Sensing.
[2] Johan Van Cleynenbreugel. Tapping multiple knowledge sources to delineate road networks on high resolution satellite images , 1991 .
[3] William J. Christmas,et al. Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[4] Larry S. Davis,et al. Hypothesis integration in image understanding systems , 1985, Comput. Vis. Graph. Image Process..