OpenRaiser/Intern-Atlas huggingface dataset:
Online Adaptation of Convolutional Neural Networks for Video Object Segmentation
Venue: arXiv cs.CV 2017
Year: 2017

We tackle the task of semi-supervised video object segmentation, i.e. segmenting the pixels belonging to an object in the video using the ground truth pixel mask for the first frame. We build on the recently introduced one-shot video object segmentation (OSVOS) approach which uses a pretrained network and fine-tunes it on the first frame. While achieving impressive performance, at test time OSVOS uses the fine-tuned network in unchanged form and is not able to adapt to large changes in object appearance. To overcome this limitation, we propose Online Adaptive Video Object Segmentation (OnAVOS) which updates the network online using training examples selected based on the confidence of the network and the spatial configuration. Additionally, we add a pretraining step based on objectness, which is learned on PASCAL. Our experiments show that both extensions are highly effective and improve the state of the art on DAVIS to an intersection-over-union score of 85.7%.
Default Logic and Bounded Treewidth
Venue: arXiv cs.AI 2017
Year: 2017

In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded. We establish a dynamic programming algorithm on tree decompositions that decides whether a theory has a consistent stable extension (Ext). Our algorithm can even be used to enumerate all generating defaults (ExtEnum) that lead to stable extensions. We show that our algorithm decides Ext in linear time in the input theory and triple exponential time in the treewidth (so-called fixed-parameter linear algorithm). Further, our algorithm solves ExtEnum with a pre-computation step that is linear in the input theory and triple exponential in the treewidth followed by a linear delay to output solutions.
Summarization of ICU Patient Motion from Multimodal Multiview Videos
Venue: arXiv cs.CV 2017
Year: 2017

Clinical observations indicate that during critical care at the hospitals, patients sleep positioning and motion affect recovery. Unfortunately, there is no formal medical protocol to record, quantify, and analyze patient motion. There is a small number of clinical studies, which use manual analysis of sleep poses and motion recordings to support medical benefits of patient positioning and motion monitoring. Manual processes are not scalable, are prone to human errors, and strain an already taxed healthcare workforce. This study introduces DECU (Deep Eye-CU): an autonomous mulitmodal multiview system, which addresses these issues by autonomously monitoring healthcare environments and enabling the recording and analysis of patient sleep poses and motion. DECU uses three RGB-D cameras to monitor patient motion in a medical Intensive Care Unit (ICU). The algorithms in DECU estimate pose direction at different temporal resolutions and use keyframes to efficiently represent pose transition dynamics. DECU combines deep features computed from the data with a modified version of Hidden Markov Model to more flexibly model sleep pose duration, analyze pose patterns, and summarize patient motion. Extensive experimental results are presented. The performance of DECU is evaluated in ideal (BC: Bright and Clear/occlusion-free) and natural (DO: Dark and Occluded) scenarios at two motion resolutions in a mock-up and a real ICU. The results indicate that deep features allow DECU to match the classification performance of engineered features in BC scenes and increase the accuracy by up to 8% in DO scenes. In addition, the overall pose history summarization tracing accuracy shows an average detection rate of 85% in BC and of 76% in DO scenes. The proposed keyframe estimation algorithm allows DECU to reach an average 78% transition classification accuracy.
A Temporal Tree Decomposition for Generating Temporal Graphs
Venue: arXiv cs.SI 2017
Year: 2017

Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. Recent work at the intersection of formal language theory and graph theory has found that a Hyperedge Replacement Grammar (HRG) can be extracted from a tree decomposition of any graph. This HRG can be used to generate new graphs that share properties that are similar to the original graph. Because the extracted HRG is directly dependent on the shape and contents of the of tree decomposition, it is unlikely that informative graph-processes are actually being captured with the extraction algorithm. To address this problem, the current work presents a new extraction algorithm called temporal HRG (tHRG) that learns HRG production rules from a temporal tree decomposition of the graph. We observe problems with the assumptions that are made in a temporal HRG model. In experiments on large real world networks, we show and provide reasoning as to why tHRG does not perform as well as HRG and other graph generators.
Information-Centric Wireless Networks with Mobile Edge Computing
Venue: arXiv cs.NI 2017
Year: 2017

In order to better accommodate the dramatically increasing demand for data caching and computing services, storage and computation capabilities should be endowed to some of the intermediate nodes within the network. In this paper, we design a novel virtualized heterogeneous networks framework aiming at enabling content caching and computing. With the virtualization of the whole system, the communication, computing and caching resources can be shared among all users associated with different virtual service providers. We formulate the virtual resource allocation strategy as a joint optimization problem, where the gains of not only virtualization but also caching and computing are taken into consideration in the proposed architecture. In addition, a distributed algorithm based on alternating direction method of multipliers is adopted to solve the formulated problem, in order to reduce the computational complexity and signaling overhead. Finally, extensive simulations are presented to show the effectiveness of the proposed scheme under different system parameters.
Analysis and Modeling of 3D Indoor Scenes
Venue: arXiv cs.GR 2017
Year: 2017

We live in a 3D world, performing activities and interacting with objects in the indoor environments everyday. Indoor scenes are the most familiar and essential environments in everyone's life. In the virtual world, 3D indoor scenes are also ubiquitous in 3D games and interior design. With the fast development of VR/AR devices and the emerging applications, the demand of realistic 3D indoor scenes keeps growing rapidly. Currently, designing detailed 3D indoor scenes requires proficient 3D designing and modeling skills and is often time-consuming. For novice users, creating realistic and complex 3D indoor scenes is even more difficult and challenging. Many efforts have been made in different research communities, e.g. computer graphics, vision and robotics, to capture, analyze and generate the 3D indoor data. This report mainly focuses on the recent research progress in graphics on geometry, structure and semantic analysis of 3D indoor data and different modeling techniques for creating plausible and realistic indoor scenes. We first review works on understanding and semantic modeling of scenes from captured 3D data of the real world. Then, we focus on the virtual scenes composed of 3D CAD models and study methods for 3D scene analysis and processing. After that, we survey various modeling paradigms for creating 3D indoor scenes and investigate human-centric scene analysis and modeling, which bridge indoor scene studies of graphics, vision and robotics. At last, we discuss open problems in indoor scene processing that might bring interests to graphics and all related communities.
Defining Equitable Geographic Districts in Road Networks via Stable Matching
Venue: arXiv cs.DS 2017
Year: 2017

We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling place, and all other network vertices must be labeled with the center to which they are associated. We focus on defining geographic districts that are equitable, in that every district has the same number of vertices and the assignment is stable in terms of geographic distance. That is, there is no unassigned vertex-center pair such that both would prefer each other over their current assignments. We solve this problem using a version of the classic stable matching problem, called symmetric stable matching, in which the preferences of the elements in both sets obey a certain symmetry. In our case, we study a graph-based version of stable matching in which nodes are stably matched to a subset of nodes denoted as centers, prioritized by their shortest-path distances, so that each center is apportioned a certain number of nodes. We show that, for a planar graph or road network with $n$ nodes and $k$ centers, the problem can be solved in $O(n\sqrt{n}\log n)$ time, which improves upon the $O(nk)$ runtime of using the classic Gale-Shapley stable matching algorithm when $k$ is large. Finally, we provide experimental results on road networks for these algorithms and a heuristic algorithm that performs better than the Gale-Shapley algorithm for any range of values of $k$.
Token Jumping in minor-closed classes
Venue: arXiv cs.CC 2017
Year: 2017

Given two $k$-independent sets $I$ and $J$ of a graph $G$, one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex of the current independent set by another while keeping the property of being independent. Deciding this problem, known as the Token Jumping (TJ) reconfiguration problem, is PSPACE-complete even on planar graphs. Ito et al. proved in 2014 that the problem is FPT parameterized by $k$ if the input graph is $K_{3,\ell}$-free. We prove that the result of Ito et al. can be extended to any $K_{\ell,\ell}$-free graphs. In other words, if $G$ is a $K_{\ell,\ell}$-free graph, then it is possible to decide in FPT-time if $I$ can be transformed into $J$. As a by product, the TJ-reconfiguration problem is FPT in many well-known classes of graphs such as any minor-free class.
Co-salient Object Detection Based on Deep Saliency Networks and Seed Propagation over an Integrated Graph
Venue: arXiv cs.CV 2017
Year: 2017

This paper presents a co-salient object detection method to find common salient regions in a set of images. We utilize deep saliency networks to transfer co-saliency prior knowledge and better capture high-level semantic information, and the resulting initial co-saliency maps are enhanced by seed propagation steps over an integrated graph. The deep saliency networks are trained in a supervised manner to avoid online weakly supervised learning and exploit them not only to extract high-level features but also to produce both intra- and inter-image saliency maps. Through a refinement step, the initial co-saliency maps can uniformly highlight co-salient regions and locate accurate object boundaries. To handle input image groups inconsistent in size, we propose to pool multi-regional descriptors including both within-segment and within-group information. In addition, the integrated multilayer graph is constructed to find the regions that the previous steps may not detect by seed propagation with low-level descriptors. In this work, we utilize the useful complementary components of high-, low-level information, and several learning-based steps. Our experiments have demonstrated that the proposed approach outperforms comparable co-saliency detection methods on widely used public databases and can also be directly applied to co-segmentation tasks.
Enhancing speaker identification performance under the shouted talking condition using second-order circular hidden Markov models
Venue: arXiv cs.SD 2017
Year: 2017

It is known that the performance of speaker identification systems is high under the neutral talking condition; however, the performance deteriorates under the shouted talking condition. In this paper, second-order circular hidden Markov models (CHMM2s) have been proposed and implemented to enhance the performance of isolated-word text-dependent speaker identification systems under the shouted talking condition. Our results show that CHMM2s significantly improve speaker identification performance under such a condition compared to the first-order left-to-right hidden Markov models (LTRHMM1s), second-order left-to-right hidden Markov models (LTRHMM2s), and the first-order circular hidden Markov models (CHMM1s). Under the shouted talking condition, our results show that the average speaker identification performance is 23% based on LTRHMM1s, 59% based on LTRHMM2s, and 60% based on CHMM1s. On the other hand, the average speaker identification performance under the same talking condition based on CHMM2s is 72%.
Iterative Spectral Clustering for Unsupervised Object Localization
Venue: arXiv cs.CV 2017
Year: 2017

This paper addresses the problem of unsupervised object localization in an image. Unlike previous supervised and weakly supervised algorithms that require bounding box or image level annotations for training classifiers in order to learn features representing the object, we propose a simple yet effective technique for localization using iterative spectral clustering. This iterative spectral clustering approach along with appropriate cluster selection strategy in each iteration naturally helps in searching of object region in the image. In order to estimate the final localization window, we group the proposals obtained from the iterative spectral clustering step based on the perceptual similarity, and average the coordinates of the proposals from the top scoring groups. We benchmark our algorithm on challenging datasets like Object Discovery and PASCAL VOC 2007, achieving an average CorLoc percentage of 51% and 35% respectively which is comparable to various other weakly supervised algorithms despite being completely unsupervised.
Improvement Of Email Threats Detection By User Training
Venue: arXiv cs.CR 2017
Year: 2017

With the generalization of mobile communication systems, solicitations of all kinds in the form of messages and emails are received by users with increasing proportion of malicious ones. They are customized to pass anti-spam filters and ask the person to click or to open the joined dangerous attachment. Current filters are very inefficient against spear phishing emails. It is proposed to improve the existing filters by taking advantage of user own analysis and feedback to detect all kinds of phishing emails. The method rests upon an interface displaying different warnings to receivers. Analysis shows that users trust their first impression and are often lead to ignore warnings flagged by proposed new interactive system.
Indoor UAV scheduling with Restful Task Assignment Algorithm
Venue: arXiv cs.AI 2017
Year: 2017

Research in UAV scheduling has obtained an emerging interest from scientists in the optimization field. When the scheduling itself has established a strong root since the 19th century, works on UAV scheduling in indoor environment has come forth in the latest decade. Several works on scheduling UAV operations in indoor (two and three dimensional) and outdoor environments are reported. In this paper, a further study on UAV scheduling in three dimensional indoor environment is investigated. Dealing with indoor environment\textemdash where humans, UAVs, and other elements or infrastructures are likely to coexist in the same space\textemdash draws attention towards the safety of the operations. In relation to the battery level, a preserved battery level leads to safer operations, promoting the UAV to have a decent remaining power level. A methodology which consists of a heuristic approach based on Restful Task Assignment Algorithm, incorporated with Particle Swarm Optimization Algorithm, is proposed. The motivation is to preserve the battery level throughout the operations, which promotes less possibility in having failed UAVs on duty. This methodology is tested with 54 benchmark datasets stressing on 4 different aspects: geographical distance, number of tasks, number of predecessors, and slack time. The test results and their characteristics in regard to the proposed methodology are discussed and presented.
Using Second-Order Hidden Markov Model to Improve Speaker Identification Recognition Performance under Neutral Condition
Venue: arXiv cs.SD 2017
Year: 2017

In this paper, second-order hidden Markov model (HMM2) has been used and implemented to improve the recognition performance of text-dependent speaker identification systems under neutral talking condition. Our results show that HMM2 improves the recognition performance under neutral talking condition compared to the first-order hidden Markov model (HMM1). The recognition performance has been improved by 9%.
Multi-tap Digital Canceller for Full-Duplex Applications
Venue: arXiv cs.IT 2017
Year: 2017

We identify phase noise as a bottleneck for the performance of digital self-interference cancellers that utilize a single auxiliary receiver---single-tap digital cancellers---and operate in multipath propagation environments. Our analysis demonstrates that the degradation due to phase noise is caused by a mismatch between the analog delay of the auxiliary receiver and the different delays of the multipath components of the self-interference signal. We propose a novel multi-tap digital self-interference canceller architecture that is based on multiple auxiliary receivers and a customized Normalized-Least-Mean-Squared (NLMS) filtering for self-interference regeneration. Our simulation results demonstrate that our proposed architecture is more robust to phase noise impairments and can in some cases achieve 10~dB larger self-interference cancellation than the single-tap architecture.
A Survey of Security Assessment Ontologies
Venue: arXiv cs.SE 2017
Year: 2017

A literature survey on ontologies concerning the Security Assessment domain has been carried out to uncover initiatives that aim at formalizing concepts from the Security Assessment field of research. A preliminary analysis and a discussion on the selected works are presented. Our main contribution is an updated literature review, describing key characteristics, results, research issues, and application domains of the papers. We have also detected gaps in the Security Assessment literature that could be the subject of further studies in the field. This work is meant to be useful for security researchers who wish to adopt a formal approach in their methods.
Application Protocols enabling Internet of Remote Things via Random Access Satellite Channels
Venue: arXiv cs.NI 2017
Year: 2017

Nowadays, Machine-to-Machine (M2M) and Internet of Things (IoT) traffic rate is increasing at a fast pace. The use of satellites is expected to play a large role in delivering such a traffic. In this work, we investigate the use of two of the most common M2M/IoT protocols stacks on a satellite Random Access (RA) channel, based on DVB-RCS2 standard. The metric under consideration is the completion time, in order to identify the protocol stack that can provide the best performance level.
Topology-Preserving Off-screen Visualization: Effects of Projection Strategy and Intrusion Adaption
Venue: arXiv cs.HC 2017
Year: 2017

With the increasing amount of data being visualized in large information spaces, methods providing data-driven context have become indispensable. Off-screen visualization techniques, therefore, have been extensively researched for their ability to overcome the inherent trade-off between overview and detail. The general idea is to project off-screen located objects back to the available screen real estate. Detached visual cues, such as halos or arrows, encode information on position and distance, but fall short showing the topology of off-screen objects. For that reason, state of the art techniques integrate visual cues into a dedicated border region. As yet, the dimensions of the navigated space are not reflected properly, which is why we propose to adapt the intrusion of the border pursuant to the position in space. Moreover, off-screen objects are projected to the border region using one out of two projection methods: Radial or Orthographic. We describe a controlled experiment to investigate the effect of the adaptive border intrusion to the topology as well as the users' intuition regarding the projection strategy. The results of our experiment suggest to use the orthographic projection strategy for unconnected point data in an adaptive border design. We further discuss the results including the given informal feedback of participants.
What's Mine is Yours: Pretrained CNNs for Limited Training Sonar ATR
Venue: arXiv cs.CV 2017
Year: 2017

Finding mines in Sonar imagery is a significant problem with a great deal of relevance for seafaring military and commercial endeavors. Unfortunately, the lack of enormous Sonar image data sets has prevented automatic target recognition (ATR) algorithms from some of the same advances seen in other computer vision fields. Namely, the boom in convolutional neural nets (CNNs) which have been able to achieve incredible results - even surpassing human actors - has not been an easily feasible route for many practitioners of Sonar ATR. We demonstrate the power of one avenue to incorporating CNNs into Sonar ATR: transfer learning. We first show how well a straightforward, flexible CNN feature-extraction strategy can be used to obtain impressive if not state-of-the-art results. Secondly, we propose a way to utilize the powerful transfer learning approach towards multiple instance target detection and identification within a provided synthetic aperture Sonar data set.
User Activity Detection in Massive Random Access: Compressed Sensing vs. Coded Slotted ALOHA
Venue: arXiv cs.IT 2017
Year: 2017

Machine-type communication services in mobile cel- lular systems are currently evolving with an aim to efficiently address a massive-scale user access to the system. One of the key problems in this respect is to efficiently identify active users in order to allocate them resources for the subsequent transmissions. In this paper, we examine two recently suggested approaches for user activity detection: compressed-sensing (CS) and coded slotted ALOHA (CSA), and provide their comparison in terms of performance vs resource utilization. Our preliminary results show that CS-based approach is able to provide the target user activity detection performance with less overall system resource utilization. However, this comes at a price of lower energy- efficiency per user, as compared to CSA-based approach.
A Pseudo-Bayesian Approach to Sign-Compute-Resolve Slotted ALOHA
Venue: arXiv cs.IT 2017
Year: 2017

Access reservation based on slotted ALOHA is commonly used in wireless cellular access. In this paper we investigate its enhancement based on the use of physical-layer network coding and signature coding, whose main feature is enabling simultaneous resolution of up to K users contending for access, where K >= 1. We optimise the slot access probability such that the expected throughput is maximised. In particular, the slot access probability is chosen in line with an estimate of the number of users in the system that is obtained relying on the pseudo-Bayesian approach by Rivest, which we generalise for the case that K > 1. Under the assumption that this estimate reflects the actual number of users, we show that our approach achieves throughput 1 in the limit of large K.