Short-term forecasting of travel time is essential for the success of intelligent transportation system. In this paper, we review the state-of-art of short-term traffic forecasting models and outline their basic ideas...
详细信息
Short-term forecasting of travel time is essential for the success of intelligent transportation system. In this paper, we review the state-of-art of short-term traffic forecasting models and outline their basic ideas, related works, advantages and disadvantages of each model. An improved adaptive exponential smoothing (IAES) model is also proposed to overcome the drawbacks of the previous adaptive exponential smoothing model. Then, comparing experiments are carried out under normal traffic condition and abnormal traffic condition to evaluate the performance of four main branches of forecasting models on direct travel time data obtained by license plate matching (LPM). The results of experiments show each model seems to have its own strength and weakness. The forecasting performance of IASE is superior to other models in shorter forecasting horizon (one and two step forecasting) and the IASE is capable of dealing with all kind of traffic conditions.
DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence desig...
详细信息
DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method.
A novel way achieving geometrical reconstruction of actual human face through projecting two types of texture on face in short time is advanced. The first type texture is stripe which is used to establish parallax gri...
详细信息
A novel way achieving geometrical reconstruction of actual human face through projecting two types of texture on face in short time is advanced. The first type texture is stripe which is used to establish parallax grid between images. Taking into account of its results, the second type projecting texture is used to match by virtue of its abundant traits. After realizing geometrical reconstruction, the paper provides a general way about achieving actual texture reconstruction by the outer spherical surface surrounding object. In order to uniform color, it deals with parts of images in conjunct region and makes the color change meeting a certain function on condition of keeping their original information mostly. Results show this way can improve reconstruction quality and decrease complicacy of algorithm.
The field of DNA computing emerged in 1994 after Adleman’s paper was published. Henceforth,a few scholars solved some noted NP-complete problems in this way. And all these methods of DNA computing are based on conven...
详细信息
The field of DNA computing emerged in 1994 after Adleman’s paper was published. Henceforth,a few scholars solved some noted NP-complete problems in this way. And all these methods of DNA computing are based on conventional Watson-Crick hydrogen bond of doublehelical DNA molecule. In this paper, we show that the triple-stranded DNA structure mediated by RecA protein can be used for solving computational problems. Sequence-specific recognition of double-stranded DNA by oligonucleotide-directed triple helix (triplex) formation is used to carry out the algorithm. We present procedure for the 3-vertex-colorability problems. In our proposed procedure, it is suggested that it is possible to solve more complicated problems with more variables by this model.
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate...
详细信息
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed.
In this paper, a face recognition method using local qualitative representations is proposed to solve the problem of face recognition in varying lighting. Based on the observation that the ordinal relationship between...
详细信息
ISBN:
(纸本)9780819469526
In this paper, a face recognition method using local qualitative representations is proposed to solve the problem of face recognition in varying lighting. Based on the observation that the ordinal relationship between the average brightness of image regions pair is invariant under lighting changes, Local Binary Mapping is defined as an illumination invariant for face recognition based on Local Binary Pattern descriptor, which extracts the local variance features of an image. For the 'symbol' feature vector, hamming distance is used as similarity measurement. It has been proved that the proposed method can provide the accuracy of 100 percent for subset 2, 3, 4 and 98.89 percent for subset 5 of the Yale facial database B when all images in subset 1 are used as gallery.
In this paper, a pixel-level image fusion algorithm based on Nonsubsampled Contourlet Transform (NSCT) has been proposed. Compared with Contourlet Transform, NSCT is redundant, shift-invariant and more suitable for im...
详细信息
ISBN:
(纸本)9780819469519
In this paper, a pixel-level image fusion algorithm based on Nonsubsampled Contourlet Transform (NSCT) has been proposed. Compared with Contourlet Transform, NSCT is redundant, shift-invariant and more suitable for image fusion. Each image from different sensors could be decomposed into a low frequency image and a series of high frequency images of different directions by multi-sacle NSCT. For low and high frequency images, they are fused based on local-contrast enhancement and definition respectively. Finally, fused image is reconstructed from low and high frequency fused images. Experiment demonstrates that NSCT could preserve edge significantly and the fusion rule based on region segmentation performances well in local-contrast enhancement.
Gather the information of the environment by the monocular vision. Using the H and S weight of the HSV color model, separate the target from the environment with a certain color, by a fast clustering algorithm for two...
详细信息
ISBN:
(纸本)7900719229
Gather the information of the environment by the monocular vision. Using the H and S weight of the HSV color model, separate the target from the environment with a certain color, by a fast clustering algorithm for two-value image segmentation. Calculating the distance between the camera and target by the 3D reconstruction algorithm and sub-control strategy, and raise its veracity by laser information fusion. Furthermore, a vision servo system has been designed and utilized to achieve the robot's dynamic track. At last, some experiments were used to certification its availability.
image fusion is an important tool in remote sensing, since many Earth observation satellites provide both high-resolution panchromatic (Pan) and low-resolution multispectral (MS) images. To date, many image fusion tec...
详细信息
ISBN:
(纸本)9780819469519
image fusion is an important tool in remote sensing, since many Earth observation satellites provide both high-resolution panchromatic (Pan) and low-resolution multispectral (MS) images. To date, many image fusion techniques have been developed. However, the available algorithms can hardly produce a satisfactory fusion result for IKONOS and QuickBird images. Among the existing fusion algorithms, the IHS technique is the most widely used one, and the wavelet fusion is the most frequently discussed one in recent publications because of its advantages over other fusion techniques. But the color distortion of these two techniques is often obvious. The support value fusion technique demonstrates some advantages over the conventional methods. This study presents a new fusion approach that integrates the advantages of both the IHS and the support value techniques to reduce the color distortion of QuickBird fusion results. Different QuickBird images have been fused with this new approach. Visual and statistical analyses prove that the concept of the proposed extended fast IHS (eFIHS) and support value integration is promising, and it does significantly improve the fusion quality compared to conventional IHS (eFIHS) and wavelet fusion techniques.
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate...
详细信息
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed.
暂无评论