Abstract
To ensure a safe and pleasant user experience while watching content on YouTube, it is necessary to identify and classify inappropriate content, especially content that is inappropriate for children. In this work, we have concentrated on establishing an efficient system for detecting inappropriate content on YouTube. Most of the work focuses on manual pre-processing; however, it takes too much time, requires manpower support, and is not ideal for solving real-time problems. To address this challenge, we have proposed an automatic preprocessing scheme for selecting appropriate frames and removing unwanted frames such as noise and duplicate frames. For this purpose, we have utilized the proposed novel auto-determined k-means (PADK-means) algorithm. Our PADK-means algorithm automatically determines the optimal cluster count instead of manual specifications. By doing this, we have solved the manual cluster count specification problem in the traditional k-means clustering algorithm. On the other hand, to improve the system’s performance, we utilized the Proposed Feature Extraction (PFE) method, which includes two pre-trained models DenseNet121 and Inception V3 are utilized to extract local and global features from the frame. Finally, we employ a proposed double-branch recurrent network (PDBRNN) architecture, which includes bi-LSTM and GRU, to classify the video as appropriate or inappropriate. Our proposed automatic preprocessing mechanism, proposed feature extraction method, and proposed double-branch RNN classifier yielded an impressive accuracy of 97.9%.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.