| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 90 === To retrieve the maximum similar sub-pictures for two pictures in pictorial database, there are three types (Type-0, Type-1, and Type-2) of spatial relationships to deal with. Up to now, some researchers had presented an algorithm to solve the problem for the Type-2 case. However, their method did not apply for the rotational pictures. As for the Type-0 and Type-1 cases, they had been shown to be NP-complete problems.
In this thesis, we first propose a method to solve type-2 case of retrieving maximum similar sub-pictures for two pictures that may be rotated. Next, for the Type-0 and Type-1 cases, we will present an algorithm to obtain the minimum ratio of the similar degree for two given pictures within a reasonable time.
|
|---|
