Super resolution reconstruction of video image is a research hotspot in the field of image processing, and it is widely used in video surveillance, image processing, criminal analysis and other fields. Super resolutio...
详细信息
Super resolution reconstruction of video image is a research hotspot in the field of image processing, and it is widely used in video surveillance, image processing, criminal analysis and other fields. Super resolution image reconstruction can reconstruct a high resolution image from low resolution images, and this technology has become a research hotspot in the field of image processing. In recent years, deep learning has been developed rapidly in the field of multimedia processing, and image super resolution restoration technology based on deep learning has gradually become the mainstream technology. In view of the existing image super-resolutiona* algorithm problems, such as more parameters, larger amount of calculation, longer training time, blurred image texture, we use the deep self-coding learning method to improve it. We analyze the advantages and disadvantages of the existing technology from the network type, network structure, training methods and so on, and sort out the development of the technology. The experimental results show that the improved network model achieves better super-resolution results, and the subjective visual effect and objective evaluation index are improved obviously, and the image sharpness and edge sharpness are improved obviously.
We present ana* algorithm for the creation and relaxation of large, dense or diluted homogeneous many particle systems made of wormlike, finite extendable, semiflexible multibead chains and - optionally - solvent, parti...
详细信息
We present ana* algorithm for the creation and relaxation of large, dense or diluted homogeneous many particle systems made of wormlike, finite extendable, semiflexible multibead chains and - optionally - solvent, particles, which repulse each other. The key feature is its efficiency, its output has been proven to serve as an excellent basis for any subsequent off-lattice computer simulation. The application allows us to choose (i) the bead number density or packing fraction, temperature, chain length, system size;concentration, (ii) the interaction potentials, hence the local features such as bond length and bending rigidity of the chains, and (iii) the degree of pre-relaxation, parametrized and expressed through a minimum intermolecular distance. The monodisperse polymers are represented by chains of monomer coordinates in 3D space. During the dynamical two-step process of sample creation the initially (Monte Carlo step 1) predicted global characteristics of the molecular conformations remain as unaffected as possible (during molecular dynamics step 2) and the potential energy and the entropy production are relaxing towards their minima. The potentials, the distribution of bond lengths, the integration time step and temperature are smoothly controlled during the creation/relaxation process until they finally approach their prescribed or physical values. The quality of thea* algorithm is by its nature independent of concentration, system size or degree of polymerization;the computational speed is quite independent of the latter quantity and linear in the system size. Chains tethered to a surface (dry polymer brushes) can be generated;as well. We provide a benchmark table. (C) 1999 Elsevier Science B.V.
This paper briefly surveys the recent progress on visual perceptiona* algorithms and their corresponding hardware implementations for the emerging application of autonomous driving. In particular, vehicle and pedestrian...
详细信息
This paper briefly surveys the recent progress on visual perceptiona* algorithms and their corresponding hardware implementations for the emerging application of autonomous driving. In particular, vehicle and pedestrian detection, lane detection and drivable surface detection are presented as three important applications for visual perception. On the other hand, CPU, GPU, FPGA and ASIC are discussed as the major components to form an efficient hardware platform for real-time operation. Finally, several technical challenges are presented to motivate future research and development in the field.
Manufacturing scheduling improvement heuristics iterate over trial schedules to determine a satisfactory schedule. During each iteration, a performance measure (e.g. makespan) is calculated. The paper presents an effi...
详细信息
Manufacturing scheduling improvement heuristics iterate over trial schedules to determine a satisfactory schedule. During each iteration, a performance measure (e.g. makespan) is calculated. The paper presents an efficienta* algorithm, Structural Perturbationa* algorithm (SPA), that accelerates the calculation of the makespan. This means all scheduling improvement heuristics using SPA to calculate makespan for each trial schedule will run faster. To achieve this goal, the manufacturing system is modelled by a Directed Acyclic Graph (DAG). Schedule trials can be described as a perturbed DAG where multiple edges are added and deleted. The major contribution of this research is that SPA can handle multiple edge deletions/additions with a single pass which makes it more efficient in terms of time complexity than current approaches. SPA accomplishes this by partitioning the nodes into three regions based on the locations of the added and deleted edges. Then, SPA updates the length of the affected nodes in each region. The application of SPA is not limited to the scheduling problem. The SPA can be applied in other fields as long as the problem can be described as a Perturbed DAG.
The shortest path computation between two given locations in a road network is an important problem that finds applications in a wide range of fields. There has been a lot of research efforts targeting at the precisen...
详细信息
ISBN:
(纸本)9781467384124
The shortest path computation between two given locations in a road network is an important problem that finds applications in a wide range of fields. There has been a lot of research efforts targeting at the preciseness and performance of finding shortest paths in road networks. However, rarely of them have really taken into account the influence of traffic factors such as traffic lights, road conditions, traffic jams and turning cost. In other words, existing approaches are rather purely based on the topology of the network, but forgot that there are multiple factors in a real road network that impact the accuracy of thea* algorithm. The contribution of our paper is twofold. First, we present a generic two-layered framework for moving objects in road networks environment and demonstrate the important role of traffic factors on path finding and route planning. Second, we develop an efficient parallel shortest patha* algorithm in road networks with the consideration of traffic influence factors. Detailed analysis presented shows that our parallel TRAFFic-aware shortest patha* algorithm (Trafforithm), is accurate and practical.
The change of the strain energy density in the different crystal planes of the cubical γ' phase occurs during creep at high temperature,and the cubical γ' phase in the alloy is directionally grown along the ...
详细信息
The change of the strain energy density in the different crystal planes of the cubical γ' phase occurs during creep at high temperature,and the cubical γ' phase in the alloy is directionally grown along the crystal plane with bigger strain ***,the change of the atomic potential energy,interfacial energy and lattice misfit stress is thought to be the driving force for promoting the elements diffusion and directional coarsening of γ' *** of the finite element formula for determining the use of traditional methods is not good,this innovative combination of the advantages of genetica* algorithm to determine coefficients,and then using the finite element simulation tool shown to be correct.
Inertial Navigation System(INS)a* algorithm can be used for curve measuring system based on a single-axis Fiber Optic Gyroscope(FOG). The trajectory calculation is performed with an assumption of neglecting the length o...
详细信息
Inertial Navigation System(INS)a* algorithm can be used for curve measuring system based on a single-axis Fiber Optic Gyroscope(FOG). The trajectory calculation is performed with an assumption of neglecting the length of the carrier employed in the measuring system. The limitation of this assumption will be explicit for particulars cases. A mathematical model is proposed to study the deviation caused by the assumption. The relationship between the deviations and the carrier length, the fluctuation of the given curves is established by a series of simulated data with two types of given curves. The deviations along X-axis is approximately half of the carrier length, while the deviations along Y-axis are effected by carrier length and the height of the given curves. The simulated results can be used to analysis the factors leading to the deviations, and on the other hand to optimize the carrier design.
We present a detailed and modified version of Hrushovski'sa* algorithm that determines the Galois group of a linear differential equation. Moreover, we give explicit degree bounds for the defining polynomials of var...
详细信息
We present a detailed and modified version of Hrushovski'sa* algorithm that determines the Galois group of a linear differential equation. Moreover, we give explicit degree bounds for the defining polynomials of various linear algebraic groups that appear in thea* algorithm. These explicit bounds will play an important role to understand the complexity of thea* algorithm. (C) 2015 Elsevier Inc. All rights reserved.
A newa* algorithm is presented which makes use of the first derivative and morphology of each T-wave, and compare its performance with that of manual measurements on a set of approximately 40 beats at the beginning of 1...
详细信息
A newa* algorithm is presented which makes use of the first derivative and morphology of each T-wave, and compare its performance with that of manual measurements on a set of approximately 40 beats at the beginning of 18 selected Holter tapes. As an example we present the results obtained from a 24-hour Holter ECG signal. It is found that thea* algorithm has better immunity to baseline interferences when the baseline differs from a flat line after T-end, a situation quite common in Holter ECG recordings.
The most popular electronic media television snatches out at least a few minutes from all of our daily ***,it is natural that various production units will try to figure out the most popular programmes during which th...
详细信息
The most popular electronic media television snatches out at least a few minutes from all of our daily ***,it is natural that various production units will try to figure out the most popular programmes during which they can launch advertisements of their *** this paper,the problem is depicted from the graphical point of view and comparability graph is used to model the *** the paper aims to find out k parallel disjoint sessions (nonintersecting programme slots) that reach to a largest number of viewers,the problem turns into computing a maximum weighted k clique in the comparability graph (the graph is weighted by the television rating of each programme).
暂无评论