{'fraction_non_alphanumeric': 0.013565891472868217, 'fraction_numerical': 0.0, 'mean_word_length': 4.875, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Partial Shape Retrieval by M-tree and a Bayesian Approach

An important problem in accessing and retrieving visual information is to provide efficient similarity machining in large databases. In this paper we propose partial retrieval by the shape similarity using Curvature Scale Space and an effective indexing using metric trees and a Bayesian approach. Each shape is partitioned into token attributes. Tokens are organized in a tree structure called M-tree. We focus on the study of the partial search ef ciency.