SoroushVahidi/scidocs huggingface dataset:
Human3.6M: Large Scale Datasets and Predictive Methods for 3D Human Sensing in Natural Environments
(2014)

We introduce a new dataset, Human3.6M, of 3.6 Million accurate 3D Human poses, acquired by recording the performance of 5 female and 6 male subjects, under 4 different viewpoints, for training realistic human sensing systems and for evaluating the next generation of human pose estimation models and algorithms. Besides increasing the size of the datasets in the current state-of-the-art by several orders of magnitude, we also aim to complement such datasets with a diverse set of motions and poses encountered as part of typical human activities (taking photos, talking on the phone, posing, greeting, eating, etc.), with additional synchronized image, human motion capture, and time of flight (depth) data, and with accurate 3D body scans of all the subject actors involved. We also provide controlled mixed reality evaluation scenarios where 3D human models are animated using motion capture and inserted using correct 3D geometry, in complex real environments, viewed with moving cameras, and under occlusion. Finally, we provide a set of large-scale statistical models and detailed evaluation baselines for the dataset illustrating its diversity and the scope for improvement by future work in the research community. Our experiments show that our best large-scale model can leverage our full training set to obtain a 20% improvement in performance compared to a training set of the scale of the largest existing public dataset for this problem. Yet the potential for improvement by leveraging higher capacity, more complex models with our large dataset, is substantially vaster and should stimulate future research. The dataset together with code for the associated large-scale learning models, features, visualization tools, as well as the evaluation server, is available online at http://vision.imar.ro/human3.6m.
Sparse deep belief net model for visual area V2
(2007)

Motivated in part by the hierarchical organization of the cortex, a number of algorithms have recently been proposed that try to learn hierarchical, or “deep,” structure from unlabeled data. While several authors have formally or informally compared their algorithms to computations performed in visual area V1 (and the cochlea), little attempt has been made thus far to evaluate these algorithms in terms of their fidelity for mimicking computations at deeper levels in the cortical hierarchy. This paper presents an unsupervised learning model that faithfully mimics certain properties of visual area V2. Specifically, we develop a sparse variant of the deep belief networks of Hinton et al. (2006). We learn two layers of nodes in the network, and demonstrate that the first layer, similar to prior work on sparse coding and ICA, results in localized, oriented, edge filters, similar to the Gabor functions known to model V1 cell receptive fields. Further, the second layer in our model encodes correlations of the first layer responses in the data. Specifically, it picks up both colinear (“contour”) features as well as corners and junctions. More interestingly, in a quantitative comparison, the encoding of these more complex “corner” features matches well with the results from the Ito & Komatsu’s study of biological V2 responses. This suggests that our sparse variant of deep belief networks holds promise for modeling more higher-order features.
Modeling Human Motion Using Binary Latent Variables
(2006)

We propose a non-linear generative model for human motion data that uses an undirected model with binary latent variables and real-valued “visible” variables that represent joint angles. The latent and visible variables at each time step receive directed connections from the visible variables at the last few time-steps. Such an architecture makes on-line inference efficient and allows us to use a simple approximate learning procedure. After training, the model finds a single set of parameters that simultaneously capture several different kinds of motion. We demonstrate the power of our approach by synthesizing various motion sequences and by performing on-line filling in of data lost during motion capture. Website: http://www.cs.toronto.edu/ ∼gwtaylor/publications/nips2006mhmublv/
Efficient Large Message Broadcast using NCCL and CUDA-Aware MPI for Deep Learning
(2016)

Emerging paradigms like High Performance Data Analytics (HPDA) and Deep Learning (DL) pose at least two new design challenges for existing MPI runtimes. First, these paradigms require an efficient support for communicating unusually large messages across processes. And second, the communication buffers used by HPDA applications and DL frameworks generally reside on a GPU's memory. In this context, we observe that conventional MPI runtimes have been optimized over decades to achieve lowest possible communication latency for relatively smaller message sizes (up-to 1 Megabyte) and that too for CPU memory buffers. With the advent of CUDA-Aware MPI runtimes, a lot of research has been conducted to improve performance of GPU buffer based communication. However, little exists in current state of the art that deals with very large message communication of GPU buffers. In this paper, we investigate these new challenges by analyzing the performance bottlenecks in existing CUDA-Aware MPI runtimes like MVAPICH2-GDR, and propose hierarchical collective designs to improve communication latency of the MPI_Bcast primitive by exploiting a new communication library called NCCL. To the best of our knowledge, this is the first work that addresses these new requirements where GPU buffers are used for communication with message sizes surpassing hundreds of megabytes. We highlight the design challenges for our work along with the details of design and implementation. In addition, we provide a comprehensive performance evaluation using a Micro-benchmark and a CUDA-Aware adaptation of Microsoft CNTK DL framework. We report up to 47% improvement in training time for CNTK using the proposed hierarchical MPI_Bcast design.
Bifurcation Analysis of a Mathematical Model for Malaria Transmission
(2006)

We present an ordinary differential equation mathematical model for the spread of malaria in human and mosquito populations. Susceptible humans can be infected when they are bitten by an infectious mosquito. They then progress through the exposed, infectious, and recovered classes, before reentering the susceptible class. Susceptible mosquitoes can become infected when they bite infectious or recovered humans, and once infected they move through the exposed and infectious classes. Both species follow a logistic population model, with humans having immigration and disease-induced death. We define a reproductive number, R0, for the number of secondary cases that one infected individual will cause through the duration of the infectious period. We find that the disease-free equilibrium is locally asymptotically stable when R0 < 1 and unstable when R0 > 1. We prove the existence of at least one endemic equilibrium point for all R0 > 1. In the absence of disease-induced death, we prove that the transcritical bifurcation at R0 = 1 is supercritical (forward). Numerical simulations show that for larger values of the disease-induced death rate, a subcritical (backward) bifurcation is possible at R0 = 1.
The Distributed Dissimilar Redundancy Architecture of Fly-by-Wire Flight Control System
(2016)

This article presents a distributed dissimilar redundancy architecture of fly-by-wire Flight Control System. It is based on many dissimilar flight control computer, redundancy structure which includes the cross arranged hydraulic and power supply, three types of data buses, lots of data correction monitors, a distributed control loop to avoid the correlated faults and achieve the rigid safety airworthiness requirements. A Fault Tree Analysis (FTA) is implemented to verify whether the system safety could meet system design targets.
Handwritten Digit Recognition: A Neural Network Demo
(2001)

A handwritten digit recognition system was used in a demonstration project to visualize artificial neural networks, in particular Kohonen’s self-organizing feature map. The purpose of this project was to introduce neural networks through a relatively easy-to-understand application to the general public. This paper describes several techniques used for preprocessing the handwritten digits, as well as a number of ways in which neural networks were used for the recognition task. Whereas the main goal was a purely educational one, a moderate recognition rate of 98% was reached on a test set.
Unmanned Aerial Vehicle Based Wireless Sensor Network for Marine-Coastal Environment Monitoring
(2017)

Marine environments are delicate ecosystems which directly influence local climates, flora, fauna, and human activities. Their monitorization plays a key role in their preservation, which is most commonly done through the use of environmental sensing buoy networks. These devices transmit data by means of satellite communications or close-range base stations, which present several limitations and elevated infrastructure costs. Unmanned Aerial Vehicles (UAV) are another alternative for remote environmental monitoring which provide new types of data and ease of use. These aircraft are mainly used in video capture related applications, in its various light spectrums, and do not provide the same data as sensing buoys, nor can they be used for such extended periods of time. The aim of this research is to provide a flexible, easy to deploy and cost-effective Wireless Sensor Network (WSN) for monitoring marine environments. This proposal uses a UAV as a mobile data collector, low-power long-range communications and sensing buoys as part of a single WSN. A complete description of the design, development, and implementation of the various parts of this system is presented, as well as its validation in a real-world scenario.
A Modularization Method for Battery Equalizers Using Multiwinding Transformers
(2017)

This paper proposes a modularized global architecture using multi-winding transformers for battery cell balancing. The global balancing for a series-connected battery string is achieved based on forward conversion in each battery module and based on flyback conversion among modules. The demagnetization of the multiwinding transformers is also simultaneously achieved by the flyback conversion among modules without the need of additional demagnetizing circuits. Moreover, all MOSFET switches are driven by two complementary pulse width modulation signals without the requirement of cell voltage sensors, and energy can be automatically and simultaneously delivered from any high voltage cells to any low voltage cells. Compared with existing equalizers requiring additional balancing circuits for battery modules, the proposed modularized equalizer shares one circuit for the balancing among cells and modules. The balancing performance of the proposed equalizer is perfectly verified through experimental results, and the maximum balancing efficiency is up to 91.3%. In summary, the proposed modularized equalizer has the advantages of easier modularization, simpler control, higher efficiency, smaller size, and lower cost, ensuring the battery system higher reliability and easier implementation.
Probabilistic diffusion tractography with multiple fibre orientations: What can we gain?
(2007)

We present a direct extension of probabilistic diffusion tractography to the case of multiple fibre orientations. Using automatic relevance determination, we are able to perform online selection of the number of fibre orientations supported by the data at each voxel, simplifying the problem of tracking in a multi-orientation field. We then apply the identical probabilistic algorithm to tractography in the multi- and single-fibre cases in a number of example systems which have previously been tracked successfully or unsuccessfully with single-fibre tractography. We show that multi-fibre tractography offers significant advantages in sensitivity when tracking non-dominant fibre populations, but does not dramatically change tractography results for the dominant pathways.
CAPNet: Continuous Approximation Projection For 3D Point Cloud Reconstruction Using 2D Supervision
(2019)

Knowledge of 3D properties of objects is a necessity in order to build effective computer vision systems. However, lack of large scale 3D datasets can be a major constraint for datadriven approaches in learning such properties. We consider the task of single image 3D point cloud reconstruction, and aim to utilize multiple foreground masks as our supervisory data to alleviate the need for large scale 3D datasets. A novel differentiable projection module, called ‘CAPNet’, is introduced to obtain such 2D masks from a predicted 3D point cloud. The key idea is to model the projections as a continuous approximation of the points in the point cloud. To overcome the challenges of sparse projection maps, we propose a loss formulation termed ‘affinity loss’ to generate outlierfree reconstructions. We significantly outperform the existing projection based approaches on a large-scale synthetic dataset. We show the utility and generalizability of such a 2D supervised approach through experiments on a real-world dataset, where lack of 3D data can be a serious concern. To further enhance the reconstructions, we also propose a test stage optimization procedure to obtain reconstructions that display high correspondence with the observed input image.
Notification and awareness: synchronizing task-oriented collaborative activity
(2003)

People working collaboratively must establish and maintain awareness of one another’s intentions, actions and results. Notification systems typically support awareness of the presence, tasks and actions of collaborators, but they do not adequately support awareness of persistent and complex activities. We analysed awareness breakdowns in use of our Virtual School system—stemming from problems related to the collaborative situation, group, task and tool support—to motivate the concept of activity awareness. Activity awareness builds on prior conceptions of social and action awareness, but emphasizes the importance of activity context factors like planning and coordination. This work suggests design strategies for notification systems to better support collaborative activity. r 2003 Elsevier Science Ltd. All rights reserved.
Design Challenges/Solutions for Environments Supporting the Analysis of Social Media Data in Crisis Informatics Research
(2015)

Crisis informatics investigates how society's pervasive access to technology is transforming how it responds to mass emergency events. To study this transformation, researchers require access to large sets of data that because of their volume and heterogeneous nature are difficult to collect and analyze. To address this concern, we have designed and implemented an environment - EPIC Analyze - that supports researchers with the collection and analysis of social media data. Our research has identified the types of components - such as NoSQL, MapReduce, caching, and search - needed to ensure that these services are reliable, scalable, extensible, and efficient. We describe the design challenges encountered - such as data modeling, time vs. Space tradeoffs, and the need for a useful and usable system - when building EPIC Analyze and discuss its scalability, performance, and functionality.
Anomaly Detection and Attribution Using Bayesian Networks
(2014)

We present a novel approach to anomaly detection in Bayesian networks, enabling both the detection and explanation of anomalous cases in a dataset. By exploiting the structure of a Bayesian network, our algorithm is able to efficiently search for local maxima of data conflict between closely related variables. Benchmark tests using data simulated from complex Bayesian networks show that our approach provides a significant improvement over techniques that search for anomalies using the entire network, rather than its subsets. We conclude with demonstrations of the unique explanatory power of our approach in determining the observation(s) responsible for an anomaly. APPROVED FOR PUBLIC RELEASE
Automatic Detection of Diabetic Retinopathy using Deep Convolutional Neural Network
(2017)

The purpose of this project is to design an automated and efficient solution that could detect the symptoms of DR from a retinal image within seconds and simplify the process of reviewing and examination of images. Diabetic Retinopathy (DR) is a complication of diabetes that is caused by changes in the blood vessel of the retina and it is one of the leading causes of blindness in the developed world. Currently, detecting DR symptoms is a manual and time-consuming process. Recently, fullyconnected and convolutional neural networks have been trained to achieve state-of-the-art performance on a wide variety of tasks such as speech recognition, image classification, natural language processing, and bioinformatics. In our approach, we trained a deep Convolutional Neural Network model on a large dataset consisting around 35,000 images and used dropout layer techniques to achieve higher accuracy.
STDP-based spiking deep convolutional neural networks for object recognition
(2018)

Previous studies have shown that spike-timing-dependent plasticity (STDP) can be used in spiking neural networks (SNN) to extract visual features of low or intermediate complexity in an unsupervised manner. These studies, however, used relatively shallow architectures, and only one layer was trainable. Another line of research has demonstrated - using rate-based neural networks trained with back-propagation - that having many layers increases the recognition robustness, an approach known as deep learning. We thus designed a deep SNN, comprising several convolutional (trainable with STDP) and pooling layers. We used a temporal coding scheme where the most strongly activated neurons fire first, and less activated neurons fire later or not at all. The network was exposed to natural images. Thanks to STDP, neurons progressively learned features corresponding to prototypical patterns that were both salient and frequent. Only a few tens of examples per category were required and no label was needed. After learning, the complexity of the extracted features increased along the hierarchy, from edge detectors in the first layer to object prototypes in the last layer. Coding was very sparse, with only a few thousands spikes per image, and in some cases the object category could be reasonably well inferred from the activity of a single higher-order neuron. More generally, the activity of a few hundreds of such neurons contained robust category information, as demonstrated using a classifier on Caltech 101, ETH-80, and MNIST databases. We also demonstrate the superiority of STDP over other unsupervised techniques such as random crops (HMAX) or auto-encoders. Taken together, our results suggest that the combination of STDP with latency coding may be a key to understanding the way that the primate visual system learns, its remarkable processing speed and its low energy consumption. These mechanisms are also interesting for artificial vision systems, particularly for hardware solutions.
Weld : A Common Runtime for High Performance Data Analytics
(2016)

Modern analytics applications combine multiple functions from different libraries and frameworks to build increasingly complex workflows. Even though each function may achieve high performance in isolation, the performance of the combined workflow is often an order of magnitude below hardware limits due to extensive data movement across the functions. To address this problem, we propose Weld, a runtime for data-intensive applications that optimizes across disjoint libraries and functions. Weld uses a common intermediate representation to capture the structure of diverse dataparallel workloads, including SQL, machine learning and graph analytics. It then performs key data movement optimizations and generates efficient parallel code for the whole workflow. Weld can be integrated incrementally into existing frameworks like TensorFlow, Apache Spark, NumPy and Pandas without changing their user-facing APIs. We show that Weld can speed up these frameworks, as well as applications that combine them, by up to 30×.
Passivity-Based Controller Design of Grid-Connected VSCs for Prevention of Electrical Resonance Instability
(2015)

The time delay in the current control loop of a grid-connected voltage-source converter (VSC) may cause destabilization of electrical resonances in the grid or in the VSC's input filter. Instability is prevented if the input admittance of the VSC can be made passive. This paper presents an analytical controller design method for obtaining passivity. The method is equally applicable to single- and three-phase systems, i.e., in the latter case, for both stationary- and synchronous-frame control. Simulations and experiments verify the theoretical results.
Automatic Recognition of Deceptive Facial Expressions of Emotion
(2017)

Humans modify facial expressions in order to mislead observers regarding their true emotional states. Being able to recognize the authenticity of emotional displays is notoriously difficult for human observers. Evidence in experimental psychology shows that discriminative facial responses are short and subtle. This suggests that such behavior would be easier to distinguish when captured in high resolution at an increased frame rate. We are proposing SASE-FE, the first dataset of genuine and deceptive facial expressions of emotions for automatic recognition1 . We show that overall the problem of recognizing deceptive facial expressions can be successfully addressed by learning spatio-temporal representations of the data. For this purpose, we propose a method that aggregates features along fiducial trajectories in a deeply learnt feature space. Interesting additional results show that on average it is easier to distinguish among genuine expressions than deceptive ones and that certain emotion pairs are more difficult to distinguish than others.
Coalition Structure Generation: Dynamic Programming Meets Anytime Optimization
(2008)

Coalition structure generation involves partitioning a set of agents into exhaustive and disjoint coalitions so as to maximize the social welfare. What makes this such a challenging problem is that the number of possible solutions grows exponentially as the number of agents increases. To date, two main approaches have been developed to solve this problem, each with its own strengths and weaknesses. The state of the art in the first approach is the Improved Dynamic Programming (IDP) algorithm, due to Rahwan and Jennings, that is guaranteed to find an optimal solution in O(3), but which cannot generate a solution until it has completed its entire execution. The state of the art in the second approach is an anytime algorithm called IP, due to Rahwan et al., that provides worst-case guarantees on the quality of the best solution found so far, but which is O(n). In this paper, we develop a novel algorithm that combines both IDP and IP, resulting in a hybrid performance that exploits the strength of both algorithms and, at the same, avoids their main weaknesses. Our approach is also significantly faster (e.g. given 25 agents, it takes only 28% of the time required by IP, and 0.3% of the time required by IDP).