In order to improve the detection accuracy of spliced images, a new blind detection based on visual saliency was proposed in this paper. Firstly, create the edge conspicuous map by an improved OSF-based method, and ex...
详细信息
This paper focuses on a new color-gray image fusion algorithm based on Morphological Component Analysis (MCA) which is a novel decomposition (separation) method based on sparse representation of signals and images. Th...
详细信息
In this paper, we propose a non-interior path following algorithm for solving the optimal power flow problem. By using the new approach, we can choose initial guesses arbitrarily in the whole space of n dimensional Eu...
详细信息
A new image resizing algorithm was proposed based on a color space and an energy updating mechanism. First, the concept of color space was introduced into image resizing algorithm and the pixel's energy function w...
详细信息
A new image resizing algorithm was proposed based on a color space and an energy updating mechanism. First, the concept of color space was introduced into image resizing algorithm and the pixel's energy function was re-built based on the gradient of gray space and color space. Three kinds of color energy functions were tested and the energy function in HSI space was finally chosen because of its excellent performance. Additionally, since image resizing might badly corrupt the contours of main areas in an original image and might further affect the understanding of the image, an energy updating mechanism was proposed. The energy updating mechanism could increase the neighborhood energy values where a pixel had been deleted. By doing so, it could decrease the probability that seams cross this area again, thus the contour of this area could be protected well. In experiments, the degree of Scale Invariant Feature Transform (SIFT) matching between original image and resized image with different λ values was calculated. The best performance shows that the proportion between the color and gray energy functions was 7:3. By comparing the proposed method with other two state of arts algorithms, it indicates that the shape of main area will be better preserved with the proposed algorithm without introducing any more complexity.
In this paper, we introduce some new signature schemes and secret sharing schemes from the known Gröbner basis cryptosystems. Then, we discuss the issues related to the security of these schemes. Finally, we draw...
详细信息
We describe a novel mobile visual search system based on the saliency mechanism and sparse coding principle of the human visual system (HVS). In the feature extraction step, we first divide an image into different reg...
详细信息
We describe a novel mobile visual search system based on the saliency mechanism and sparse coding principle of the human visual system (HVS). In the feature extraction step, we first divide an image into different regions using the saliency extraction algorithm. Then scale-invariant feature transform (SIFT) descriptors in all regions are extracted while regional identities are preserved based on their various saliency levels. According to the sparse coding principle in the HVS, we adopt a local neighbor preserving Hash function to establish the binary sparse expression of the SIFT features. In the searching step,
In this paper, a bionic optimization algorithm based dimension reduction method named Ant Colony Optimization -Selection （ACO-S） is proposed for high-dimensional datasets. Because microarray datasets comprise tens o...
详细信息
In this paper, a bionic optimization algorithm based dimension reduction method named Ant Colony Optimization -Selection （ACO-S） is proposed for high-dimensional datasets. Because microarray datasets comprise tens of thousands of features （genes）, they are usually used to test the dimension reduction techniques. ACO-S consists of two stages in which two well-known ACO algorithms, namely ant system and ant colony system, are utilized to seek for genes, respectively. In the first stage, a modified ant system is used to filter the nonsignificant genes from high-dimensional space, and a number of promising genes are reserved in the next step. In the second stage, an improved ant colony system is applied to gene selection. In order to enhance the search ability of ACOs, we propose a method for calculating priori available heuristic information and design a fuzzy logic controller to dynamically adjust the number of ants in ant colony system. Furthermore, we devise another fuzzy logic controller to tune the parameter （q0） in ant colony system. We evaluate the performance of ACO-S on five microarray datasets, which have dimensions varying from 7129 to 12000. We also compare the performance of ACO-S with the results obtained from four existing well-known bionic optimization algorithms. The comparison results show that ACO-S has a notable ability to＂ generate a gene subset with the smallest size and salient features while yielding high classification accuracy. The comparative results generated by ACO-S adopting different classifiers are also given. The proposed method is shown to be a promising and effective tool for mining high-dimension data and mobile robot navigation.
In this paper, we propose a novel image retrieval method based on mutual information descriptors (MIDs). Under the physiological property of human eyes and human visual perception theory, MIDs are extracted to encode ...
详细信息
In this paper, a Loop Tightness Algorithm (LTA) is proposed. First, it finds the network loops and calculates it tightness value quickly. Then, it obtains the communities of the networks based on the tightness values....
详细信息
In this paper, a Loop Tightness Algorithm (LTA) is proposed. First, it finds the network loops and calculates it tightness value quickly. Then, it obtains the communities of the networks based on the tightness values. Finally, it reveals the relationship between the network loops and the community structure. The LTA is tested and validated by means of synthetic networks and real networks.
We tackle the problem of improving the helpful actions technique for contingent planning. A revision of the heuristic computation that rearranges the relaxed planning graph is proposed, where the unreasonable conforma...
详细信息
暂无评论