{'fraction_non_alphanumeric': 0.015557476231633534, 'fraction_numerical': 0.0025929127052722557, 'mean_word_length': 4.7611940298507465, '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}}
Removing car shadows in video images using entropy and Euclidean distance features

Detecting car motion in video frames is one of the key subjects in computer vision society. In recent years, different approaches have been proposed to address this issue. One of the main challenges of developed image processing systems for car detection is their shadows. Car shadows change the appearance of them in a way that they might seem stitched to other neighboring cars. This study aims to propose an optimized method for removing car shadows using entropy and Euclidean distance features. For each pixel, a weight is assigned according to the mentioned features. The weights assigned to shadows and background (asphalt) pixels are very close to each other which enable the background subtraction to remove both of them. The proposed method was evaluated on three datasets based on OA, HR, FAR, MODP and MOTP measures. The method was also compared with both NCC and HSV color methods which are well-known in removing car shadows. The results showed that the proposed methods depending on the type of the index is variable between 3 to 12 percent accurate results.