We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs [5], it takes into account all paths between vertices. Formally, it is defined as d(i, j) = qii+qjj−qij−qji [11], where qij is the (i, j)-entry of the relative forest accessibility matrix Q(ε) = (I + εL)−1, L is the Laplacian matrix of the (weighted) (multi)graph, and ε is a positive...

In dynamic contrast enhanced (DCE) MRI, temporal and spatial resolution can be improved by timeresolved angiography with interleaved stochastic trajectories (TWIST). However, due to view sharing, the temporal resolution of TWIST is not a true one. To overcome this limitation, we employ recently proposed annihilating filter-based low rank Hankel matrix approach (ALOHA) that interpolates the miss...

in this research, the spatial distribution of fe, cu, zn and mn on agricultural lands of golestan province were evaluated using different interpolation methods such as, kriging, inverse distance weighted, local polynomial, inverse multiquadric and radial basis function. thus, 505 soil samples were provided from fields during 2008 and micronutrients rates were measured for each sample. the perfo...

Visualizing very large matrices involves many formidable problems. Various popular solutions to these problems involve sampling, clustering, projection, or feature selection reduce the size and complexity of original task. An important aspect methods is how preserve relative distances between points in higher-dimensional space after reducing rows columns fit a lower dimensional space. This beca...

This paper proposes a steganalysis technique for both grayscale and color images. It uses the feature vectors derived from gray level co-occurrence matrix (GLCM) in spatial domain, which is sensitive to data embedding process. This GLCM matrix is derived from an image. Several combinations of diagonal elements of GLCM are considered as features. There is difference between the features of stego...