SUMMARYThis 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 3 × 3 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. key words: image retrieval, structured local binary Haar pattern, structured local binary Kirsch pattern

No abstract

Dynamic Time Warping (DTW) is a kind of simple and efficient method in speech identification. The human pronounces with variable pitch period at different time. Speech parameter extraction with fixed-length window will cause error discrimination to some extent because of different signal period in windows. Sliding windows with variable length is to select sliding windows with different length according to the variation of the pitch period of the speech signal in order that each window contains speech signals with identical period. Speech segmentation via sliding windows with variable length can eliminate the errors caused by the difference of speech signals contained in each window. Experimental results verify the improvement on the precision of speech identification.

No abstract

SUMMARYSmall-world is a common property existing in many reallife 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. key words: deterministic small-world models, tree-structured network, Interconnection network, average path length, clustering coefficient