Energy minimization is often the key point of solving problems in computer *** decades,many methods have been proposed(deterministic,stochastic,…).Some can only reach local minimum and others strong local minimum clo...
详细信息
ISBN:
(纸本)9781424467860
Energy minimization is often the key point of solving problems in computer *** decades,many methods have been proposed(deterministic,stochastic,…).Some can only reach local minimum and others strong local minimum close to the optimal solution(global minimum).Since beginning of 21th century,minimization based on Graph theory have been generalized to find global minimum of multi-labeling problems. In this work,we study deterministic local minimization methods (Iterative Conditional Modes and Direct Descent Energy),and a stochastic global minimization with an improved Simulated Annealing algorithm.A new approach formulation to help local minimization to converge to a minimum closed to the global one is *** method combines local and global energy constraints in an multiresolution *** focus on stereo matching *** improved Simulated Annealing proved to reach global minimum as good as Graph based minimization methods. Promising results of proposed local minimization methods are obtained on Middlebury Stereo database compare to global methods.
With the rapid development of cloud computing technologies, cloud gaming has gained wide attention from the industrial field. By executing the gaming software on the cloud and transiting the rendered game scenes back ...
详细信息
ISBN:
(纸本)9781509034840
With the rapid development of cloud computing technologies, cloud gaming has gained wide attention from the industrial field. By executing the gaming software on the cloud and transiting the rendered game scenes back to the client, game players can play games anywhere on any device. However, the centralized architecture of existing cloud gaming platforms causes serious network latency, which deteriorates user experience significantly. To reduce network latency and relieve the workload on the mobile client, we propose and implement a cloudlet-based mobile cloud gaining system design. By deploying the cloudlets in the nearby region of mobile users, we can provide computational resources to the mobile clients and complete tasks such as gaming state maintenance, game scene rendering, etc. The system can also reduce the gaming latency and the workload on the client greatly. We use the open-source cloud computing software to build a cloudlet system and develop an Android based cloud gaming client, which can receive and display gaming video streams, and map and upload the game operations. Finally, we conduct experimental evaluation of our mobile cloud gaming prototype. The results show that our proposed solution can significantly reduce the fraction of network latency.
Offloading computation-intensive tasks from mobile to nearby resource-rich surrogates, called edge servers, is proposed recently because traditional mobile cloud computing has a bottleneck of bandwidth and resource li...
详细信息
ISBN:
(纸本)9781538676721
Offloading computation-intensive tasks from mobile to nearby resource-rich surrogates, called edge servers, is proposed recently because traditional mobile cloud computing has a bottleneck of bandwidth and resource limitation for devices. The primary performance concern of offloading is how to maximize energy saving under task delay and task dependency limitation. Besides, edge servers that mobile perceived are changeable and heterogeneous in the process of offloading. In this paper, we formalize this problem, reduce it into knapsack problem and propose a task scheduling scheme, named TaSRD, including independent sub-task scheduling for tasks without dependencies and dependent sub-task scheduling for dependent tasks. We implement TaSRD and evaluate it by case study and simulation on CloudSim framework developed by Melbourne University. We use time model and energy model to measure results and recommend suitable parameters for TaSRD. The experimental results demonstrate that TaSRD can effectively save energy and reduce makespan for mobile while offloading tasks to edge servers.
The task assignment problem for multiple vessels cooperative driving is the key problem of the multiple vessels cooperative control. Due to the system showing multi-objective, multi-tasking and multi-constrained featu...
详细信息
ISBN:
(纸本)9781538619797;9781538619780
The task assignment problem for multiple vessels cooperative driving is the key problem of the multiple vessels cooperative control. Due to the system showing multi-objective, multi-tasking and multi-constrained features, a cooperative multi-task assignment model is proposed, which can transform multiple constraints task assignment problem into multiple constraints optimization problem based on the multiple vessels task assignment cost function. This method optimizes the results of task assignment by using genetic ant colony hybrid algorithm to search optimization solution globally. In the simulation experiment, it is compared with the genetic algorithm and the ant colony algorithm alone, and experimental results show that the method can optimize task assignment on the basis of satisfying these constraints.
With the flourishing development of construction and real estate industry, engineering accidents happen more frequently. The purpose of this paper is to generate emergency case as quick as possible so as to improve th...
详细信息
Hyperspectral image(HSI) is often contaminated by mixed noise in the acquisition process. In this paper,a hyperspectral image low-rank restoration method based spectral-spatial total variation(LRSSTV) is proposed....
详细信息
ISBN:
(纸本)9781538619797;9781538619780
Hyperspectral image(HSI) is often contaminated by mixed noise in the acquisition process. In this paper,a hyperspectral image low-rank restoration method based spectral-spatial total variation(LRSSTV) is proposed. The spectral high correlation is exploited by low-rank representation and the sparse noise is represented by the l-norm. Furthermore,to remove the Gaussian noise and enhance the edge information,spectral-spatial adaptive total variation prior knowledge is utilized. Both simulated and real-world data experimental results show that the proposed method can work well in detail preservation and noise removal.
Recently, brain-computer interface has been applied to many fields such as steady-state visual evoked potential(SSVEP). However, in the conventional method, the frequency resolution is low due to the dependence of the...
详细信息
ISBN:
(纸本)9781538619797;9781538619780
Recently, brain-computer interface has been applied to many fields such as steady-state visual evoked potential(SSVEP). However, in the conventional method, the frequency resolution is low due to the dependence of the short-time Fourier transform on the analysis window length. Therefore, it is not possible to analyze a non-integer multiple signal, as a side-lobe will occur. We verified the precision of non-harmonics analysis,and proposed and attempted to analyze the change and stimulus of SSVEP. We found the frequency resolution to be improved exponentially.
In this paper, we propose an online visual tracking algorithm for fused sequences via deep learning and adaptive Particle filter(PF). Our algorithm pretrains a simplified Convolution Neural Network(CNN) to obtain a ge...
详细信息
ISBN:
(纸本)9781538619797;9781538619780
In this paper, we propose an online visual tracking algorithm for fused sequences via deep learning and adaptive Particle filter(PF). Our algorithm pretrains a simplified Convolution Neural Network(CNN) to obtain a generic target representation. The outputs from the hidden layers of the network help to form the tracking model for an online PF. During tracking, the moving information guides the distribution of particle samples. The tests illustrate competitive performance compared to the state of-art tracking algorithms especially when the target or camera moves quickly.
This paper proposed a tracking algorithm based on sparse coding and spectral residual saliency under the framework of particle filtering. The proposed algorithm can be divided into three parts. Firstly, spectral resid...
详细信息
ISBN:
(纸本)9781538619797;9781538619780
This paper proposed a tracking algorithm based on sparse coding and spectral residual saliency under the framework of particle filtering. The proposed algorithm can be divided into three parts. Firstly, spectral residual is used to calculate a saliency map of the current frame and then compute the saliency score of each particle. Secondly, several particles are eliminated directly based on the differences between the saliency scores of the particles in the current frame and the target score in the prior frame. Thirdly, Sc SPM is used to compute the observation vector for the rest particles and the tracking task is finished in the framework of particle filtering. Both quantitative and qualitative experimental results demonstrate that the proposed algorithm performs favorably against the nine state-ofthe-art trackers on ten challenging test sequences.
The Distributed Coordination Function (DCF) in the ieee 802.11 protocol is a random access scheme based on the carrier sense multiple access with collision avoidance (CSMA/CA). In recent years, there have been numerou...
详细信息
暂无评论