{'fraction_non_alphanumeric': 0.03000882612533098, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, '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}}
In-picture search algorithm for content-based image retrieval

Researchers are currently more interested in searching for fragments that are similar to a query, than a total data item that is similar to a query; the search interest is for "contains", not "is". This paper presents an O(logn) algorithm, called the "generalized virtual node (GVN)" algorithm; the GVN algorithm is a search algorithm for data fragments that have similar contents to that of a query. An example of the use of the GVN algorithm is in the search of an image database for a certain picture object regardless to what their picture backgrounds are. Each image is transformed into characteristic features and these features are stored in a hierarchical multidimensional structure, called a "k-tree." The k-tree is exploited to build a unified retrieval model for any type of multimedia data. The experimental results of this "in-picture" search algorithm on an image database demonstrate a search quality that is qualitatively and quantitatively acceptable, with a retrieval time that is faster than other algorithms, such as brute-force and partial matching.