Identifying buildings in disaster areas quickly and conveniently plays an important role in post-disaster reconstruction and disaster assessment. Aiming at the technical requirements of earthquake relief projects, thi...
详细信息
Analyzing notor imagery electrocardiogram (ECoG) signal is very challenging for it is hard to set up a classifier based on the labeled ECoG obtained in the first session and apply it to the unlabeled test data obtaine...
详细信息
Analyzing notor imagery electrocardiogram (ECoG) signal is very challenging for it is hard to set up a classifier based on the labeled ECoG obtained in the first session and apply it to the unlabeled test data obtained in the second session. Here we propose a new approach to analyze ECoG trails in the case of session-to-session transfer exists. In our approach, firstly, dimension reduction is performed with independent component analysis (ICA) decomposition. Secondly, ECoG trials are clustered by an unsupervised learning algorithm called affinity propagation. Primary experimental results show that the proposed approach gives the reasonable result than that using the classical K-means clustering algorithm.
There are two key problems in efficient large scale texture mapping for terrain rendering-efficient data organization and real time data updating in memory. In order to solve these problems, in this paper we propose a...
详细信息
There are two key problems in efficient large scale texture mapping for terrain rendering-efficient data organization and real time data updating in memory. In order to solve these problems, in this paper we propose a quadtree based indexing method to organize multi-resolution images and to fast retrieve data from disk; For memory updating, we present a real time dual-cache structure based updating method, which effectively reduces the frequency of data refresh. We also innovatively use a wavelet image enhancement algorithm to enhance original terrain texture, which obtain richer edge information and give us a more realistic effect in terrain rendering. Through the analysis of storage efficiency and rendering speed of our experiment, this dual-cache structure based method solves rendering speed and memory limit problems perfectly.
We propose a fast algorithm which is based on the beam let decomposition for real-time rendering of scenes in participating media with multiple scattering. Firstly, the light source radiation is considered as composed...
详细信息
We propose a fast algorithm which is based on the beam let decomposition for real-time rendering of scenes in participating media with multiple scattering. Firstly, the light source radiation is considered as composed by all particles in the media and each particle radiation is decomposed along different forward directions using the plane decomposition method. Then the multiple scattering radiation of one particle is calculated by the decomposition radiations from its adjacent particles and the light source. Finally, according to the multiple scattering radiation value of each particle, the radiation of the ray which is from viewpoint is calculated using ray marching method, which can be implemented on the graphics processing unit (GPU), and rendering process is highly parallel. The experimental results show that the algorithm can achieve real-time rendering efficiency and enhance the practicality of multiple scattering.
We propose a novel method, the complete two-dimensional principal component analysis (complete 2DPCA), for image features extraction. Compared to the original 2DPCA, complete 2DPCA not only gain a higher recognition r...
详细信息
We propose a novel method, the complete two-dimensional principal component analysis (complete 2DPCA), for image features extraction. Compared to the original 2DPCA, complete 2DPCA not only gain a higher recognition rate, but also reduce the feature coefficients needed for face recognition. Complete 2DPCA is based on 2D image matrices. Two image covariance matrices are constructed directly using the original image matrix and theirs eigenvectors are derived for image feature extraction. Our experiments were performed on ORL face database, and experimental results show that the proposed method has an encouraging performance
Texture classification is an important problem in image analysis. A considerable amount of research work has been done for local or global rotation invariant feature extraction for texture classification. Local invari...
详细信息
Texture classification is an important problem in image analysis. A considerable amount of research work has been done for local or global rotation invariant feature extraction for texture classification. Local invariant features contain the spatial information, but usually do not have the contrast information. A new hybrid approach is proposed which considers the contrast information in spatial domain and the phase information in frequency domain of the image. It uses the joint histogram of the two complementary features, local phase quantization (LPQ) and the contrast of the image. Support vector machine is used for classification. The experimental results on standard benchmark datasets for texture classification Brodatz and KTH-TIPS2-a show that the proposed method can achieve significant improvement compared to the LPQ, Gabor filer or local Binary pattern methods.
Constructing the pyramidal architecture for the feature is currently a very effective way to obtain feature information of objects at different scales. Although the feature pyramid can realize the recognition and dete...
详细信息
ISBN:
(数字)9781728180281
ISBN:
(纸本)9781728180298
Constructing the pyramidal architecture for the feature is currently a very effective way to obtain feature information of objects at different scales. Although the feature pyramid can realize the recognition and detection of multi-scale objects in the object detection task well, it still has some limitations. Since the feature information of different levels is often not from the same layer of the network, it is difficult to obtain the feature of different objects information at a certain scale from a certain level feature map of the pyramid network. To solve this problem, we present a novel object detection architecture, named Enhanced Multi-scale Feature Fusion Pyramid Network (EMFFPNet). Our network consists of Enhanced Multi-scale Feature Fusion Module (EMFFM) and Predictor Optimization Module (POM). In EMFFM, Features at different levels can be fused into the Enhanced features as outputs, which are more representative and deterministic. In order to enable the enhanced features to play their respective roles in the pyramid network, we assign different weights to fusion features of different levels in POM. We perform the experiments on the COCO detection benchmark. The experimental results indicate that the performance of our model is much better than the state-of-the-art model.
Recently, spatial principal component analysis of census transform histograms (PACT) was proposed to recognize instance and categories of places or scenes in an image. When combining PACT with Local difference Magnitu...
详细信息
Recently, spatial principal component analysis of census transform histograms (PACT) was proposed to recognize instance and categories of places or scenes in an image. When combining PACT with Local difference Magnitude Binary pattern (LMBP), a new representation called Local Difference Binary pattern (LDBP) was proposed and performed better. LDBP is based on the comparisons between center pixel and its neighboring pixels. However, the relationship among neighbor pixels is not considered. In this paper we proposed Local Neighbor Binary pattern (LNBP) to utilize the relationship among neighboring pixels. LNBP provides complementary information regarding neighboring pixels for LDBP. We propose to combine LDBP with LNBP, and used a spatial representation for scene recognition. Experiments on two widely used dataset demonstrate the proposed method can improve the performance of recognition.
Dimension reduction methods are often used to analyzing high dimensional data, linear dimension methods are commonly used due to their simple geometric interpretations and for effective computational cost. Dimension r...
详细信息
Dimension reduction methods are often used to analyzing high dimensional data, linear dimension methods are commonly used due to their simple geometric interpretations and for effective computational cost. Dimension reduction plays an important role for feature selection. In this paper, we have given a detailed comparison of state-of-the-art linear dimension reduction methods like principal component analysis (PCA), random projections (RP), and locality preserving projections (LPP). We have determined which dimension reduction method performs better under the FastTag image annotation framework. Experiments are conducted on three standard bench mark image datasets such as CorelSk, IAPRTC-12 and ESP game to compare the efficiency, effectiveness and also memory usage. A detailed comparison among the aforementioned dimension reduction method is given.
In this paper, based on Khalimsky grid, a new Random-valued Impulse noise identification and removal method is proposed. Khalimsky grid can presents the neighborhood relationship among the pixels in the sliding window...
详细信息
In this paper, based on Khalimsky grid, a new Random-valued Impulse noise identification and removal method is proposed. Khalimsky grid can presents the neighborhood relationship among the pixels in the sliding window, effectively. The local statistics of Khalimsky grid is used to define an adaptive threshold range to identify the central pixel in current sliding window as noisy or noise free in an iterative way. The identified noisy pixel is replaced by local statistics of propose vertical direction based noise removal method. The performance of the propose method is evaluated on different test images and compared with state-of-the-art methods. Experimental results show that the propose method can identify the impulse noise, as well as can preserve the detailed information of an image, efficiently.
暂无评论