{'fraction_non_alphanumeric': 0.019450800915331808, 'fraction_numerical': 0.0011441647597254005, 'mean_word_length': 5.161971830985915, '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}}
A Hybrid Convex Hull Algorithm for Fingertips Detection

Convex hull vertices extraction from a binary image to detect fingertips always involves multi-step pre-processing algorithm such as edge detection algorithms, before the actual convex hull algorithm can be applied on the image. The pre-processing steps often take up much computational resources. In this paper, we endeavour to reduce the computational resources by introducing a hybrid convex hull algorithm, which is able to extract the convex hull vertices directly from a binary image without going through the edge detection process. Bresenham algorithm is embedded within Jarvis March to replace most of the work required in the edge detection process. In this respect, our pre-processing step is simple and detect only four global extreme points' extraction. The new algorithm yields time complexity of O(N2).