Journal of Information Science and Engineering
Institute of Information Science
About: Journal of Information Science and Engineering is an academic journal published by Institute of Information Science. The journal publishes majorly in the area(s): Computer science & Wireless sensor network. It has an ISSN identifier of 1016-2364. Over the lifetime, 2197 publications have been published receiving 17270 citations.
Topics: Computer science, Wireless sensor network, Wireless network, Cluster analysis, Mobile computing
Papers published on a yearly basis
TL;DR: A faster version of Otsu's method for improving the efficiency of computation for the optimal thresholds of an image by determining the modified between-class variance by accessing a look-up table is quicker than that by performing mathematical arithmetic operations.
Abstract: Otsu reference proposed a criterion for maximizing the between-class variance of pixel intensity to perform picture thresholding. However, Otsu's method for image segmentation is very time-consuming because of the inefficient formulation of the be- tween-class variance. In this paper, a faster version of Otsu's method is proposed for improving the efficiency of computation for the optimal thresholds of an image. First, a criterion for maximizing a modified between-class variance that is equivalent to the criterion of maximizing the usual between-class variance is proposed for image segmen- tation. Next, in accordance with the new criterion, a recursive algorithm is designed to efficiently find the optimal threshold. This procedure yields the same set of thresholds as the original method. In addition, the modified between-class variance can be pre-computed and stored in a look-up table. Our analysis of the new criterion clearly shows that it takes less computation to compute both the cumulative probability (zeroth order moment) and the mean (first order moment) of a class, and that determining the modified between-class variance by accessing a look-up table is quicker than that by performing mathematical arithmetic operations. For example, the experimental results of a five-level threshold selection show that our proposed method can reduce down the processing time from more than one hour by the conventional Otsu's method to less than 107 seconds.
TL;DR: The results show that the fraction of decodable frames reflects well the behavior of the PSNR metric, while being less time-consuming, and can be an alternative metric to objectively assess through simulations the delivery quality of transmission in a network of publicly available video trace files.
Abstract: We present a novel and complete tool-set for evaluating the delivery quality of MPEG video transmissions in simulations of a network environment. This tool-set is based on the EvalVid framework. We extend the connecting interfaces of EvalVid to replace its simple error simulation model by a more general network simulator like NS2. With this combination, researchers and practitioners in general can analyze through simulation the performance of real video streams, i.e. taking into account the video semantics, under a large range of network scenarios. To demonstrate the usefulness of our new tool-set, we point out that it enables the investigation of the relationship between two popular objective metrics for Quality of Service (QoS) assessment of video quality delivery: the PSNR (Peak Signal to Noise Ratio) and the fraction of decodable frames. The results show that the fraction of decodable frames reflects well the behavior of the PSNR metric, while being less time-consuming. Therefore, the fraction of decodable frames can be an alternative metric to objectively assess through simulations the delivery quality of transmission in a network of publicly available video trace files.
TL;DR: A parallel version of the particle swarm optimization (PPSO) algorithm together with three communication strategies which can be used according to the independence of the data, which demonstrates the usefulness of the proposed PPSO algorithm.
Abstract: Particle swarm optimization (PSO) is an alternative population-based evolutionary computation technique. It has been shown to be capable of optimizing hard mathematical problems in continuous or binary space. We present here a parallel version of the particle swarm optimization (PPSO) algorithm together with three communication strategies which can be used according to the independence of the data. The first strategy is designed for solution parameters that are independent or are only loosely correlated, such as the Rosenbrock and Rastrigrin functions. The second communication strategy can be applied to parameters that are more strongly correlated such as the Griewank function. In cases where the properties of the parameters are unknown, a third hybrid communication strategy can be used. Experimental results demonstrate the usefulness of the proposed PPSO algorithm.
TL;DR: It is observed that carry-and-forward is the new and key consideration for designing all routing protocols in VANETs, and min-delay and delay-bounded routing protocols for VANets are discussed.
Abstract: Vehicular Ad hoc Network (VANET), a subclass of mobile ad hoc networks (MANETs), is a promising approach for the intelligent transportation system (ITS). The design of routing protocols in VANETs is important and necessary issue for support the smart ITS. The key difference of VANET and MANET is the special mobility pattern and rapidly changeable topology. It is not effectively applied the existing routing protocols of MANETs into VANETs. In this investigation, we mainly survey new routing results in VANET. We introduce unicast protocol, multicast protocol, geocast protocol, mobicast protocol, and broadcast protocol. It is observed that carry-and-forward is the new and key consideration for designing all routing protocols in VANETs. With the consideration of multi-hop forwarding and carry-and-forward techniques, min-delay and delay-bounded routing protocols for VANETs are discussed in VANETs. Besides, the temporary network fragmentation problem and the broadcast storm problem are further considered for designing routing protocols in VANETs. The temporary network fragmentation problem caused by rapidly changeable topology influence on the performance of data transmissions. The broadcast storm problem seriously affects the successful rate of message delivery in VANETs. The key challenge is to overcome these problems to provide routing protocols with the low communication delay, the low communication overhead, and the low time complexity. The challenges and perspectives of routing protocols for VANETs are finally discussed.
TL;DR: An adaptive traffic control system based on a new traffic infrastructure using Wireless Sensor Network (WSN) and using new techniques for controlling the traffic flow sequences, which is dynamically adaptive to traffic conditions on both single and multiple intersections.
Abstract: Vehicular traffic is continuously increasing around the world, especially in large urban areas. The resulting congestion has become a major concern to transportation specialists and decision makers. The existing methods for traffic management, surveillance and control are not adequately efficient in terms of performance, cost, maintenance, and support. In this paper, the design of a system that utilizes and efficiently manages traffic light controllers is presented. In particular, we present an adaptive traffic control systembased on a new traffic infrastructure using Wireless Sensor Network (WSN) and using new techniques for controlling the traffic flow sequences. These techniques are dynamically adaptive to traffic conditions on both single and multiple intersections. A WSN is used as a tool to instrument and control traffic signals roadways, while an intelligent traffic controller is developed to control the operation of the traffic infrastructure supported by the WSN. The controller embodies traffic system communication algorithm (TSCA) and the traffic signals time manipulation algorithm (TSTMA). Both algorithms are able to provide the system with adaptive and efficient traffic estimation represented by the dynamic change in the traffic signals' flow sequence and traffic variation. Simulation results show the efficiency of the proposed scheme in solving traffic congestion in terms of the average waiting time and average queue length on the isolated (single) intersection and efficient global traffic flow control on multiple intersections. A test bed was also developed and deployed for real measurements. The paper concludes with some future highlights and useful remarks.