1-6hit |
Zi-Yi WANG Shi-Ze GUO Zhe-Ming LU Guang-Hua SONG Hui LI
Many deterministic small-world network models have been proposed so far, and they have been proven useful in describing some real-life networks which have fixed interconnections. Search efficiency is an important property to characterize small-world networks. This paper tries to clarify how the search procedure behaves when random walks are performed on small-world networks, including the classic WS small-world network and three deterministic small-world network models: the deterministic small-world network created by edge iterations, the tree-structured deterministic small-world network, and the small-world network derived from the deterministic uniform recursive tree. Detailed experiments are carried out to test the search efficiency of various small-world networks with regard to three different types of random walks. From the results, we conclude that the stochastic model outperforms the deterministic ones in terms of average search steps.
Jia-Rui LIU Shi-Ze GUO Zhe-Ming LU Fa-Xin YU Hui LI
In complex network analysis, there are various measures to characterize the centrality of each node within a graph, which determines the relative importance of each node. The more centrality a node has in a network, the more significance it has in the spread of infection. As one of the important extensions to shortest-path based betweenness centrality, the flow betweenness centrality is defined as the degree to which each node contributes to the sum of maximum flows between all pairs of nodes. One of the drawbacks of the flow betweenness centrality is that its time complexity is somewhat high. This Letter proposes an approximate method to calculate the flow betweenness centrality and provides experimental results as evidence.
Shi-Ze GUO Zhe-Ming LU Zhe CHEN Hao LUO
This Letter defines thirteen useful correlation measures for directed weighted complex network analysis. First, in-strength and out-strength are defined for each node in the directed weighted network. Then, one node-based strength-strength correlation measure and four arc-based strength-strength correlation measures are defined. In addition, considering that each node is associated with in-degree, out-degree, in-strength and out-strength, four node-based strength-degree correlation measures and four arc-based strength-degree correlation measures are defined. Finally, we use these measures to analyze the world trade network and the food web. The results demonstrate the effectiveness of the proposed measures for directed weighted networks.
Guang-Yu KANG Shi-Ze GUO De-Chen WANG Long-Hua MA Zhe-Ming LU
This Letter presents a new feature named structured local binary Kirsch pattern (SLBKP) for image retrieval. Each input color image is decomposed into Y, Cb and Cr components. For each component image, eight 33 Kirsch direction templates are first performed pixel by pixel, and thus each pixel is characterized by an 8-dimenional edge-strength vector. Then a binary operation is performed on each edge-strength vector to obtain its integer-valued SLBKP. Finally, three SLBKP histograms are concatenated together as the final feature of each input colour image. Experimental results show that, compared with the existing structured local binary Haar pattern (SLBHP)-based feature, the proposed feature can greatly improve retrieval performance.
Shi-Ze GUO Zhe-Ming LU Guang-Yu KANG Zhe CHEN Hao LUO
Small-world is a common property existing in many real-life social, technological and biological networks. Small-world networks distinguish themselves from others by their high clustering coefficient and short average path length. In the past dozen years, many probabilistic small-world networks and some deterministic small-world networks have been proposed utilizing various mechanisms. In this Letter, we propose a new deterministic small-world network model by first constructing a binary-tree structure and then adding links between each pair of brother nodes and links between each grandfather node and its four grandson nodes. Furthermore, we give the analytic solutions to several topological characteristics, which shows that the proposed model is a small-world network.
Yong ZHANG Shi-Ze GUO Zhe-Ming LU Hao LUO
Reversible data hiding has been a hot research topic since both the host media and hidden data can be recovered without distortion. In the past several years, more and more attention has been paid to reversible data hiding schemes for images in compressed formats such as JPEG, JPEG2000, Vector Quantization (VQ) and Block Truncation Coding (BTC). Traditional data hiding schemes in the BTC domain modify the BTC encoding stage or BTC-compressed data according to the secret bits, and they have no ability to reduce the bit rate but may reduce the image quality. This paper presents a novel reversible data hiding scheme for BTC-compressed images by further losslessly encoding the BTC-compressed data according to the secret bits. First, the original BTC technique is performed on the original image to obtain the BTC-compressed data which can be represented by a high mean table, a low mean table and a bitplane sequence. Then, the proposed reversible data hiding scheme is performed on both the high mean table and low mean table. Our hiding scheme is a lossless joint hiding and compression method based on 22 blocks in mean tables, thus it can not only hide data in mean tables but also reduce the bit rate. Experiments show that our scheme outperforms three existing BTC-based data hiding works, in terms of the bit rate, capacity and efficiency.