An algorithm is given for processing pictorial query specifications that consist of a query image and a similarity level that must hold between the query image and database images. The similarity level specifies the contextual similarity (how well the content of one image matches that of another) as well as the spatial similarity (the relative locations of the matching symbols in the two images). The algorithm differs from previous approaches in its ability to handle multiple instances of each object in both the query and database images by searching for isomorphic subgraphs. The running time of the algorithm is O(m 2/sup m/) in the worst case where all symbols in both the query and database image are from the same class, but falls far below this bound in the presence of spatial constraints.
展开▼
机译：给出了一个算法，用于处理由查询图像和相似级别组成的图形查询规范，其必须在查询图像和数据库图像之间保持。相似度级别指定上下文相似度（一个图像的内容与另一个图像的内容匹配的程度）以及空间相似度（两个图像中的匹配符号的相对位置）。该算法与先前接近的方法不同，其能够通过搜索相对称的子图来处理查询和数据库图像中的每个对象的多个实例。算法的运行时间是在最坏情况下的o（m 2 / sup m /），其中查询和数据库映像中的所有符号来自同一类，但在存在空间约束的情况下，远低于此绑定。
展开▼
