CENTRIST (CENsus TRansform hISTogram) is a descriptor which is firstly proposed for scene classification. In this paper, the differences between CENTRIST and LBP are analyzed on theory. And then it is exploited in the...
详细信息
CENTRIST (CENsus TRansform hISTogram) is a descriptor which is firstly proposed for scene classification. In this paper, the differences between CENTRIST and LBP are analyzed on theory. And then it is exploited in the task of content-based image retrieval firstly integrated with the spatial information by multi scale spatial pyramid. The experimental results firstly show that the similarity of two images computed by histogram intersection is better than obtained by Euclidean distance for CENTRIST descriptor. And then the paper demonstrates the most difference between CENTRIST and LBP is that whether the constraints and the transitivity among neighbored pixels exist on experiments. Although CENTRIST can achieve higher precision at top 40 returned images compared with LBP and its extensions only for some categories chosen from Corel and Caltech101 database, the average P-R curve of CENTRIST is higher than LBPs.
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...
详细信息
To deal with the drifting issue in visual tracking, we propose an Online Transfer Boosting (OTB) algorithm that transfers knowledge from three different source domains to the target domain to improve the performance o...
详细信息
ISBN:
(纸本)9781467322164
To deal with the drifting issue in visual tracking, we propose an Online Transfer Boosting (OTB) algorithm that transfers knowledge from three different source domains to the target domain to improve the performance of the online classifier used in tracking-by-detection. In particular, the OTB algorithm integrates three types of knowledge by: (1) transferring prior knowledge from the first frame using semi-supervised learning; (2) transferring appearance changes from the previous frames by dynamically updating the learning factor; and (3) transferring observed sample distribution knowledge from the current frame by reweighting the training samples. Experimental results on several public video sequences demonstrated promising performance of OTB in both tracking accuracy and stability.
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 ...
详细信息
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...
详细信息
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.
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.
暂无评论