This paper presents a new near lossless compression algorithm for hyperspectral images based on distributed source coding. The algorithm is performed on blocks that have the same location and size in each band. Becaus...
详细信息
This paper presents a new near lossless compression algorithm for hyperspectral images based on distributed source coding. The algorithm is performed on blocks that have the same location and size in each band. Because the importance varies from block to block along the spectral orientation, an adaptive rate allocation algorithm that weights the energy of each block under the target rate constraints is introduced. A simple linear prediction model is employed to construct the side information of each block for Slepian-Wolf coding. The relationship between the quantized step size and the allocated rate of each block is determined under the condition of correct reconstruction with the side information at the Slepian-Wolf decoder. Slepian-Wolf coding is performed on the quantized version of each block. Experimental results show that the performance of the proposed algorithm is competitive with that of state-of-the-art compression algorithms, making it appropriate for on-board compression. (C) 2014 Elsevier Ltd. All rights reserved.
In order to model emergency rescue location problem with uncertain rescue time, an uncertain expected cost minimization model is proposed under uncertain environment. For solving this model, we convert the uncertain m...
详细信息
In order to model emergency rescue location problem with uncertain rescue time, an uncertain expected cost minimization model is proposed under uncertain environment. For solving this model, we convert the uncertain model to its equivalent deterministic form. Finally, a numerical example has been presented to illustrate the model. The computational results which were solved by the down mountain algorithm are provided to demonstrate the effectiveness of the model.
A double evolutionary pool memetic algorithm is proposed to solve the examination timetabling problem. To improve the performance of the proposed algorithm, two evolutionary pools, that is, the main evolutionary pool ...
详细信息
A double evolutionary pool memetic algorithm is proposed to solve the examination timetabling problem. To improve the performance of the proposed algorithm, two evolutionary pools, that is, the main evolutionary pool and the secondary evolutionary pool, are employed. The genetic operators have been specially designed to fit the examination timetabling problem. A simplified version of the simulated annealing strategy is designed to speed the convergence of the algorithm. A clonal mechanism is introduced to preserve population diversity. Extensive experiments carried out on 12 benchmark examination timetabling instances show that the proposed algorithm is able to produce promising results for the uncapacitated examination timetabling problem.
A new approach regarding real-time low-level image and signal processing is presented. This new approach deals with the philosophy of finding a method for designing and executing algorithms (filters), using the most m...
详细信息
A new approach regarding real-time low-level image and signal processing is presented. This new approach deals with the philosophy of finding a method for designing and executing algorithms (filters), using the most minimum possible complexity. The proposed method is based on a special formation of coordinate logic filters (CLFs), the coordinate logic order statistics (CL-OS) filters. CL-OS introduces a minimalistic approach in filter design followed by the greatest possible efficiency in terms of speed, quality, complexity and energy consumption. Moreover CL-OS reveals new signal information;this information gives a different interpretation of the original signal, it could be said that it acts like a function applying a nonlinear quantisation in order to approximate the desired output.
We present an image denoising method using the edge map of an image. The denoised image is considered as a linear combination of the observed image and its average value, where the coefficients are controlled by a loc...
详细信息
We present an image denoising method using the edge map of an image. The denoised image is considered as a linear combination of the observed image and its average value, where the coefficients are controlled by a local edge detector. The parameters are set on suitable values related to noise energy computed by the curvature norm of the original image. Implementation can be done in a single iteration and the speed of the process is reasonably high. Noise reduction quality of the introduced method is compared with Wiener and Total Variation based filters for some images. The method appears to be easy, fast and useful for very noisy images. The differences between our method and the patent 6229578 "Edge Detection Based Noise Removal Algorithm" are explained. (C) 2013 Elsevier Ltd. All rights reserved.
The critical external pressure stability calculation of stiffened penstock in the hydroelectric power station is very important work for penstock design. At present, different assumptions and boundary simplification a...
详细信息
The critical external pressure stability calculation of stiffened penstock in the hydroelectric power station is very important work for penstock design. At present, different assumptions and boundary simplification are adopted by different calculation methods which sometimes cause huge differences too. In this paper, we present an immune based artificial neural network model via the model and stability theory of elastic ring, we study effects of some factors (such as pipe diameter, pipe wall thickness, sectional size of stiffening ring, and spacing between stiffening rings) on penstock critical external pressure during huge thin-wall procedure of penstock. The results reveal that the variation of diameter and wall thickness can lead to sharp variation of penstock external pressure bearing capacity and then give the change interval of it. This paper presents an optimizing design method to optimize sectional size and spacing of stiffening rings and to determine penstock bearing capacity coordinate with the bearing capacity of stiffening rings and penstock external pressure stability coordinate with its strength safety. As a practical example, the simulation results illustrate that the method presented in this paper is available and can efficiently overcome inherent defects of BP neural network.
In path planning problems, the most important task is to find a suitable collision-free path which satisfies some certain criteria ( the shortest path length, security, feasibility, smoothness, and so on), so defining...
详细信息
In path planning problems, the most important task is to find a suitable collision-free path which satisfies some certain criteria ( the shortest path length, security, feasibility, smoothness, and so on), so defining a suitable curve to describe path is essential. Three different commonly used curves are compared and discussed based on their performance on solving a set of path planning problems. Dynamic multiswarm particle swarm optimizer is employed to optimize the necessary parameters for these curves. The results show that Bezier curve is the most suitable curve for producing path for the certain path planning problems discussed in this paper. Safety criterion is considered as a constrained condition. A new constraint handling method is proposed and compared with other two constraint handling methods. The results show that the new method has a better characteristic to improve the performance of algorithm.
Peer-to-peer (P2P) file distribution imposes increasingly heavy traffic burden on the Internet service providers (ISPs). The vast volume of traffic pushes up ISPs' costs in routing and investment and degrades thei...
详细信息
Peer-to-peer (P2P) file distribution imposes increasingly heavy traffic burden on the Internet service providers (ISPs). The vast volume of traffic pushes up ISPs' costs in routing and investment and degrades their networks performance. Building ISP-friendly P2P is therefore of critical importance for ISPs and P2P services. So far most efforts in this area focused on improving the locality-awareness of P2P applications, for example, to construct overlay networks with better knowledge of the underlying network topology. There is, however, growing recognition that data scheduling algorithms also play an effective role in P2P traffic reduction. In this paper, we introduce the advanced locality-aware network coding (ALANC) for P2P file distribution. This data scheduling algorithm completely avoids the transmission of linearly dependent data blocks, which is a notable problem of previous network coding algorithms. Our simulation results show that, in comparison to other algorithms, ALANC not only significantly reduces interdomain P2P traffic, but also remarkably improves both the application-level performance (for P2P services) and the network-level performance (for ISP networks). For example, ALANC is 30% faster in distributing data blocks and it reduces the average traffic load on the underlying links by 40%. We show that ALANC holds the above gains when the tit-for-tat incentive mechanism is introduced or the overlay topology changes dynamically.
The consensus tracking problem for discrete-time multiagent systems with input and communication delays is studied. A sufficient condition is obtained over a directed graph based on the frequency-domain analysis. Furt...
详细信息
The consensus tracking problem for discrete-time multiagent systems with input and communication delays is studied. A sufficient condition is obtained over a directed graph based on the frequency-domain analysis. Furthermore, a fast decentralized consensus tracking conditions based on increment PID algorithm are discussed for improving convergence speed of the multiagent systems. Based on this result, genetic algorithm is introduced to construct increment PID based on genetic algorithm for obtaining optimization consensus tracking performance. Finally, a numerable example is given to compare convergence speed of three tracking algorithms in the same condition. Simulation results show the effectiveness of the proposed algorithm.
In this article, forced convection in the entrance region of an eccentric curved annulus is studied numerically using a second order finite difference method based on the projection algorithm to discretize the governi...
详细信息
In this article, forced convection in the entrance region of an eccentric curved annulus is studied numerically using a second order finite difference method based on the projection algorithm to discretize the governing equations. To do so, the continuity, full Navier-Stokes, and energy equations are written in the bipolar-toroidal coordinate system, which enables to employ a uniform grid for discretization. Four different thermal boundary conditions are considered to study the effects of different nondimensional governing parameters such as curvature ratio, eccentricity, Dean number, and Prandtl number on the temperature field, heat transfer rate, and thermal entrance length in detail. The numerical results obtained indicate that, in some cases, the eccentricity intensifies the heat transfer rate in an eccentric curved pipe compared to the corresponding concentric curved.
暂无评论