RATE-CONSISTENT DIRECTIONLET CODESTREAM CREATED BY MODIFIED BFOS ALGORITHM

In order to improve the bit allocation efficiency of Directionlet coding,a modified Breiman,Friedman,Olshen and Stone(BFOS) algorithm is suggested for rate consistent truncation.Two modifications are:(1) Dominant direction adjustment is proposed to balance the cost of sparse description and segment artifacts caused by discontinuous adjacent direction pairs.(2) Priority related merging is also proposed in the BFOS distortion list to find an optimal trimming element for unequal-importance bit allocation.Experimental results show that block effects could be removed without obvious bpp increment by selecting the dominant direction and its adjustment according to neighborhood homogeneity,and combined multi-PRIority(PRI) based merging of the M-ordered list offers unequal importance allocation and leads to a Peak Signal-to-Noise Ratio(PSNR) gain of 0.4 dB～1.3 dB.

A method of determining dominant wave direction from multipara-meter hydrological gauge measurements and its application

Multi-parameter hydrological gauge is an instrument developed by the South China Sea Institute of Oceanology, the Chinese Academy of Sciences to make simultaneous observation of current, wave, tide, water temperature and conductivity. By using the well-known ＂PUV method＂, the directional wave spectrum can be calculated and the dominant wave direction is then obtained. The comparison of the dominant wave directions derived from the measurements using both the multi-parameter hydrological gauge and the MARK Ⅱ ＂Wave-Rider＂ directional buoy shows that the dominant wave directions derived from the two kinds of measurements are in good agreement.

Stress Wave Propagation Analysis on Vortex-Induced Vibration of Marine Risers

To analyze the stress wave propagation associated with the vortex-induced vibration（VIV） of a marine riser, this paper employed a multi-signal complex exponential method. This method is an extension of the classical Prony＇s method which decomposes a complicated signal into a number of complex exponential components. Because the proposed method processes multiple signals simultaneously, it can estimate the “global” dominating frequencies（poles） shared by those signals.The complex amplitude（residues） corresponding to the estimated frequencies for those signals is also obtained in the process. As the signals were collected at different locations along the axial direction of a marine riser, the phenomena of the stress wave propagation could be analyzed through the obtained residues of those signals. The Norwegian Deepwater Program（NDP） high mode test data were utilized in the numerical studies, including data sets in both the in-line（IL） and cross-flow（CF） directions. It was found that the most dominant component in the IL direction has its stress wave propagation along the riser being dominated by a standing wave, while that in the CF direction dominated by a traveling wave.

On (t, r) Broadcast Domination of Directed Graphs

A dominating set of a graph G is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of G is the order of a minimum dominating set of G. The (t, r) broadcast domination is a generalization of domination in which a set of broadcasting vertices emits signals of strength t that decrease by 1 as they traverse each edge, and we require that every vertex in the graph receives a cumulative signal of at least r from its set of broadcasting neighbors. In this paper, we extend the study of (t, r) broadcast domination to directed graphs. Our main result explores the interval of values obtained by considering the directed (t, r) broadcast domination numbers of all orientations of a graph G. In particular, we prove that in the cases r = 1 and (t, r) = (2, 2), for every integer value in this interval, there exists an orientation of G which has directed (t, r) broadcast domination number equal to that value. We also investigate directed (t, r) broadcast domination on the finite grid graph, the star graph, the infinite grid graph, and the infinite triangular lattice graph. We conclude with some directions for future study.

Dominant edge direction based fast intra mode decision in the H.264/AVC encoder

The H.264/AVC video coding standard uses an intra prediction mode with 4×4 and 16×16 blocks for luma and 8×8 blocks for chroma. This standard uses the rate distortion optimization (RDO) method to determine the best coding mode based on the compression performance and video quality. This method offers a large improvement in coding efficiency compared to other compression standards, but the computational complexity is greater due to the various intra prediction modes. This paper proposes a fast intra mode decision algorithm for real-time encoding of H.264/AVC based on the dominant edge direction (DED). The DED is extracted using pixel value summation and subtraction in the horizontal and vertical directions. By using the DED, three modes instead of nine are chosen for RDO calculation to decide on the best mode in the 4×4 luma block. For the 16×16 luma and the 8×8 chroma, only two modes are chosen instead of four. Experimental results show that the entire encoding time saving of the proposed algorithm is about 67% compared to the full intra search method with negligible loss of quality.

Directed Dominating Set Problem Studied by Cavity Method:Warning Propagation and Population Dynamics

The minimal dominating set for a digraph(directed graph) is a prototypical hard combinatorial optimization problem. In a previous paper, we studied this problem using the cavity method. Although we found a solution for a given graph that gives very good estimate of the minimal dominating size, we further developed the one step replica symmetry breaking theory to determine the ground state energy of the undirected minimal dominating set problem. The solution space for the undirected minimal dominating set problem exhibits both condensation transition and cluster transition on regular random graphs. We also developed the zero temperature survey propagation algorithm on undirected Erds-Rnyi graphs to find the ground state energy. In this paper we continue to develope the one step replica symmetry breaking theory to find the ground state energy for the directed minimal dominating set problem. We find the following.(i) The warning propagation equation can not converge when the connectivity is greater than the core percolation threshold value of 3.704. Positive edges have two types warning, but the negative edges have one.(ii) We determine the ground state energy and the transition point of the Erd?os-R′enyi random graph.(iii) The survey propagation decimation algorithm has good results comparable with the belief propagation decimation algorithm.

Bridging the semantic gap with human perception based features for scene categorization

Purpose–The purpose of this paper is to build a classification system which mimics the perceptual ability of human vision,in gathering knowledge about the structure,content and the surrounding environment of a real-world natural scene,at a quick glance accurately.This paper proposes a set of novel features to determine the gist of a given scene based on dominant color,dominant direction,openness and roughness features.Design/methodology/approach–The classification system is designed at two different levels.At the first level,a set of low level features are extracted for each semantic feature.At the second level the extracted features are subjected to the process of feature evaluation,based on inter-class and intra-class distances.The most discriminating features are retained and used for training the support vector machine(SVM)classifier for two different data sets.Findings–Accuracy of the proposed system has been evaluated on two data sets:the well-known Oliva-Torralba data set and the customized image data set comprising of high-resolution images of natural landscapes.The experimentation on these two data sets with the proposed novel feature set and SVM classifier has provided 92.68 percent average classification accuracy,using ten-fold cross validation approach.The set of proposed features efficiently represent visual information and are therefore capable of narrowing the semantic gap between low-level image representation and high-level human perception.Originality/value–The method presented in this paper represents a new approach for extracting low-level features of reduced dimensionality that is able to model human perception for the task of scene classification.The methods of mapping primitive features to high-level features are intuitive to the user and are capable of reducing the semantic gap.The proposed feature evaluation technique is general and can be applied across any domain.

Statistical mechanics of the directed 2-distance minimal dominating set problem

The directed L-distance minimal dominating set(MDS) problem has wide practical applications in the fields of computer science and communication networks. Here, we study this problem from the perspective of purely theoretical interest. We only give results for an Erdós Rényi(ER)random graph and regular random(RR) graph, but this work can be extended to any type of network. We develop spin glass theory to study the directed 2-distance MDS problem. First, we find that the belief propagation(BP) algorithm does not converge when the inverse temperatureβ exceeds a threshold on either an ER random network or RR network. Second, the entropy density of replica symmetric theory has a transition point at a finite β on a regular random graph when the arc density exceeds 2 and on an ER random graph when the arc density exceeds3.3;there is no entropy transition point(or β = ■) in other circumstances. Third, the results of the replica symmetry(RS) theory are in agreement with those of BP algorithm while the results of the BP decimation algorithm are better than those of the greedy heuristic algorithm.