Query: Collaborative video reindexing via matrix factorization

Relevant passages:
Content-based multimedia information retrieval: State of the art and challenges <=SEP=> Extending beyond the boundaries of science, art, and culture, content-based multimedia information retrieval provides new paradigms and methods for searching through the myriad variety of media all over the world. This survey reviews 100+ recent articles on content-based multimedia information retrieval and discusses their role in current research directions which include browsing and search paradigms, user studies, affective computing, learning, semantic queries, new features and media types, high performance indexing, and evaluation techniques. Based on the current state of the art, we discuss the major challenges for the future.

The challenge problem for automated detection of 101 semantic concepts in multimedia <=SEP=> We introduce the challenge problem for generic video indexing to gain insight in intermediate steps that affect performance of multimedia analysis methods, while at the same time fostering repeatability of experiments. To arrive at a challenge problem, we provide a general scheme for the systematic examination of automated concept detection methods, by decomposing the generic video indexing problem into 2 unimodal analysis experiments, 2 multimodal analysis experiments, and 1 combined analysis experiment. For each experiment, we evaluate generic video indexing performance on 85 hours of international broadcast news data, from the TRECVID 2005/2006 benchmark, using a lexicon of 101 semantic concepts. By establishing a minimum performance on each experiment, the challenge problem allows for component-based optimization of the generic indexing issue, while simultaneously offering other researchers a reference for comparison during indexing methodology development. To stimulate further investigations in intermediate analysis steps that inuence video indexing performance, the challenge offers to the research community a manually annotated concept lexicon, pre-computed low-level multimedia features, trained classifier models, and five experiments together with baseline performance, which are all available at http://www.mediamill.nl/challenge/.

Robust video denoising using low rank matrix completion <=SEP=> Most existing video denoising algorithms assume a single statistical model of image noise, e.g. additive Gaussian white noise, which often is violated in practice. In this paper, we present a new patch-based video denoising algorithm capable of removing serious mixed noise from the video data. By grouping similar patches in both spatial and temporal domain, we formulate the problem of removing mixed noise as a low-rank matrix completion problem, which leads to a denoising scheme without strong assumptions on the statistical properties of noise. The resulting nuclear norm related minimization problem can be efficiently solved by many recently developed methods. The robustness and effectiveness of our proposed denoising algorithm on removing mixed noise, e.g. heavy Gaussian noise mixed with impulsive noise, is validated in the experiments and our proposed approach compares favorably against some existing video denoising algorithms.

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information <=SEP=> This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f/spl isin/C/sup N/ and a randomly chosen set of frequencies /spl Omega/. Is it possible to reconstruct f from the partial knowledge of its Fourier coefficients on the set /spl Omega/? A typical result of this paper is as follows. Suppose that f is a superposition of |T| spikes f(t)=/spl sigma//sub /spl tau//spl isin/T/f(/spl tau/)/spl delta/(t-/spl tau/) obeying |T|/spl les/C/sub M//spl middot/(log N)/sup -1/ /spl middot/ |/spl Omega/| for some constant C/sub M/>0. We do not know the locations of the spikes nor their amplitudes. Then with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the /spl lscr//sub 1/ minimization problem. In short, exact recovery may be obtained by solving a convex optimization problem. We give numerical values for C/sub M/ which depend on the desired probability of success. Our result may be interpreted as a novel kind of nonlinear sampling theorem. In effect, it says that any signal made out of |T| spikes may be recovered by convex programming from almost every set of frequencies of size O(|T|/spl middot/logN). Moreover, this is nearly optimal in the sense that any method succeeding with probability 1-O(N/sup -M/) would in general require a number of frequency samples at least proportional to |T|/spl middot/logN. The methodology extends to a variety of other situations and higher dimensions. For example, we show how one can reconstruct a piecewise constant (one- or two-dimensional) object from incomplete frequency samples - provided that the number of jumps (discontinuities) obeys the condition above - by minimizing other convex functionals such as the total variation of f.

A Singular Value Thresholding Algorithm for Matrix Completion <=SEP=> This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem and arises in many important applications as in the task of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Off-the-shelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries. This paper develops a simple first-order and easy-to-implement algorithm that is extremely efficient at addressing problems in which the optimal solution has low rank. The algorithm is iterative, produces a sequence of matrices {Xk ,Y k}, and at each step mainly performs a soft-thresholding operation on the singular values of the matrix Y k. There are two remarkable features making this attractive for low-rank matrix completion problems. The first is that the soft-thresholding operation is applied to a sparse matrix; the second is that the rank of the iterates {Xk} is empirically nondecreasing. Both these facts allow the algorithm to make use of very minimal storage space and keep the computational cost of each iteration low. On the theoretical side, we provide a convergence analysis showing that the sequence of iterates converges. On the practical side, we provide numerical examples in which 1, 000 × 1, 000 matrices are recovered in less than a minute on a modest desktop computer. We also demonstrate that our approach is amenable to very large scale problems by recovering matrices of rank about 10 with nearly a billion unknowns from just about 0.4% of their sampled entries. Our methods are connected with the recent literature on linearized Bregman iterations for 1 minimization, and we develop a framework in which one can understand these algorithms in terms of well-known Lagrange multiplier algorithms.

Prevalence and Predictors of Maternal Anemia during Pregnancy in Gondar, Northwest Ethiopia: An Institutional Based Cross-Sectional Study <=SEP=> Background. Anaemia is a global public health problem which has an eminence impact on pregnant mother. The aim of this study was to assess the prevalence and predictors of maternal anemia. Method. A cross-sectional study was conducted from March 1 to April 30, 2012, on 302 pregnant women who attended antenatal care at Gondar University Hospital. Interview-based questionnaire, clinical history, and laboratory tests were used to obtain data. Bivariate and multivariate logistic regression was used to identify predictors. Result. The prevalence of anemia was 16.6%. Majority were mild type (64%) and morphologically normocytic normochromic (76%) anemia. Anemia was high at third trimester (18.9%). Low family income (AOR [95% CI] = 3.1 [1.19, 8.33]), large family size (AOR [95% CI] = 4.14 [4.13, 10.52]), hookworm infection (AOR [95% CI] = 2.72 [1.04, 7.25]), and HIV infection (AOR [95% CI] = 5.75 [2.40, 13.69]) were independent predictors of anemia. Conclusion. The prevalence of anemia was high; mild type and normocytic normochromic anemia was dominant. Low income, large family size, hookworm infection, and HIV infection were associated with anemia. Hence, efforts should be made for early diagnosis and management of HIV and hookworm infection with special emphasis on those having low income and large family size.

eSOLHotel: Generación de un lexicón de opinión en español adaptado al dominio turístico <=SEP=> Since Web 2.0 is the largest container for subjective expressions about different topics or issues expressed in all languages, the study of Sentiment Analysis has grown exponentially. In this work, we focus on Spanish polarity classification of hotel reviews and a new domain-dependent lexical resource (eSOLHotel) is presented. This new lexicon has been compiled following a corpus-based approach. We have carried out several experiments using an unsupervised approach for the polarity classification over the category of hotels from corpus SFU. The results obtained with the new lexicon eSOLHotel outperform the results with other general purpose lexicon.

An IoT based reference architecture for smart water management processes <=SEP=> Water is a vital resource for life, and its management is a key issue nowadays. Information and communications technology systems for water control are currently facing interoperability problems due to the lack of support of standardization in monitory and control equipment. This problem affects various processes in water management, such as water consumption, distribution, system identification and equipment maintenance. OPC UA (Object Linking and Embedding for Process Control Unified Architecture) is a platform independent service-oriented architecture for the control of processes in the logistic and manufacturing sectors. Based on this standard we propose a smart water management model combining Internet of Things technologies with business processes coordination and decision support systems. We provide an architecture for sub-system interaction and a detailed description of the physical scenario in which we will test our implementation, allowing specific vendor equipment to be manageable and interoperable in the specific context of water management processes.

Multimodal Word Distributions <=SEP=> Word embeddings provide point representations of words containing useful semantic information. We introduce multimodal word distributions formed from Gaussian mixtures, for multiple word meanings, entailment, and rich uncertainty information. To learn these distributions, we propose an energy-based max-margin objective. We show that the resulting approach captures uniquely expressive semantic information, and outperforms alternatives, such as word2vec skip-grams, and Gaussian embeddings, on benchmark datasets such as word similarity and entailment.

Learning to dress: synthesizing human dressing motion via deep reinforcement learning <=SEP=> Creating animation of a character putting on clothing is challenging due to the complex interactions between the character and the simulated garment. We take a model-free deep reinforcement learning (deepRL) approach to automatically discovering robust dressing control policies represented by neural networks. While deepRL has demonstrated several successes in learning complex motor skills, the data-demanding nature of the learning algorithms is at odds with the computationally costly cloth simulation required by the dressing task. This paper is the first to demonstrate that, with an appropriately designed input state space and a reward function, it is possible to incorporate cloth simulation in the deepRL framework to learn a robust dressing control policy. We introduce a salient representation of haptic information to guide the dressing process and utilize it in the reward function to provide learning signals during training. In order to learn a prolonged sequence of motion involving a diverse set of manipulation skills, such as grasping the edge of the shirt or pulling on a sleeve, we find it necessary to separate the dressing task into several subtasks and learn a control policy for each subtask. We introduce a policy sequencing algorithm that matches the distribution of output states from one task to the input distribution for the next task in the sequence. We have used this approach to produce character controllers for several dressing tasks: putting on a t-shirt, putting on a jacket, and robot-assisted dressing of a sleeve.

OmniPres project IST-2001-39237 Deliverable 5 Measuring Presence : A Guide to Current Measurement Approaches <=SEP=> This compendium constitutes a comprehensive overview of presence measures described in the literature so far. It contains both subjective and objective approaches to presence measurement. The theoretical basis of measures is described, along with research in which they have been applied, and other relevant literature. Authors: Joy van Baren and Wijnand IJsselsteijn Project funded by the European Community under the "Information Society Technologies" Programme

Clinical applications of the Miniscrew Anchorage System. <=SEP=> 

Anonymous Walk Embeddings <=SEP=> The task of representing entire graphs has seen a surge of prominent results, mainly due to learning convolutional neural networks (CNNs) on graphstructured data. While CNNs demonstrate stateof-the-art performance in graph classification task, such methods are supervised and therefore steer away from the original problem of network representation in task-agnostic manner. Here, we coherently propose an approach for embedding entire graphs and show that our feature representations with SVM classifier increase classification accuracy of CNN algorithms and traditional graph kernels. For this we describe a recently discovered graph object, anonymous walk, on which we design task-independent algorithms for learning graph representations in explicit and distributed way. Overall, our work represents a new scalable unsupervised learning of state-of-the-art representations of entire graphs.

Evaluation Of Linear Interpolation Smoothing On Naive Bayes Spam Classifier <=SEP=> The inconvenience associated with spams and the cost of having an important mail misclassified as spam have made all efforts at improving spam filtering worthwhile. The Naive Bayes algorithm has been found to be successful in properly classifying mails. However, they are not perfect. Recent researches have introduced the idea of smoothing into the Naive Bayes algorithm and they have been found to produce better classification. This study applies the concept of linear interpolation smoothing to Naive Bayes spam classification. The resulting classifier did well at improving spam classification and also reducing false positives.

CS Unplugged and Middle-School Students' Views, Attitudes, and Intentions Regarding CS <=SEP=> Many students hold incorrect ideas and negative attitudes about computer science (CS). In order to address these difficulties, a series of learning activities called Computer Science Unplugged was developed by Tim Bell and his colleagues. These activities expose young people to central concepts in CS in an entertaining way without requiring a computer. The CS Unplugged activities have become more and more popular among CS educators and several activities are recommended in the ACM K-12 curriculum for elementary schools. CS Unplugged is used worldwide and has been translated into many languages.
 We examined the effect of the CS Unplugged activities on middle-school students’ ideas about CS and their desire to consider and study it in high school. The results indicate that following the activities the ideas of the students on what CS is about were partially improved, but their desire to study CS lessened.
 In order to provide possible explanations to these results, we analyzed the CS Unplugged activities to determine to what extent the objectives of CS Unplugged were addressed in the activities. In addition, we checked whether the activities were designed according to constructivist principles and whether they were explicitly linked to central concepts in CS. We found that only some of the objectives were addressed in the activities, that the activities do not engage with the students’ prior knowledge and that most of the activities are not explicitly linked to central concepts in CS. We offer suggestions for modifying the CS Unplugged activities so that they will be more likely to achieve their objectives.

Assistive Clothing Pattern Recognition for Visually Impaired People <=SEP=> Choosing clothes with complex patterns and colors is a challenging task for visually impaired people. Automatic clothing pattern recognition is also a challenging research problem due to rotation, scaling, illumination, and especially large intraclass pattern variations. We have developed a camera-based prototype system that recognizes clothing patterns in four categories (plaid, striped, patternless, and irregular) and identifies 11 clothing colors. The system integrates a camera, a microphone, a computer, and a Bluetooth earpiece for audio description of clothing patterns and colors. A camera mounted upon a pair of sunglasses is used to capture clothing images. The clothing patterns and colors are described to blind users verbally. This system can be controlled by speech input through microphone. To recognize clothing patterns, we propose a novel Radon Signature descriptor and a schema to extract statistical properties from wavelet subbands to capture global features of clothing patterns. They are combined with local features to recognize complex clothing patterns. To evaluate the effectiveness of the proposed approach, we used the CCNY Clothing Pattern dataset. Our approach achieves 92.55% recognition accuracy which significantly outperforms the state-of-the-art texture analysis methods on clothing pattern recognition. The prototype was also used by ten visually impaired participants. Most thought such a system would support more independence in their daily life but they also made suggestions for improvements.

An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs <=SEP=> 

Automatic prediction of frustration <=SEP=> Predicting when a person might be frustrated can provide an intelligent system with important information about when to initiate interaction. For example, an automated Learning Companion or Intelligent Tutoring System might use this information to intervene, providing support to the learner who is likely to otherwise quit, while leaving engaged learners free to discover things without interruption. This paper presents the first automated method that assesses, using multiple channels of affect-related information, whether a learner is about to click on a button saying ‘‘I’m frustrated.’’ The new method was tested on data gathered from 24 participants using an automated Learning Companion. Their indication of frustration was automatically predicted from the collected data with 79% accuracy ðchance 1⁄4 58%Þ. The new assessment method is based on Gaussian process classification and Bayesian inference. Its performance suggests that non-verbal channels carrying affective cues can help provide important information to a system for formulating a more intelligent response. r 2007 Elsevier Ltd. All rights reserved.

Sleep and autism spectrum disorders. <=SEP=> Sleep disorders are common in children with autism spectrum disorders and have a significant effect on daytime function and parental stress. The cornerstone of treatment is to establish the cause of the sleep concern, which is often multifactorial. Identifying and treating sleep disorders may result not only in more consolidated sleep, more rapid time to fall asleep, and avoidance of night waking but also favorably affect daytime behavior and parental stress. Targeting effective treatment strategies is dependent on understanding the underlying causes of sleep problems in children with Autism spectrum disorders, therefore further research is paramount.

utomatic detection of skin defects in citrus fruits using a multivariate image nalysis approach <=SEP=> One of the main problems in the post-harvest processing of citrus is the detection of visual defects in order to classify the fruit depending on their appearance. Species and cultivars of citrus present a high rate of unpredictability in texture and colour that makes it difficult to develop a general, unsupervised method able of perform this task. In this paper we study the use of a general approach that was originally developed for the detection of defects in random colour textures. It is based on a Multivariate Image Analysis strategy and uses Principal Component Analysis to extract a reference eigenspace from a matrix built by unfolding colour and spatial data from samples of defect-free peel. Test images are also unfolded and projected onto the reference eigenspace and the result is a score matrix which is used to compute defective maps based on the T2 statistic. In addition, a multiresolution scheme is introduced nsupervised Methods in the original method to speed up the process. Unlike the techniques commonly used for the detection of defects in fruits, this is an unsupervised method that only needs a few samples to be trained. It is also a simple approach that is suitable for real-time compliance. Experimental work was performed on 120 samples of oranges and mandarins from four different cultivars: Clemenules, Marisol, Fortune, and Valencia. The success ratio for the detection of individual defects was 91.5%, while the classification ratio of damaged/sound samples was 94.2%. These results show that the studied method can be suitable for on. the task of citrus inspecti

Improved random redundant iterative HDPC decoding <=SEP=> An iterative algorithm for soft-input soft-output (SISO) decoding of classical algebraic cyclic block codes is presented below. Inspired by other approaches for high performance belief propagation (BP) decoding, this algorithm requires up to 10 times less computational complexity than other methods that achieve similar performance. By utilizing multiple BP decoders, and using random permutation taken from the permutation group of the code, this algorithm reaches near maximum likelihood performance. A computational complexity comparison of the proposed algorithm versus other methods is presented as well. This includes complexity versus performance analysis, allowing one to trade between the former and the latter, according to ones needs.

Unsupervised Video Object Segmentation with Motion-Based Bilateral Networks <=SEP=> In this work, we study the unsupervised video object segmentation problem where moving objects are segmented without prior knowledge of these objects. First, we propose a motion-based bilateral network to estimate the background based on the motion pattern of non-object regions. The bilateral network reduces false positive regions by accurately identifying background objects. Then, we integrate the background estimate from the bilateral network with instance embeddings into a graph, which allows multiple frame reasoning with graph edges linking pixels from different frames. We classify graph nodes by defining and minimizing a cost function, and segment the video frames based on the node labels. The proposed method outperforms previous state-of-the-art unsupervised video object segmentation methods against the DAVIS 2016 and the FBMS-59 datasets.

Moving Target Defense - Creating Asymmetric Uncertainty for Cyber Threats <=SEP=> Excellent book is always being the best friend for spending little time in your office, night time, bus, and everywhere. It will be a good way to just look, open, and read the book while in that time. As known, experience and skill don't always come with the much money to acquire them. Reading this book with the PDF moving target defense creating asymmetric uncertainty for cyber threats will let you know more things.

Decade-bandwidth planar balun using CPW-to-slotline transition for UHF applications <=SEP=> This paper presents an improved broadband balun using a coplanar-waveguide(CPW)-to-slotline field transformation. It operates at very wide frequency, and is of compact size since it does not depend on a resonant structure. The measured results show a passband of 200 MHz to 2 GHz, insertion loss less than 0.75 dB and a size of 20 mm × 14 mm. The amplitude imbalance is approximately 0.3 dB and the phase imbalance is less than 6o over the entire operation range.

GHz UWB automotive short range radar – Spectrum allocation and technology trends <=SEP=> Automotive UWB (Ultra-Wideband) short range radar (SSR) is on the market as a key technology for novel comfort and safety systems. SiGe based 79 GHz UWB SRR will be a definite candidate for the long term substitution of the 24 GHz UWB SRR. This paper will give an overview of the finished BMBF joint project KOKON and the recently started successing project RoCC, which concentrate on the development of this technology and sensor demonstrators. In both projects, the responsibilities of Daimler AG deal with application based sensor specification, test and evaluation of realized sensor demonstrators. Recent UWB SRR frequency regulation approaches and activitites will be introduced. Furthermore, some first results of Daimler activities within RoCC will be presented, dealing with the packaging and operation of these sensors within the complex car environment.

JackIn: integrating first-person view with out-of-body vision generation for human-human augmentation <=SEP=> JackIn is a new human-human communication framework for connecting two or more people. With first-person view video streaming from a person (called Body) wearing a transparent head-mounted display and a head-mounted camera, the other person (called Ghost) participates in the shared first-person view. With JackIn, people's activities can be shared and assistance or guidance can be given through other peoples expertise. This can be applied to daily activities such as cooking lessons, shopping navigation, education in craft-work or electrical work, and sharing experiences of sporting and live events. For a better viewing experience with frist-person view, we developed the out-of-body view in which first-person images are integrated to construct a scene around a Body, and a Ghost can virtually control the viewpoint to look around the space surrounding the Body. We also developed a tele-pointing gesture interface. We conducted an experiment to evaluate how effective this framework is and found that Ghosts can understand the spatial situation of the Body.

Adaptive Control of an Electrically Driven Nonholonomic Mobile Robot via Backstepping and Fuzzy Approach <=SEP=> This paper investigates the tracking control of an electrically driven nonholonomic mobile robot with model uncertainties in the robot kinematics, the robot dynamics, and the wheel actuator dynamics. A robust adaptive controller is proposed with the utilization of adaptive control, backstepping and fuzzy logic techniques. The proposed control scheme employs the adaptive control approach to design an auxiliary wheel velocity controller to make the tracking error as small as possible in consideration of uncertainties in the kinematics of the robot, and makes use of the fuzzy logic systems to learn the behaviors of the unknown dynamics of the robot and the wheel actuators. The approximation errors and external disturbances can be efficiently counteracted by employing smooth robust compensators. A major advantage of the proposed method is that previous knowledge of the robot kinematics and the dynamics of the robot and wheel actuators is no longer necessary. This is because the controller learns both the robot kinematics and the robot and wheel actuator dynamics online. Most importantly, all signals in the closed-loop system can be guaranteed to be uniformly ultimately bounded. For the dynamic uncertainties of robot and actuator, the assumption of ldquolinearity in the unknown parametersrdquo and tedious analysis of determining the ldquoregression matricesrdquo in the standard adaptive robust controllers are no longer necessary. The performance of the proposed approach is demonstrated through a simulation example.

Fast and accurate analysis of scanning slotted waveguide arrays <=SEP=> An iterative procedure is presented for a fast and accurate analysis of scanning slotted waveguide arrays including the effects of mutual couplings and their dependence on the scanning angle. The analysis takes also into account the input transitions from the feeding network; each slotted waveguide being excited either at one end or at the centre. The procedure is applied to the simple case of a linear array of four slots, for which a full-wave analysis could be carried out for comparison. The proposed method is shown to provide excellent agreement with the full-wave computation still requiring extremely short computation times.

One Sentence One Model for Neural Machine Translation <=SEP=> Neural machine translation (NMT) becomes a new state-ofthe-art and achieves promising translation results using a simple encoder-decoder neural network. This neural network is trained once on the parallel corpus and the fixed network is used to translate all the test sentences. We argue that the general fixed network cannot best fit the specific test sentences. In this paper, we propose the dynamic NMT which learns a general network as usual, and then fine-tunes the network for each test sentence. The fine-tune work is done on a small set of the bilingual training data that is obtained through similarity search according to the test sentence. Extensive experiments demonstrate that this method can significantly improve the translation performance, especially when highly similar sentences are available.

Natural Image Stitching with the Global Similarity Prior <=SEP=> This paper proposes a method for stitching multiple images together so that the stitched image looks as natural as possible. Our method adopts the local warp model and guides the warping of each image with a grid mesh. An objective function is designed for specifying the desired characteristics of the warps. In addition to good alignment and minimal local distortion, we add a global similarity prior in the objective function. This prior constrains the warp of each image so that it resembles a similarity transformation as a whole. The selection of the similarity transformation is crucial to the naturalness of the results. We propose methods for selecting the proper scale and rotation for each image. The warps of all images are solved together for minimizing the distortion globally. A comprehensive evaluation shows that the proposed method consistently outperforms several state-of-the-art methods, including AutoStitch, APAP, SPHP and ANNAP.