We propose two geometric structure based approaches GGCI (global geometric clustering for image) and GSIM (geometric structure based image matching) for image clustering and image matching, respectively. For face imag...
详细信息
ISBN:
(纸本)9781424404759
We propose two geometric structure based approaches GGCI (global geometric clustering for image) and GSIM (geometric structure based image matching) for image clustering and image matching, respectively. For face images or object images taken with varying factors, the GGCI approach learns the global geometric structure of images space and clusters images based on geodesic distance instead of Euclidean distance and the extended nearest neighbor approach. The GSIM approach uses the minimal Euclidean distance between parts of image and the pattern and its variations as matching criteria and threshold strategy for image matching. We demonstrate experimentally that the GGCI approach achieves lower error rates and the GSIM approach brings down the sensitivity of gray values to change in radiometry and reduces multi local extrema to some extent.
We present a new distance for the contour-based shapes recognition which we called shape edit distance (SED). Unlike the traditional distance, SED takes into account the spatial deformation of shapes. To compute the s...
详细信息
We present a new distance for the contour-based shapes recognition which we called shape edit distance (SED). Unlike the traditional distance, SED takes into account the spatial deformation of shapes. To compute the shape edit distance, we convert shapes to string sequences so that string matching techniques can be used. We pose the problem of string matching as a maximum a posteriori probability (MAP) alignment of the string sequences for shapes and compute the shape edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice. Experiments demonstrate the utility of the shape edit distance on a number of image retrieval and clustering problems
The natural gradient blind source separation (BSS) algorithm with unknown source number proposed by Cichocki in 1999 is justified in this paper. An new method to detect the redundant separated signals based on structu...
详细信息
A novel and efficient speckle noise reduction algorithm based on Bayesian wavelet shrinkage using cycle spinning is proposed. First, the sub-band decompositions of non-logarithmically transformed SAR images are shown....
详细信息
A novel and efficient speckle noise reduction algorithm based on Bayesian wavelet shrinkage using cycle spinning is proposed. First, the sub-band decompositions of non-logarithmically transformed SAR images are shown. Then, a Bayesian wavelet shrinkage factor is applied to the decomposed data to estimate noise-free wavelet coefficients. The method is based on the Mixture Gaussian Distributed (MGD) modeling of sub-band coefficients. Finally, multi-resolution wavelet coefficients are reconstructed by wavelet-threshold using cycle spinning. Experimental results show that the proposed despeclding algorithm is possible to achieve an excellent balance between suppresses speckle effectively and preserves as many image details and sharpness as possible. The new method indicated its higher performance than the other speckle noise reduction techniques and minimizing the effect of pseudo-Gibbs phenomena.
After analyzing the disadvantages of traditional text clustering method based on keywords set, a novel approach for clustering of Chinese text based on concept hierarchy is presented. It introduces a Chinese topic cla...
详细信息
After analyzing the disadvantages of traditional text clustering method based on keywords set, a novel approach for clustering of Chinese text based on concept hierarchy is presented. It introduces a Chinese topic classify dictionary as background knowledge to clustering of Chinese text. It adopts a hierarchical coding system which reflects concept relevance among different words and uses vector space model based on concept hierarchy to represent Chinese text. The experimental results show this approach is more effective than traditional text clustering method based on keywords set
Let {vij}, i, j = 1, 2, …, be i.i.d, random variables with Ev11 = 0, Ev11^2 = 1 and a1 = (ai1,…, aiM) be random vectors with {aij} being i.i.d, random variables. Define XN =(x1,…, xk) and SN =XNXN^T,where xi=ai...
详细信息
Let {vij}, i, j = 1, 2, …, be i.i.d, random variables with Ev11 = 0, Ev11^2 = 1 and a1 = (ai1,…, aiM) be random vectors with {aij} being i.i.d, random variables. Define XN =(x1,…, xk) and SN =XNXN^T,where xi=ai×si and si=1/√N(v1i,…, vN,i)^T. The spectral distribution of SN is proven to converge, with probability one, to a nonrandom distribution function under mild conditions.
This paper aims to carry out granular analysis of time sequence based on quotient space. Granular methods have long before been adopted to analyze time sequence, but the granularity was based on time, for example, day...
详细信息
The quotient space theory is indented to study the relationship of transform and that of dependency among the worlds with different grain-size. Compared-with other granule computing tools, it has more powerful abiliti...
详细信息
ISBN:
(纸本)9781424404759
The quotient space theory is indented to study the relationship of transform and that of dependency among the worlds with different grain-size. Compared-with other granule computing tools, it has more powerful abilities of representation and absorption. The reason is that structure is introduced in its model The paper is to study the quotient space theory based on structure. We first introduce some methods of constructing quotient structure. Then we study in detail the quotient space family based on structure, and get some good results for further research. Finally we also briefly discuss hierarchical structure of fuzzy sets.
This paper presents a public mesh watermarking algorithm whereby the resultant watermarked image minus the original image is the watermark information. According to the addition property of the Fourier transform, a ch...
详细信息
In this paper, we offers a new algebraic point of view for DNA molecules and introduce the algebraic system by using the natural operation based on the Sigma = {A, C, G, T} . We characterize its structure by using the...
详细信息
In this paper, we offers a new algebraic point of view for DNA molecules and introduce the algebraic system by using the natural operation based on the Sigma = {A, C, G, T} . We characterize its structure by using the algebraic theory. We show that (L, oplus, otimes ) is the distribution lattice of rings with identical element. Furthermore,we generalize this result to the Wrho(V) , a set which elements simulates the DNA molecules with sticky ends, the element is called an incomplete double stranded molecules consist of mixed DNA molecules with double and single strands.
暂无评论