Birch Clustering Approach for Detection of Random Valued Impulse Noise

Computer vision relies on image processing for autonomous driving, surveillance, and medical imaging. Clustering, an unsupervised learning approach, is essential for picture data organization and smooth pre-processing. Photo noise has been removed using K-Means, K-Medoid, and Fuzzy C-Means clustering methods. K-means, K-Medoid, and Fuzzy C-Means may not cluster huge datasets well with limited memory or CPU. Traditional clustering methods struggle to accommodate running durations and quality as dataset quantities rise. Birch clustering, or Balanced Iterative Reducing and Clustering utilizing Hierarchies, is frequently used in image processing because of its scalability and efficiency. Hierarchies help BIRCH summarize the dataset while maintaining as much information as feasible. The smaller summary follows the larger dataset. BIRCH is often used alongside other clustering methods to compress the dataset for the next step. Birch clustering is scalable, efficient in high-dimensional spaces, and can handle enormous datasets. Birch clustering regularly builds a tree structure to arrange images into a hierarchy of sub-clusters for effective segmentation and representation. Birch clustering divides images into sections by examining pixel intensities or characteristics for image segmentation. Birch clustering identifies typical centroids inside clusters to simplify feature extraction and allow meaningful picture data displays. Its noise reduction and data distribution adaptability make it suited for many academic and industrial image processing tasks. Birch clustering's hierarchical tree structure allows for scalability, unlike k-means' centroids-based clusters. Birch clustering creates a hierarchical tree using image data sub-clusters and centroids. It handles massive datasets thanks to its efficient memory storage. It offers scalable and efficient clustering with decreased computing complexity by dividing and combining data to create a hierarchy. The detection capabilities of the suggested technique were assessed and contrasted using "miss" and "false-hit" metrics for various test images. For a 512 × 512 Lena picture, at 40% and 50% noise density, the miss and false hit scores were 12,356 and 3,785, and 15,102 and 5,012, respectively. The score validates the efficacy of the proposed technique, which surpassed prevailing state-of-the-art filters in terms of detection performance.