Fusion of smartphone sensor data for classification of daily user activities

Multimedia Tools and Applications - New mobile applications need to estimate user activities by using sensor data provided by smart wearable devices and deliver context-aware solutions to users...     

Challenges and opportunities of multimodal data in human learning: The computer science students' perspective

Multimodal data have the potential to explore emerging learning practices that extend human cognitive capacities. A critical issue stretching in many multimodal learning analytics (MLA) systems and studies is the current focus aimed at supporting researchers to model learner behaviours, rather than directly supporting learners. Moreover, many MLA systems are designed and deployed without learners' involvement. We argue that in order to create MLA interfaces that directly support learning, we need to gain an expanded understanding of how multimodal data can support learners' authentic needs. We present a qualitative study in which 40 computer science students were tracked in an authentic learning activity using wearable and static sensors. Our findings outline learners' curated representations about multimodal data and the non-technical challenges in using these data in their learning practice. The paper discusses 10 dimensions that can serve as guidelines for researchers and designers to create effective and ethically aware student-facing MLA innovations.     

Adaptive content-based music retrieval system

This paper presents a tunable content-based music retrieval (CBMR) system suitable the for retrieval of music audio clips. The audio clips are represented as extracted feature vectors. The CBMR system is expert-tunable by altering the feature space. The feature space is tuned according to the expert-specified similarity criteria expressed in terms of clusters of similar audio clips. The main goal of tuning the feature space is to improve retrieval performance, since some features may have more impact on perceived similarity than others. The tuning process utilizes our genetic algorithm. The R-tree index for efficient retrieval of audio clips is based on the clustering of feature vectors. For each cluster a minimal bounding rectangle (MBR) is formed, thus providing objects for indexing. Inserting new nodes into the R-tree is efficiently performed because of the chosen Quadratic Split algorithm. Our CBMR system implements the point query and the n-nearest neighbors query with the O(logn) time complexity. Different objective functions based on cluster similarity and dissimilarity measures are used for the genetic algorithm. We have found that all of them have similar impact on the retrieval performance in terms of precision and recall. The paper includes experimental results in measuring retrieval performance, reporting significant improvement over the untuned feature space.     

Collaborative spaces for GIS-based multimedia cartography in blended environments

The interaction spaces between instructors and learners in the traditional face-to-face classroom environment are being changed by the diffusion and adoption of many forms of computer-based pedagogy. An integrated understanding of these evolving interaction spaces together with how they interconnect and leverage learning are needed to develop meaningful strategies for effective teaching and learning. The 18i collaborative interaction spaces model was designed based on constructivist principles, and describes 18 mixed instructor–learner spaces contextualized at a finer operational scale that makes explicit a wider range of interactions. The model was implemented during the life cycle of an undergraduate GIS-based multimedia cartography course. One output was the generation of a repository of rule-based trajectory plans for rapid planning and problem solving. The model provides an integrated workflow to manage course contents, products, interactions, individuality, and learning styles in blended environments.     

Automated visual inspection of imprint quality of pharmaceutical tablets

Visual appearance is an important quality factor of pharmaceutical tablets. Moreover, it plays a key role in identification of tablets, which is needed to prevent mix-ups among various types of tablets. Since identification of tablets is most frequently done by imprints, good imprint quality, a property that makes the imprint readable, is of utmost importance in preventing mix-ups among the tablets. In this paper, we propose a novel method for automated visual inspection of tablets. Besides defect detection, imprint quality inspection is also considered. Performance of the method was evaluated on three different real tablet image databases of imprinted tablets. A “gold standard” was established by manually classifying tablets into a good and a defective class. The receiver operating characteristics (ROC) analysis indicated that the proposed method yields better sensitivity and specificity than the previous defect detection method.     

HFPaC: GPU friendly height field parallel compression

In this paper, we present a novel method for fast lossy or lossless compression and decompression of regular height fields. The method is suitable for SIMD parallel implementation and thus inherently suitable for modern GPU architectures. Lossy compression is achieved by approximating the height field with a set of quadratic Bezier surfaces. In addition, lossless compression is achieved by superimposing the residuals over the lossy approximation. We validated the method’s efficiency through a CUDA implementation of compression and decompression algorithms. The method allows independent decompression of individual data points, as well as progressive decompression. Even in the case of lossy decompression, the decompressed surface is inherently seamless. In comparison with the GPU-oriented state-of-the-art method, the proposed method, combined with a widely available lossless compression method (such as DEFLATE), achieves comparable compression ratios. The method’s efficiency slightly outperforms the state-of-the-art method for very high workloads and considerably for lower workloads.     

Memory leak detection in Plumbr

Platforms with automatic memory management, such as the JVM, are usually considered free of memory leaks. However, memory leaks can happen in such environments, as the garbage collector cannot free objects, which are not used by the application anymore, but are still referenced. Such unused objects can eventually fill up the heap and crash the application. Although this problem has been studied extensively, nevertheless, there are still many rooms for improvement in this area. This paper describes the statistical approach for memory leak detection, as an alternative, along with a commercial tool, Plumbr, which is based on the method. The tool is later analyzed with three case studies of real applications and in the process also analyzes strengths and weaknesses of the statistical approach for memory leak detection. Copyright © 2014 John Wiley & Sons, Ltd.