Relaxation Applied to Matching Quantitative Relational Structures
暂无分享,去创建一个
Abstract : A relaxation process is applied to the problem of matching relational structures involving numeric quantities. The method is empirically shown to be very sensitive to the exact form of the updating rule used. However, with the proper updating rule, the method works well, and is remarkably tolerant of measurement errors.
[1] L. Kitchen. Discrete Relaxation for Matching Relational Structures , 1978 .
[2] Azriel Rosenfeld,et al. Point pattern matching by relaxation , 1980, Pattern Recognit..