This paper proposes a particle swarm optimization（PSO） based particle filter（PF） tracking framework,the embedded PSO makes particles move toward the high likelihood area to find the optimal position in the state t...
详细信息
This paper proposes a particle swarm optimization（PSO） based particle filter（PF） tracking framework,the embedded PSO makes particles move toward the high likelihood area to find the optimal position in the state transition stage,and simultaneously incorporates the newest observations into the proposal distribution in the update *** the proposed approach,likelihood measure functions involving multiple features are presented to enhance the performance of model ***,the multi-feature weights are self-adaptively adjusted by a PSO algorithm throughout the tracking *** are three main ***,the PSO algorithm is fused into the PF framework,which can efficiently alleviate the particles degeneracy ***,an effective convergence criterion for the PSO algorithm is explored,which can avoid particles getting stuck in local minima and maintain a greater particle ***,a multi-feature weight self-adjusting strategy is proposed,which can significantly improve the tracking robustness and *** performed on several challenging public video sequences demonstrate that the proposed tracking approach achieves a considerable performance.
Character information is hard to detect in billet scene images by CCD camera. In this paper, we present a method for detection of billet characters from measurements of recursive segmented image. This recursive segmen...
详细信息
Character information is hard to detect in billet scene images by CCD camera. In this paper, we present a method for detection of billet characters from measurements of recursive segmented image. This recursive segmented method can be used in a wide variety of billet scenes. According to high temperature and complex scene in the rolling line, we use an effective clustering and projection characteristics to determine the terminal condition of recursive segmentation. Then we can label character candidate regions in turn by this effective characteristics, and select the regions we want to achieve. The experiments show that this method makes full use of the characteristics of region and clustering. It can improve the quality of detection, and the detection result meets the need of practical application.
The digital system of Archaeological includes multi-scale non-destructive detection of archaeological methods,data mining technologies and the GIS of archaeological *** preservation is not just for the protection of c...
详细信息
The digital system of Archaeological includes multi-scale non-destructive detection of archaeological methods,data mining technologies and the GIS of archaeological *** preservation is not just for the protection of cultural relics has been *** non-destructive detection method to detect archaeological artifacts and clarify the situation of cultural relics buried *** detection data through the using of data mining algorithm make out the archaeological ***,use GIS technology to achieve the detection of data management and integration of data mining methods.A whole system of digital archaeological built on the GIS platform,based on the using of data mining technology to achieve a detection method and archaeological information mapping,the system for the digital archaeology has provided a complete technical support.
The license plate location technique is an important image processing step in license plate recognition system. Vehicle license plates are distinguished from backgrounds using features proposed in existing literatures...
详细信息
The license plate location technique is an important image processing step in license plate recognition system. Vehicle license plates are distinguished from backgrounds using features proposed in existing literatures. However, the effect of location is quite affected by feature selection. In this paper, we propose a method of precise license plate location fusing salient features. The method is mainly divided into three steps. First, candidate license plate regions are detected using improved Harris corner feature with much less time than traditional method. Then, candidates are sifted to only retain license plates based on two salient features named color combination and mean difference which are first proposed in this paper. Finally, the license plates are located precisely according to the projection feature. In experiment, the proposed algorithm was tested with 1942 real images captured in different environment and the license plates are successfully located as 97.6% in average with only 109ms. The experiment results demonstrates the effectiveness and efficient of our algorithm.
New impulse detection and filtering algorithm is proposed in color images. Based on fast peer group filter, the proposed filtering algorithm uses different iteration times to complete filter according to different imp...
详细信息
Character information is hard to detect in billet scene images by CCD camera. In this paper, we present a method for detection of billet characters from measurements of recursive segmented image. This recursive segmen...
详细信息
Character information is hard to detect in billet scene images by CCD camera. In this paper, we present a method for detection of billet characters from measurements of recursive segmented image. This recursive segmented method can be used in a wide variety of billet scenes. According to high temperature and complex scene in the rolling line, we use an effective clustering and projection characteristics to determine the terminal condition of recursive segmentation. Then we can label character candidate regions in turn by this effective characteristics, and select the regions we want to achieve. The experiments show that this method makes full use of the characteristics of region and clustering. It can improve the quality of detection, and the detection result meets the need of practical application.
We prove that Fv(3,5;6) = 16, which solves the smallest open case of vertex Folkman numbers of the form Fv(3,k;k + 1). The proof uses computer algorithms.
We prove that Fv(3,5;6) = 16, which solves the smallest open case of vertex Folkman numbers of the form Fv(3,k;k + 1). The proof uses computer algorithms.
Tracking the same person across multiple cameras is an important task in multi-camera systems. It is also desirable to re-identify the individuals who have been previously seen with a single-camera. This paper address...
详细信息
Tracking the same person across multiple cameras is an important task in multi-camera systems. It is also desirable to re-identify the individuals who have been previously seen with a single-camera. This paper addresses this problem by the re-identification of the same individual in two different datasets, which are both challenging situations from video surveillance system. In this paper, local descriptors are introduced for image description, and support vector machines are employed for high classification performance and so an efficient Bag of Features approach for image presentation. In this way, robustness against low resolution, occlusion and pose, viewpoint and illumination changes is achieved in a very fast way. We get promising results from the evaluation with situations where a number of individuals vary continuously from a multi-camera system.
Regarding the embedded processor as the core, this study utilizes various cutting-edge technologies such as wireless LAN, USB interface, Bluetooth, multimedia, etc., to propose the design program of QT-based security ...
详细信息
The upper domination Ramsey number u(3, 3, 3) is the smallest integer n such that every 3-coloring of the edges of complete graph Kn contains a monochromatic graph G with T(G) ≥ 3, where T(G) is the maximum order ove...
详细信息
The upper domination Ramsey number u(3, 3, 3) is the smallest integer n such that every 3-coloring of the edges of complete graph Kn contains a monochromatic graph G with T(G) ≥ 3, where T(G) is the maximum order over all the minimal dominating sets of the complement of G. In this note, with the help of computers, we determine that U(3, 3, 3) = 13, which improves the results that 13 ≤ U(3, 3, 3) ≤ 14 provided by Michael A. Henning and Ortrud R. Oellermann.
暂无评论