Advanced Materials Research
Vol. 773
Vol. 773
Advanced Materials Research
Vol. 772
Vol. 772
Advanced Materials Research
Vol. 771
Vol. 771
Advanced Materials Research
Vol. 770
Vol. 770
Advanced Materials Research
Vol. 769
Vol. 769
Advanced Materials Research
Vol. 768
Vol. 768
Advanced Materials Research
Vols. 765-767
Vols. 765-767
Advanced Materials Research
Vol. 764
Vol. 764
Advanced Materials Research
Vol. 763
Vol. 763
Advanced Materials Research
Vols. 760-762
Vols. 760-762
Advanced Materials Research
Vols. 756-759
Vols. 756-759
Advanced Materials Research
Vols. 753-755
Vols. 753-755
Advanced Materials Research
Vols. 750-752
Vols. 750-752
Advanced Materials Research Vols. 765-767
Paper Title Page
Abstract: Image registration is an important technology in image processing and computer vision, ant colony algorithm search for the optimal registration parameters in image registration has a strong global optimization ability, but the final search to the accuracy of the registration parameters and search for a very long time. in this paper an improved ant colony algorithm is presented to improve the registration accuracy by the original ant colony algorithm and simplex algorithm has a strong local optimization, improved ant colony algorithm heuristic function in order to improve the convergence speed; Finally, the improved ant colony algorithm combined with multi-resolution registration strategy to reduce the time of image registration. The experimental results show that compared with the original ant colony algorithm, an improved ant colony algorithm can effectively improve the image registration accuracy, and can reduce the number of convergence of the algorithm.
683
Abstract: The Traveling Salesman Problem is a combinatorial optimization problem, the problem has been shown to belong to the NPC problem, the possible solution of Traveling Salesman Problem and the scale of the cities have the exponential relation, so the more bigger of the scale. In this paper, improve the search process of the genetic algorithm by introducing the idea is to compress the search space. The simulation results show that for solving the TSP, the algorithm can quickly obtain multiple high-quality solutions. It can reduce the blindness of random search and accelerate convergence of the algorithm.
687
Abstract: Urban traffic system is typical hybrid system. It is very difficult to coordinate the freeway off-ramp metering and downstream intersection signals which mean a special continuous-discrete-mixing traffic control model need to be considered. In this paper, taking queue length as continuous state variable, traffic signal as discrete variable and traffic count as continuous variable, Model Logic Dynamic approach is built for modeling. Then MILP optimization approach is applied to verify the rationality of the hybrid model. MATLAB simulation results show the MLD model and MILP based MPC method could be used for the coordination between off-ramp metering and downstream intersection signal very well.
690
Abstract: We discussed a kind of singular integral equation with Hilbert kernel on open arcs lying in a period strip. By using the method of complex functions, we obtained the extended Plemelj Formula with Hilbert kernel, and based on this, we obtained the general solutions and the solvable conditions for this kind of characteristic singular integral equation with Hilbert kernel on open arcs.
695
Abstract: Based on the ant colony algorithm analysis and research, this paper proposed an improved ant colony algorithm. Through updating pheromone and optimal search strategy, then applied to the Traveling Salesman Problem (TSP), effectively improved the searching capability of the algorithm. Finally through the simulation testing and analysis, verified that the improved ant colony algorithm is effective, and has good performance.
699
Abstract: In this paper, we reformulate the system of absolute value equations as afamily of parameterized smooth equations and propose a smoothing Newton method tosolve this class of problems. we prove that the method is globally and locally quadraticallyconvergent under suitable assumptions. The preliminary numerical results demonstratethat the method is effective.
703
Abstract: In the paper, we are concerned with the partial asymptotic stochastic stability (stability in probability) of stochastic differential delay equations with Markovian switching (SDDEwMSs), the sufficient conditions for partial asymptotic stability in probability have been given and we have generalized some results of Sharov and Ignatyev to cover a class of much more general SDDEwMSs.
709
Abstract: This paper discusses an evaluation methodology that can be used to assess the credibility of simulation models. The goal of verification and validation of simulation models will be described, together with a description of evaluation methodology and evaluation procedures. The credibility of simulation models can be evaluated using the method proposed here, which will be much meaningful to the simulation systems development. Taking a space Tether-net simulation system as an instance, the credibility evaluation result is provided.
713
Abstract: Adaptive Binary Arithmetic Coding is an effective mode of coding. The paper introduces the basic principle of Adaptive Binary Arithmetic Coding first. Then the paper analyses the complexity of Adaptive Binary Arithmetic Coding and advances a method to optimize the algorithm. Experiment results show that this method can greatly reduce the complexity of Adaptive Binary Arithmetic Coding in h.264.
717
Abstract: The classical mean shift (MS) algorithm is the best color-based method for object tracking. However, in the real environment it presents some limitations, especially under the presence of noise, objects with partial and full occlusions in complex environments. In order to deal with these problems, this paper proposes a reliable object tracking algorithm using corrected background-weighted histogram (CBWH) and the Kalman filter (KF) based on the MS method. The experimental results show that the proposed method is superior to the traditional MS tracking in the following aspects: 1) it provides consistent object tracking throughout the video; 2) it is not influenced by the objects with partial and full occlusions; 3) it is less prone to the background clutter.
720