{'fraction_non_alphanumeric': 0.012727272727272728, 'fraction_numerical': 0.0, 'mean_word_length': 5.713414634146342, '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}}
An Improved Algorithm for Fourier series Approximation Based Algorithm for Separating Touching Grain Kernels

A proposed algorithm is using elliptic Fourier series approximation for separating touching grain kernels. Algorithm is based on boundary curvature values. The image acquisition inefficiency can be removed by using image pre-processing techniques and Fourier approximation smoothes the boundary contour which avoids the local pseudo-corners of kernel caused by the presence of rough boundaries. Nodal points separating the touching instances are determined after calculating curvature values along the boundary of kernels. Final nodal points are determined by evaluating the curvature along the boundary of image and selecting those which falls below threshold. With multiple nodal points, the segmentations lines are drawn using nearest-neighbor and critical radian distance difference [rad] of chain coded boundary point. The algorithm uses Breshenham algorithm for drawing segmentation lines. The algorithm appears to be robust enough to separate most of the multiple touching scenarios.