Search

Coughing is a typical symptom of COVID-19. To detect and localize coughing sounds remotely, a convolutional neural network (CNN) based deep learning model was developed in this work and integrated with a sound camera for the visualization of the cough sounds. The cough detection model is a binary classifier of which the input is a two second acoustic feature and the output is one of two inferences (Cough or Others). Data augmentation was performed on the collected audio files to alleviate class imbalance and reflect various background noises in practical environments. For effective featuring of the cough sound, conventional features such as spectrograms, mel-scaled spectrograms, and mel-frequency cepstral coefficients (MFCC) were reinforced by utilizing their velocity (V) and acceleration (A) maps in this work. VGGNet, GoogLeNet, and ResNet were simplified to binary classifiers, and were named V-net, G-net, and R-net, respectively. To find the best combination of features and networks, training was performed for a total of 39 cases and the performance was confirmed using the test F1 score. Finally, a test F1 score of 91.9% (test accuracy of 97.2%) was achieved from G-net with the MFCC-V-A feature (named Spectroflow), an acoustic feature effective for use in cough detection. The trained cough detection model was integrated with a sound camera (i.e., one that visualizes sound sources using a beamforming microphone array). In a pilot test, the cough detection camera detected coughing sounds with an F1 score of 90.0% (accuracy of 96.0%), and the cough location in the camera image was tracked in real time., 28 pages, 20 figures, and 14 tables

Our many various relationships with persons from home, work and school give rise to our social networks. In a social network, people receive, provide, and pass a great deal of information. In this process, we often observe that certain individuals have especially strong influences on others. We call these highly influential people opinion leaders. Since the late 20th century, the number of Internet users has increased rapidly, and a huge number of people now interact with each other in online social networks. In this way, the Web community has become similar to real-world society. Internet users receive information not only from the mass media, but also from opinion leaders. For example, online articles posted by influential bloggers are often used as marketing tools or political advertisements, due to their huge influence on other users. Therefore, it is important and useful to identify the influential users in an online society. We thus propose a simple yet reliable algorithm that identifies opinion leaders in a cyber social network. In this paper, we first describe our algorithm for identifying influential users in an online society. We then demonstrate the validity of the selection of representative reviewers using the Yahoo! music and GroupLens movie databases and performing 10-fold cross-validation and z-tests.

Since the late 20th century, the number of Internet users has increased dramatically, as has the number of Web searches performed on a daily basis and the amount of information available. A huge amount of new information is transferred to the Web on a daily basis. However, not all data are reliable and valuable, which implies that it may become more and more difficult to obtain satisfactory results from Web searches. We often iterate searches several times to find what we are looking for. To solve this problem, researchers have suggested the use of recommendation systems. Instead of searching for the same information several times, a recommendation system proposes relevant information. In the Web 2.0 era, recommendation systems often rely on collaborative filtering by users. In general, a collaborative filtering approach based on user information such as gender, location, or preference is effective. However, the traditional approach can fail due to the cold-start problem or the sparsity problem, because initial user information is required for this approach to be effective. Recently, several attempts have been made to tackle these collaborative filtering problems. One such attempt used category correlations of contents. For instance, a movie has genre information provided by movie experts and directors. This category information is more reliable than user ratings. Moreover, newly created content always has category information, allowing avoidance of the cold-start problem. In this study, we consider a movie recommendation system and improve the previous algorithms based on genre correlations to correct its shortcomings. We also test the modified algorithm and analyze the results with respect to two characteristics of genre correlations.