OpenRaiser/Intern-Atlas huggingface dataset:
Alternating Path and Coloured Clustering
Venue: arXiv cs.DS 2018
Year: 2018

In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends. In this paper, we reveal that the problem is in fact a maximum subgraph problem concerning monochromatic subgraphs and alternating paths, and demonstrate the usefulness of such connection in studying these problems. We obtain a faster algorithm to solve the problem for edge-bicoloured graphs by reducing the problem to a minimum cut problem. On the other hand, we push the NP-completeness of the problem to edge-tricoloured planar bipartite graphs of maximum degree four. Furthermore, we also give FPT algorithms for the problem when we take the numbers of stable edges and unstable edges, respectively, as parameters.
DeepPhase: Surgical Phase Recognition in CATARACTS Videos
Venue: arXiv cs.CV 2018
Year: 2018

Automated surgical workflow analysis and understanding can assist surgeons to standardize procedures and enhance post-surgical assessment and indexing, as well as, interventional monitoring. Computer-assisted interventional (CAI) systems based on video can perform workflow estimation through surgical instruments' recognition while linking them to an ontology of procedural phases. In this work, we adopt a deep learning paradigm to detect surgical instruments in cataract surgery videos which in turn feed a surgical phase inference recurrent network that encodes temporal aspects of phase steps within the phase classification. Our models present comparable to state-of-the-art results for surgical tool detection and phase recognition with accuracies of 99 and 78% respectively.
Barqi Breed Sheep Weight Estimation based on Neural Network with Regression
Venue: arXiv cs.CV 2018
Year: 2018

Computer vision is a very powerful method for understanding the contents from the images. We tried to utilize this powerful technology to make the difficult task of estimating sheep weights quick and accurate. It has enabled us to minimize the human involvement in measuring weight of the sheep. We are using a novel approach for segmentation and neural network based regression model for achieving better results for the task of estimating sheep weight.
Accuracy to Throughput Trade-offs for Reduced Precision Neural Networks on Reconfigurable Logic
Venue: arXiv cs.CV 2018
Year: 2018

Modern CNN are typically based on floating point linear algebra based implementations. Recently, reduced precision NN have been gaining popularity as they require significantly less memory and computational resources compared to floating point. This is particularly important in power constrained compute environments. However, in many cases a reduction in precision comes at a small cost to the accuracy of the resultant network. In this work, we investigate the accuracy-throughput trade-off for various parameter precision applied to different types of NN models. We firstly propose a quantization training strategy that allows reduced precision NN inference with a lower memory footprint and competitive model accuracy. Then, we quantitatively formulate the relationship between data representation and hardware efficiency. Our experiments finally provide insightful observation. For example, one of our tests show 32-bit floating point is more hardware efficient than 1-bit parameters to achieve 99% MNIST accuracy. In general, 2-bit and 4-bit fixed point parameters show better hardware trade-off on small-scale datasets like MNIST and CIFAR-10 while 4-bit provide the best trade-off in large-scale tasks like AlexNet on ImageNet dataset within our tested problem domain.
A Trace Lasso Regularized L1-norm Graph Cut for Highly Correlated Noisy Hyperspectral Image
Venue: arXiv cs.CV 2018
Year: 2018

This work proposes an adaptive trace lasso regularized L1-norm based graph cut method for dimensionality reduction of Hyperspectral images, called as `Trace Lasso-L1 Graph Cut' (TL-L1GC). The underlying idea of this method is to generate the optimal projection matrix by considering both the sparsity as well as the correlation of the data samples. The conventional L2-norm used in the objective function is sensitive to noise and outliers. Therefore, in this work L1-norm is utilized as a robust alternative to L2-norm. Besides, for further improvement of the results, we use a penalty function of trace lasso with the L1GC method. It adaptively balances the L2-norm and L1-norm simultaneously by considering the data correlation along with the sparsity. We obtain the optimal projection matrix by maximizing the ratio of between-class dispersion to within-class dispersion using L1-norm with trace lasso as the penalty. Furthermore, an iterative procedure for this TL-L1GC method is proposed to solve the optimization function. The effectiveness of this proposed method is evaluated on two benchmark HSI datasets.
On the overfly algorithm in deep learning of neural networks
Venue: arXiv cs.LG 2018
Year: 2018

In this paper we investigate the supervised backpropagation training of multilayer neural networks from a dynamical systems point of view. We discuss some links with the qualitative theory of differential equations and introduce the overfly algorithm to tackle the local minima problem. Our approach is based on the existence of first integrals of the generalised gradient system with build-in dissipation.
Resource-Size matters: Improving Neural Named Entity Recognition with Optimized Large Corpora
Venue: arXiv cs.CL 2018
Year: 2018

This study improves the performance of neural named entity recognition by a margin of up to 11% in F-score on the example of a low-resource language like German, thereby outperforming existing baselines and establishing a new state-of-the-art on each single open-source dataset. Rather than designing deeper and wider hybrid neural architectures, we gather all available resources and perform a detailed optimization and grammar-dependent morphological processing consisting of lemmatization and part-of-speech tagging prior to exposing the raw data to any training process. We test our approach in a threefold monolingual experimental setup of a) single, b) joint, and c) optimized training and shed light on the dependency of downstream-tasks on the size of corpora used to compute word embeddings.
Deep nested level sets: Fully automated segmentation of cardiac MR images in patients with pulmonary hypertension
Venue: arXiv cs.CV 2018
Year: 2018

In this paper we introduce a novel and accurate optimisation method for segmentation of cardiac MR (CMR) images in patients with pulmonary hypertension (PH). The proposed method explicitly takes into account the image features learned from a deep neural network. To this end, we estimate simultaneous probability maps over region and edge locations in CMR images using a fully convolutional network. Due to the distinct morphology of the heart in patients with PH, these probability maps can then be incorporated in a single nested level set optimisation framework to achieve multi-region segmentation with high efficiency. The proposed method uses an automatic way for level set initialisation and thus the whole optimisation is fully automated. We demonstrate that the proposed deep nested level set (DNLS) method outperforms existing state-of-the-art methods for CMR segmentation in PH patients.
CASED: Curriculum Adaptive Sampling for Extreme Data Imbalance
Venue: arXiv cs.CV 2018
Year: 2018

We introduce CASED, a novel curriculum sampling algorithm that facilitates the optimization of deep learning segmentation or detection models on data sets with extreme class imbalance. We evaluate the CASED learning framework on the task of lung nodule detection in chest CT. In contrast to two-stage solutions, wherein nodule candidates are first proposed by a segmentation model and refined by a second detection stage, CASED improves the training of deep nodule segmentation models (e.g. UNet) to the point where state of the art results are achieved using only a trivial detection stage. CASED improves the optimization of deep segmentation models by allowing them to first learn how to distinguish nodules from their immediate surroundings, while continuously adding a greater proportion of difficult-to-classify global context, until uniformly sampling from the empirical data distribution. Using CASED during training yields a minimalist proposal to the lung nodule detection problem that tops the LUNA16 nodule detection benchmark with an average sensitivity score of 88.35%. Furthermore, we find that models trained using CASED are robust to nodule annotation quality by showing that comparable results can be achieved when only a point and radius for each ground truth nodule are provided during training. Finally, the CASED learning framework makes no assumptions with regard to imaging modality or segmentation target and should generalize to other medical imaging problems where class imbalance is a persistent problem.
Robust Stabilization of Fractional-order Interval Systems via Dynamic Output Feedback: An LMI Approach
Venue: arXiv cs.SY 2018
Year: 2018

This paper addresses the problem of robust dynamic output stabilization of FO-LTI interval systems with the fractional order 0<α<2, in terms of linear matrix inequalities (LMIs). Our purpose is to design a robust dynamic output feedback controller that asymptotically stabilizes interval fractional-order linear time-invariant (FO-LTI) systems. Sufficient conditions are obtained for designing a stabilizing controller with a predetermined order, which can be chosen to be as low as possible. The LMI-based procedures of designing robust stabilizing controllers are preserved in spite of the complexity of assuming the most complete model of linear controller, with direct feedthrough parameter. Finally, some numerical examples with simulations are presented to demonstrate the effectiveness and correctness of the theoretical results. Keywords: Fractional-order system, interval uncertainty, linear matrix inequality (LMI), robust stabilization, dynamic output feedback.
Space-Time Block Coded Spatial Modulation Aided mmWave MIMO with Hybrid Precoding
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, a combination of Space Time Block Coded Spatial Modulation with Hybrid Analog-Digital Beamforming (STBC-SM-HBF) for Millimeter-wave (mmWave) communications is proposed in order to take advantage of the merits of Spatial Modulation (SM), Space-Time Block Codes (STBC), Analog Beamforming (ABF), and digital precoding techniques while avoiding their drawbacks. This proposed system benefits from the multiplexing gain of SM, from the transmit diversity gain of STBC, and from the Signal-to-Noise Ratio (SNR) gain of the beamformer. The simulation results demonstrate that the Zero Forcing (ZF) and the Minimum Mean Square Error (MMSE) precoded STBC-SM systems have better Bit Error Rate (BER) performance than the precoded SM systems. Moreover, the precoded SM shows a performance degradation compared to STBC-SM system. Furthermore, the BER is significantly improved by employing an array of ABF. In addition, it is demonstrated that a minimum of 2 antenna elements in the proposed scheme of STBC-SM-HBF are required to obtain better BER than that of the conventional SM and STBC-SM systems under the same spectral efficiency of 2 bits per sec per Hz.
Agent cognition through micro-simulations: Adaptive and tunable intelligence with NetLogo LevelSpace
Venue: arXiv cs.AI 2018
Year: 2018

We present a method of endowing agents in an agent-based model (ABM) with sophisticated cognitive capabilities and a naturally tunable level of intelligence. Often, ABMs use random behavior or greedy algorithms for maximizing objectives (such as a predator always chasing after the closest prey). However, random behavior is too simplistic in many circumstances and greedy algorithms, as well as classic AI planning techniques, can be brittle in the context of the unpredictable and emergent situations in which agents may find themselves. Our method, called agent-centric Monte Carlo cognition (ACMCC), centers around using a separate agent-based model to represent the agents' cognition. This model is then used by the agents in the primary model to predict the outcomes of their actions, and thus guide their behavior. To that end, we have implemented our method in the NetLogo agent-based modeling platform, using the recently released LevelSpace extension, which we developed to allow NetLogo models to interact with other NetLogo models. As an illustrative example, we extend the Wolf Sheep Predation model (included with NetLogo) by using ACMCC to guide animal behavior, and analyze the impact on agent performance and model dynamics. We find that ACMCC provides a reliable and understandable method of controlling agent intelligence, and has a large impact on agent performance and model dynamics even at low settings.
Synthesizing CT from Ultrashort Echo-Time MR Images via Convolutional Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

With the increasing popularity of PET-MR scanners in clinical applications, synthesis of CT images from MR has been an important research topic. Accurate PET image reconstruction requires attenuation correction, which is based on the electron density of tissues and can be obtained from CT images. While CT measures electron density information for x-ray photons, MR images convey information about the magnetic properties of tissues. Therefore, with the advent of PET-MR systems, the attenuation coefficients need to be indirectly estimated from MR images. In this paper, we propose a fully convolutional neural network (CNN) based method to synthesize head CT from ultra-short echo-time (UTE) dual-echo MR images. Unlike traditional $T_1$-w images which do not have any bone signal, UTE images show some signal for bone, which makes it a good candidate for MR to CT synthesis. A notable advantage of our approach is that accurate results were achieved with a small training data set. Using an atlas of a single CT and dual-echo UTE pair, we train a deep neural network model to learn the transform of MR intensities to CT using patches. We compared our CNN based model with a state-of-the-art registration based as well as a Bayesian model based CT synthesis method, and showed that the proposed CNN model outperforms both of them. We also compared the proposed model when only $T_1$-w images are available instead of UTE, and show that UTE images produce better synthesis than using just $T_1$-w images.
Communication-efficient Distributed Multi-resource Allocation
Venue: arXiv cs.SY 2018
Year: 2018

In several smart city applications, multiple resources must be allocated among competing agents that are coupled through such shared resources and are constrained --- either through limitations of communication infrastructure or privacy considerations. We propose a distributed algorithm to solve such distributed multi-resource allocation problems with no direct inter-agent communication. We do so by extending a recently introduced additive-increase multiplicative-decrease (AIMD) algorithm, which only uses very little communication between the system and agents. Namely, a control unit broadcasts a one-bit signal to agents whenever one of the allocated resources exceeds capacity. Agents then respond to this signal in a probabilistic manner. In the proposed algorithm, each agent makes decision of its resource demand locally and an agent is unaware of the resource allocation of other agents. In empirical results, we observe that the average allocations converge over time to optimal allocations.
Revealed Preference Dimension via Matrix Sign Rank
Venue: arXiv cs.GT 2018
Year: 2018

Given a data-set of consumer behaviour, the Revealed Preference Graph succinctly encodes inferred relative preferences between observed outcomes as a directed graph. Not all graphs can be constructed as revealed preference graphs when the market dimension is fixed. This paper solves the open problem of determining exactly which graphs are attainable as revealed preference graphs in $d$-dimensional markets. This is achieved via an exact characterization which closely ties the feasibility of the graph to the Matrix Sign Rank of its signed adjacency matrix. The paper also shows that when the preference relations form a partially ordered set with order-dimension $k$, the graph is attainable as a revealed preference graph in a $k$-dimensional market.
SPB: A Secure Private Blockchain-based Solution for Energy Trading
Venue: arXiv cs.CR 2018
Year: 2018

Blockchain is increasingly being used to provide a distributed, secure, trusted, and private framework for energy trading in smart grids. However, existing solutions suffer from lack of privacy, processing and packet overheads, and reliance on Trusted Third Parties (TTP). To address these challenges, we propose a Secure Private Blockchain-based (SPB) framework. SPB enables the energy producers and consumers to directly negotiate the energy price. To reduce the associated packet overhead, we propose a routing method which routes packets based on the destination Public Key (PK). SPB eliminates the need for TTP by introducing atomic meta-transactions. The two transactions that form a meta-transaction are visible to the blockchain participants only after both of them are generated. Thus, if one of the participants does not commit to its tasks in a pre-defined time, then the energy trade expires and the corresponding transaction is treated as invalid. The smart meter of the consumer confirms receipt of energy by generating an Energy Receipt Confirmation (ERC). To verify that the ERC is generated by a genuine smart meter, SPB supports authentication of anonymous smart meters which in turn enhances the privacy of the meter owner. Qualitative security analysis shows the resilience of SPB against a range of attacks.
Towards Explainable Inference about Object Motion using Qualitative Reasoning
Venue: arXiv cs.AI 2018
Year: 2018

The capability of making explainable inferences regarding physical processes has long been desired. One fundamental physical process is object motion. Inferring what causes the motion of a group of objects can even be a challenging task for experts, e.g., in forensics science. Most of the work in the literature relies on physics simulation to draw such infer- ences. The simulation requires a precise model of the under- lying domain to work well and is essentially a black-box from which one can hardly obtain any useful explanation. By contrast, qualitative reasoning methods have the advan- tage in making transparent inferences with ambiguous infor- mation, which makes it suitable for this task. However, there has been no suitable qualitative theory proposed for object motion in three-dimensional space. In this paper, we take this challenge and develop a qualitative theory for the motion of rigid objects. Based on this theory, we develop a reasoning method to solve a very interesting problem: Assuming there are several objects that were initially at rest and now have started to move. We want to infer what action causes the movement of these objects.
Modulation Mode Detection & Classification for in-Vivo Nano-Scale Communication Systems Operating in Terahertz Band
Venue: arXiv cs.IT 2018
Year: 2018

This work initiates the efforts to design an intelligent/cognitive nano receiver operating in Terahertz (THz) band. Specifically, we investigate two essential ingredients of an intelligent nano receiver---modulation mode detection (to differentiate between pulse based modulation and carrier based modulation), and modulation classification (to identify the exact modulation scheme in use). To implement modulation mode detection, we construct a binary hypothesis test in nano-receiver's passband, and provide closed-form expressions for the two error probabilities. As for modulation classification, we aim to represent the received signal of interest by a Gaussian mixture model (GMM). This necessitates the explicit estimation of the THz channel impulse response, and its subsequent compensation (via deconvolution). We then learn the GMM parameters via Expectation-Maximization algorithm. We then do Gaussian approximation of each mixture density to compute symmetric Kullback-Leibler divergence in order to differentiate between various modulation schemes (i.e., $M$-ary phase shift keying, $M$-ary quadrature amplitude modulation). The simulation results on mode detection indicate that there exists a unique Pareto-optimal point (for both SNR and the decision threshold) where both error probabilities are minimized. The main takeaway message by the simulation results on modulation classification is that for a pre-specified probability of correct classification, higher SNR is required to correctly identify a higher order modulation scheme. On a broader note, this work should trigger the interest of the community in the design of intelligent/cognitive nano receivers (capable of performing various intelligent tasks, e.g., modulation prediction etc.).
RS-Net: Regression-Segmentation 3D CNN for Synthesis of Full Resolution Missing Brain MRI in the Presence of Tumours
Venue: arXiv cs.CV 2018
Year: 2018

Accurate synthesis of a full 3D MR image containing tumours from available MRI (e.g. to replace an image that is currently unavailable or corrupted) would provide a clinician as well as downstream inference methods with important complementary information for disease analysis. In this paper, we present an end-to-end 3D convolution neural network that takes a set of acquired MR image sequences (e.g. T1, T2, T1ce) as input and concurrently performs (1) regression of the missing full resolution 3D MRI (e.g. FLAIR) and (2) segmentation of the tumour into subtypes (e.g. enhancement, core). The hypothesis is that this would focus the network to perform accurate synthesis in the area of the tumour. Experiments on the BraTS 2015 and 2017 datasets [1] show that: (1) the proposed method gives better performance than state-of-the-art methods in terms of established global evaluation metrics (e.g. PSNR), (2) replacing real MR volumes with the synthesized MRI does not lead to significant degradation in tumour and sub-structure segmentation accuracy. The system further provides uncertainty estimates based on Monte Carlo (MC) dropout [11] for the synthesized volume at each voxel, permitting quantification of the system's confidence in the output at each location.
Domain Robust Feature Extraction for Rapid Low Resource ASR Development
Venue: arXiv cs.CL 2018
Year: 2018

Developing a practical speech recognizer for a low resource language is challenging, not only because of the (potentially unknown) properties of the language, but also because test data may not be from the same domain as the available training data. In this paper, we focus on the latter challenge, i.e. domain mismatch, for systems trained using a sequence-based criterion. We demonstrate the effectiveness of using a pre-trained English recognizer, which is robust to such mismatched conditions, as a domain normalizing feature extractor on a low resource language. In our example, we use Turkish Conversational Speech and Broadcast News data. This enables rapid development of speech recognizers for new languages which can easily adapt to any domain. Testing in various cross-domain scenarios, we achieve relative improvements of around 25% in phoneme error rate, with improvements being around 50% for some domains.