Use of Mobile Phones as Intelligent Sensors for Sound Input Analysis and Sleep State Detection

Sleep is not just a passive process, but rather a highly dynamic process that is terminated by waking up. Throughout the night a specific number of sleep stages that are repeatedly changing in various periods of time take place. These specific time intervals and specific sleep stages are very important for the wake up event. It is far more difficult to wake up during the deep NREM (2–4) stage of sleep because the rest of the body is still sleeping. On the other hand if we wake up during the mild (REM, NREM1) sleep stage it is a much more pleasant experience for us and for our bodies. This problem led the authors to undertake this study and develop a Windows Mobile-based device application called wakeNsmile. The wakeNsmile application records and monitors the sleep stages for specific amounts of time before a desired alarm time set by users. It uses a built-in microphone and determines the optimal time to wake the user up. Hence, if the user sets an alarm in wakeNsmile to 7:00 and wakeNsmile detects that a more appropriate time to wake up (REM stage) is at 6:50, the alarm will start at 6:50. The current availability and low price of mobile devices is yet another reason to use and develop such an application that will hopefully help someone to wakeNsmile in the morning. So far, the wakeNsmile application has been tested on four individuals introduced in the final section

Algorithm for Dynamic Fingerprinting Radio Map Creation Using IMU Measurements

While a vast number of location-based services appeared lately, indoor positioning solutions are developed to provide reliable position information in environments where traditionally used satellite-based positioning systems cannot provide access to accurate position estimates. Indoor positioning systems can be based on many technologies; however, radio networks and more precisely Wi-Fi networks seem to attract the attention of a majority of the research teams. The most widely used localization approach used in Wi-Fi-based systems is based on fingerprinting framework. Fingerprinting algorithms, however, require a radio map for position estimation. This paper will describe a solution for dynamic radio map creation, which is aimed to reduce the time required to build a radio map. The proposed solution is using measurements from IMUs (Inertial Measurement Units), which are processed with a particle filter dead reckoning algorithm. Reference points (RPs) generated by the implemented dead reckoning algorithm are then processed by the proposed reference point merging algorithm, in order to optimize the radio map size and merge similar RPs. The proposed solution was tested in a real-world environment and evaluated by the implementation of deterministic fingerprinting positioning algorithms, and the achieved results were compared with results achieved with a static radio map. The achieved results presented in the paper show that positioning algorithms achieved similar accuracy even with a dynamic map with a low density of reference points

S-Divergence-Based Internal Clustering Validation Index

A clustering validation index (CVI) is employed to evaluate an algorithm’s clustering results. Generally, CVI statistics can be split into three classes, namely internal, external, and relative cluster validations. Most of the existing internal CVIs were designed based on compactness (CM) and separation (SM). The distance between cluster centers is calculated by SM, whereas the CM measures the variance of the cluster. However, the SM between groups is not always captured accurately in highly overlapping classes. In this article, we devise a novel internal CVI that can be regarded as a complementary measure to the landscape of available internal CVIs. Initially, a database’s clusters are modeled as a non-parametric density function estimated using kernel density estimation. Then the S-divergence (SD) and S-distance are introduced for measuring the SM and the CM, respectively. The SD is defined based on the concept of Hermitian positive definite matrices applied to density functions. The proposed internal CVI (PM) is the ratio of CM to SM. The PM outperforms the legacy measures presented in the literature on both superficial and realistic databases in various scenarios, according to empirical results from four popular clustering algorithms, including fuzzy k-means, spectral clustering, density peak clustering, and density-based spatial clustering applied to noisy data

Performance and Convergence Analysis of Modified C-Means Using Jeffreys-Divergence for Clustering

The size of data that we generate every day across the globe is undoubtedly astonishing due to the growth of the Internet of Things. So, it is a common practice to unravel important hidden facts and understand the massive data using clustering techniques. However, non- linear relations, which are essentially unexplored when compared to linear correlations, are more widespread within data that is high throughput. Often, nonlinear links can model a large amount of data in a more precise fashion and highlight critical trends and patterns. Moreover, selecting an appropriate measure of similarity is a well-known issue since many years when it comes to data clustering. In this work, a non-Euclidean similarity measure is proposed, which relies on non-linear Jeffreys-divergence (JS). We subsequently develop c- means using the proposed JS (J-c-means). The various properties of the JS and J-c-means are discussed. All the analyses were carried out on a few real-life and synthetic databases. The obtained outcomes show that J-c-means outperforms some cutting-edge c-means algorithms empirically

Non Destructive Defect Detection by Spectral Density Analysis

The potential nondestructive diagnostics of solid objects is discussed in this article. The whole process is accomplished by consecutive steps involving software analysis of the vibration power spectrum (eventually acoustic emissions) created during the normal operation of the diagnosed device or under unexpected situations. Another option is to create an artificial pulse, which can help us to determine the actual state of the diagnosed device. The main idea of this method is based on the analysis of the current power spectrum density of the received signal and its postprocessing in the Matlab environment with a following sample comparison in the Statistica software environment. The last step, which is comparison of samples, is the most important, because it is possible to determine the status of the examined object at a given time. Nowadays samples are compared only visually, but this method can’t produce good results. Further the presented filter can choose relevant data from a huge group of data, which originate from applying FFT (Fast Fourier Transform). On the other hand, using this approach they can be subjected to analysis with the assistance of a neural network. If correct and high-quality starting data are provided to the initial network, we are able to analyze other samples and state in which condition a certain object is. The success rate of this approximation, based on our testing of the solution, is now 85.7%. With further improvement of the filter, it could be even greater. Finally it is possible to detect defective conditions or upcoming limiting states of examined objects/materials by using only one device which contains HW and SW parts. This kind of detection can provide significant financial savings in certain cases (such as continuous casting of iron where it could save hundreds of thousands of USD)

Performance and Convergence Analysis of Modified C-Means Using Jeffreys-Divergence for Clustering.

The size of data that we generate every day across the globe is undoubtedly astonishing due to the growth of the Internet of Things. So, it is a common practice to unravel important hidden facts and understand the massive data using clustering techniques. However, non- linear relations, which are essentially unexplored when compared to linear correlations, are more widespread within data that is high throughput. Often, nonlinear links can model a large amount of data in a more precise fashion and highlight critical trends and patterns. Moreover, selecting an appropriate measure of similarity is a well-known issue since many years when it comes to data clustering. In this work, a non-Euclidean similarity measure is proposed, which relies on non-linear Jeffreys-divergence (JS). We subsequently develop c- means using the proposed JS (J-c-means). The various properties of the JS and J-c-means are discussed. All the analyses were carried out on a few real-life and synthetic databases. The obtained outcomes show that J-c-means outperforms some cutting-edge c-means algorithms empirically

FLIR vs SEEK thermal cameras in biomedicine: comparative diagnosis through infrared thermography

Background: In biomedicine, infrared thermography is the most promising technique among other conventional methods for revealing the differences in skin temperature, resulting from the irregular temperature dispersion, which is the significant signaling of diseases and disorders in human body. Given the process of detecting emitted thermal radiation of human body temperature by infrared imaging, we, in this study, present the current utility of thermal camera models namely FLIR and SEEK in biomedical applications as an extension of our previous article. Results: The most significant result is the differences between image qualities of the thermograms captured by thermal camera models. In other words, the image quality of the thermal images in FLIR One is higher than SEEK Compact PRO. However, the thermal images of FLIR One are noisier than SEEK Compact PRO since the thermal resolution of FLIR One is 160 × 120 while it is 320 × 240 in SEEK Compact PRO. Conclusion: Detecting and revealing the inhomogeneous temperature distribution on the injured toe of the subject, we, in this paper, analyzed the imaging results of two different smartphone-based thermal camera models by making comparison among various thermograms. Utilizing the feasibility of the proposed method for faster and comparative diagnosis in biomedical problems is the main contribution of this study.The work and the contribution were supported by the SPEV project “Smart Solutions in Ubiquitous Computing Environments”, University of Hradec Kralove, Faculty of Informatics and Management, Czech Republic (under ID: UHK-FIM-SPEV-2019). Supported by the grant TIN2016-75850-R from the Spanish Ministry of Economy and Competitiveness with FEDER funds

S-Divergence-Based Internal Clustering Validation Index.

A clustering validation index (CVI) is employed to evaluate an algorithm’s clustering results. Generally, CVI statistics can be split into three classes, namely internal, external, and relative cluster validations. Most of the existing internal CVIs were designed based on compactness (CM) and separation (SM). The distance between cluster centers is calculated by SM, whereas the CM measures the variance of the cluster. However, the SM between groups is not always captured accurately in highly overlapping classes. In this article, we devise a novel internal CVI that can be regarded as a complementary measure to the landscape of available internal CVIs. Initially, a database’s clusters are modeled as a non-parametric density function estimated using kerneldensity estimation. Then the S-divergence (SD) and S-distance are introduced for measuring the SM and the CM, respectively. The SD is defined based on the concept of Hermitian positive definite matrices applied to density functions. The proposed internal CVI (PM) is the ratio of CM to SM. The PM outperforms the legacy measures presented in the literature on both superficial and realistic databases in various scenarios, according to empirical results from four popular clustering algorithms, including fuzzy k-means, spectral clustering, density peak clustering, and density-based spatial clustering applied to noisy data