Node localization is a fundamental problem in wireless sensor network. There are many existing algorithms to estimate the locations of the nodes. However, most of the methods did not consider the presence of obstacles. In practice, obstacles will lead to blockage and reflection of communication signals between sensor nodes. Therefore, the presence of obstacles will greatly affect the localizati...

In this paper, we propose a Two-Stream Bidirectional Long Short-Term Memory (TS-BLSTM) for the task of mitosis event detection and stage localization in time-lapse phase contrast microscopy image sequences. Our method consists of two steps. First, we extract candidate mitosis image sequences. Then, we solve the problem of mitosis event detection and stage localization jointly by the proposed TS...

We propose a new approach to the simultaneous cooperative localization of a very large group of simple robots capable of performing deadreckoning and sensing the relative position of nearby robots. In the last decade, the use of distributed optimal Kalman filters (KF) to address this problem has been studied extensively. In this paper, we propose to use a very simple encounter based averaging p...

We propose a new approach to the simultaneous cooperative localization of a very large group of simple robots capable of performing deadreckoning and sensing the relative position of nearby robots. In the last decade, the use of distributed optimal Kalman filters (KF) to address this problem has been studied extensively. In this paper, we propose to use a very simple encounter based averaging p...

We examine methods to estimate the average and variance of test error rates over a set of classi ers We begin with the process of drawing a classi er at random for each example Given validation data the average test error rate can be estimated as if validating a single classi er Given the test example inputs the variance can be computed exactly Next we consider the process of drawing a classi e...

rapid expansions of new location-based services signify the need for finding accurate localization techniques for indoor environments. among different techniques, rss-based  schemes and in particular oneof its variants which is based on graph-based semi-supervised learning (g-ssl) are widely-used approaches the superiority of this scheme is that it has low setup/training cost and at the same ti...

Existing localization approaches are divided into two groups: range-based and range-free. The range-free schemes often suffer from poor accuracy and low scalability, while the range-based localization approaches heavily depend on extra hardware capabilities or rely on the absolute RSSI values, far from practical. In this paper, an improved localization algorithm based on RSSI of wireless sensor...

Abstract With the advancement of sensor technologies, Wireless Sensor Networks (WSN) are envisioning a rich variety promising services in many fields. WSN is formed by deployment nodes regions interest using deterministic or random strategy. The strategy more suitable large monitoring areas and harsh environments. But, this type deployment, coverage holes disconnected networks can exist. Import...

Network localization is capable of providing accurate and ubiquitous position information for numerous wireless applications. This paper studies the accuracy cooperative network in large-scale networks. Based on a decomposition equivalent Fisher matrix (EFIM), we develop random-walk-inspired approach analysis EFIM, propose routing interpretation localization. Using this approach, show that larg...

Localization is an important research issue in Wireless Sensor Networks (WSNs). Though Global Positioning System (GPS) can be used to locate the position of the sensors, unfortunately it is limited to outdoor applications and is costly and power consuming. In order to find location of sensor nodes without help of GPS, collaboration among nodes is highly essential so that localization can be acc...