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.
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.
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.
Automatic ground target recognition technology in downward-looking infrared imagery is challenging problems due to the complexity of real-world. A robust ground target recognition method is proposed for downward-looki...
详细信息
Automatic target detection (ATD) in infrared (IR) imagery is a fundamental and challenging task in computer vision. A fast automatic target detection method in IR image sequence is proposed in this paper. Since the po...
详细信息
An accuracy assessment method that integrates segmentation and classification accuracy is proposed to meet the requirements of object-based image analysis. Segmentation errors are measured by establishing the relation...
详细信息
ISBN:
(纸本)9781467301732
An accuracy assessment method that integrates segmentation and classification accuracy is proposed to meet the requirements of object-based image analysis. Segmentation errors are measured by establishing the relationship between pixels and their corresponding segments according to the overlaps of segments and reference polygons. Then, two improved confusion matrices that take the segmentation errors into consideration are used: one for pixel-level classification results, and the other for object-level classification results. A final accuracy assessment combines the statistics of these two confusion matrices. The proposed method can be applied to segmentation scale selection in the hierarchical interpretation system. An experiment on a SPOT5 image demonstrates the effectiveness of this method for segmentation scale selection, which can guide the fusion of objects of different scales to obtain a higher accuracy.
The van der Waerden number W(r, k) is the least integer N such that every r-coloring of {1,2, • • •, N} contains a monochromatic arithmetic progression of length at least k. Rabung gave a method to obtain lower bounds...
详细信息
The van der Waerden number W(r, k) is the least integer N such that every r-coloring of {1,2, • • •, N} contains a monochromatic arithmetic progression of length at least k. Rabung gave a method to obtain lower bounds on W(2,k) based on quadratic residues, and performed computations on all primes no greater than 20117. By improving the efficiency of the algorithm of Rabung, we perform the computation for all primes up to 6 x 107, and obtain lower bounds on W(2, k) for k between 11 and 23.
Recently, tracking is regarded as a binary classification problem by discriminative tracking methods. However, such binary classification may not fully handle the outliers, which may cause drifting. In this paper, we ...
详细信息
Recently, tracking is regarded as a binary classification problem by discriminative tracking methods. However, such binary classification may not fully handle the outliers, which may cause drifting. In this paper, we argue that tracking may be regarded as one-class problem, which avoids gathering limited negative samples for background description. Inspired by the fact the positive feature space generated by One-Class SVM is bounded by a closed sphere, we propose a novel tracking method utilizing One-Class SVMs that adopt HOG and 2bit-BP as features, called One-Class SVM Tracker (OCST). Simultaneously an efficient initialization and online updating scheme is also proposed. Extensive experimental results prove that OCST outperforms some state-of-the-art discriminative tracking methods on providing accurate tracking and alleviating serious drifting.
A Support Vector Machine (SVM) based method for ship detection in Polarimetric SAR (POLSAR) is proposed in this study. Because of similarities of ship and man-made structures on land in scattering mechanisms, land and...
详细信息
暂无评论