Ontology mapping is to find the mapping relationship between different ontology to reuse and share ontology. In this paper we present a multi-strategy ontology mapping technique based on the structure and instance. Wh...
详细信息
According to defocus imaging theory, the amount of blur in the defocus images varies with depth of the object in the scene. So depth in the scene can be recovered by estimating the blur with the knowledge of the lens ...
详细信息
According to defocus imaging theory, the amount of blur in the defocus images varies with depth of the object in the scene. So depth in the scene can be recovered by estimating the blur with the knowledge of the lens parameters. A novel application of the total variation principle is made for the estimation of the amount of blur in the defocus images. Three main processes are included: the process of image defocusing is modeled using the model of anisotropic heat diffusion, then the depth recovery problem is translated into the minimum problem of energy functional with total variation regularization, and the gradient flow is used to seek the optimal solution. The recovery of focus image and the excess restrictions are avoided. The experiment results show that the algorithm is quite effective and depth information in edge is well retained particularly. Compared with the least square algorithm, depth recovery error with the total variation algorithm is reduced about 40%.
Based on illumination normalization and progressive thresholding, this paper presents a novel algorithm for automatic localization of human eyes in still images with complex background. First of all, Retinex method is...
详细信息
Based on illumination normalization and progressive thresholding, this paper presents a novel algorithm for automatic localization of human eyes in still images with complex background. First of all, Retinex method is used to realize normalizing of the face image. Secondly, a determination criterion of eye location is established by the priori knowledge of geometrical facial features. Thirdly, a range of threshold values that would separate eye blocks from others in a segmented face image is estimated. With the progressive increase of the threshold by an appropriate step in that range, once two eye blocks appear from the segmented image, they will be detected by the determination criterion of eye location. Finally, the 2-D correlation coefficient is used as a symmetry similarity measure to check the factuality of the two detected eyes. The experimental results demonstrate the high efficiency of the algorithm in runtime and correct localization rate.
Self-organizing networks (SON) for cellular systems are emerging as an important technology to reduce the cost of network deployment and maintenances. Mobility robustness optimization (MRO) is one of the main use case...
详细信息
Self-organizing networks (SON) for cellular systems are emerging as an important technology to reduce the cost of network deployment and maintenances. Mobility robustness optimization (MRO) is one of the main use cases of SON and has been intensively studied in 3GPP working groups. In this paper, we take the user equipment (UE) speed into account to solve the MRO problem. We propose a US-MRO algorithm, which assigns different Hysteresis parameters to UEs with different speed. The simulation results show that the success rate of Handover (HO) is improved and user experience is enhanced by the US-MRO algorithm.
Secure Multi-party Computation (SMC) plays an important role in information security under the circumstance of cooperation calculation, so SMC on privacy-preservation is of great interest. In this paper we discuss an ...
详细信息
Secure Multi-party Computation (SMC) plays an important role in information security under the circumstance of cooperation calculation, so SMC on privacy-preservation is of great interest. In this paper we discuss an issue which is a special SMC problem. Based on Scalar Product Protocol, Monte Carlo Method and Oblivious Transfer, we give two solutions to the problem about how to decide the areas. That is, a polygon is divided into two parts by a line: S 1 and S 2 . Furthermore, we analyze the security and computational complexity, as well as the comparison of these two protocols. The results of analysis show that the proposed protocols are secure and efficient. We believe the two protocols will be useful in other geometric and combinatorial problems.
An identity-based threshold key management scheme without secure channel is proposed for ad hoc network. The master private key, which is shared among all nodes by the Shamir's secret sharing scheme, is produced b...
详细信息
An identity-based threshold key management scheme without secure channel is proposed for ad hoc network. The master private key, which is shared among all nodes by the Shamir's secret sharing scheme, is produced by all nodes when network is formed. The nodes’ public keys are derived from their identities. In order to get the private key, each node needs to prove their identity to distributed CAs using a zeroknowledge proof protocol to get the share of private key. Compared with former schemes, our scheme doesn’t need any local registration authority(LRA), which is easy to be compromised by adversary. When a node leaves the network, shares of the master private key would be renewed. In the end, we prove our scheme is correct and secure.
This paper describes the compressed sampling using the block wavelet transform which has more flexibility in reconstruction the images. Compressed sampling is considered for signals and images that are sparse in a wav...
详细信息
ISBN:
(数字)9781424465163
ISBN:
(纸本)9781424465132
This paper describes the compressed sampling using the block wavelet transform which has more flexibility in reconstruction the images. Compressed sampling is considered for signals and images that are sparse in a wavelet basis. We propose a process of the image by sampling the data far below Nyquist rate in terms of compressed sampling, which shows that image data can be reconstructed from an extremely small set of measurements than what is generally considered necessary. A novel wavelet based interframe compression scheme has been developed and put into practice. It is based on a unique block wavelet transform that we have developed. BWT based interframe compression is very efficient in both compression and speed performance. The compression performance of our image codec hold a slightly lower PSNR value produces a more visually pleasing result. This implementation also preserves the scalability of the wavelet embedded coding technique.
In this paper, we propose a process of the radar image data by Random sampling. The sampling rate is far lower than Nyquist-Shannon sampling theorem, which shows that image data can be reconstructed from an extremely ...
详细信息
In this paper, we propose a process of the radar image data by Random sampling. The sampling rate is far lower than Nyquist-Shannon sampling theorem, which shows that image data can be reconstructed from an extremely small set of measurements than what is generally considered necessary. Compressive Sampling is considered for signals and images that are sparse in a wavelet basis. A low complexity compression method for high resolution image based on block partition in wavelet region is proposed. The image is partitioned into blocks in wavelet domain and then compressed separately with CS. The bit rates for each block is allocated according to the texture complexity of the block. The proposed method eliminates the "block effect" caused by traditional block partition in pixel domain, and solves the problem caused by traditional block partition that the areas with simple texture are good in reconstruction quality while those with complicated texture are too poor to be used because of the uneven distribution of texture complexity. The experimental results show that the compression performance of the proposed method is quite similar to the results obtained by global compression. This compression method is particularly suitable for the high resolution remote sensing image which sparse in a wavelet domain.
In order to improve the accuracy of the image annotation, an automatic image annotation method based on mutual K-nearest neighbor graph (MKNN) is proposed. The proposed algorithm describes the relationship between low...
详细信息
In order to improve the accuracy of the image annotation, an automatic image annotation method based on mutual K-nearest neighbor graph (MKNN) is proposed. The proposed algorithm describes the relationship between low-level features, annotation words and image by a mutual K-nearest neighbor graph. Semantic information is extracted by exploiting the mutual relationship of two nodes in the mutual K-nearest neighbor graph. Inverse document frequency (IDF) is introduced to adjust the weights of edges between the image node and its annotation word's node, which overcomes the deviation caused by high-frequency words. Experimental results in Corel image dataset show that the proposed algorithm improves effectively the image annotation performance..
In this paper, we proposed a tunnel morph model for bio-signal waveform in measuring their similarity. Firstly, the formal specifications of bio-signal waveforms are given. And then, a series of model establishing rel...
详细信息
In this paper, we proposed a tunnel morph model for bio-signal waveform in measuring their similarity. Firstly, the formal specifications of bio-signal waveforms are given. And then, a series of model establishing related definitions are presented. These definitions contain waveform segmentation; waveforms distance measurement, and tunnel width computation. Moreover, on the base of the model, a similarity measuring strategy which takes the curve feature of bio-signal into account was presented. In the end, the strategy was compared with other similarity measurement methods by AECG (Ambulatory Electrocardiogram) waveform data. The data are adopted from MIT/BIH arrhythmia database. Experiment results show that the sensitivity and the positive predictivity of the strategy based on tunnel morph model are prior to other strategies.
暂无评论