—In this paper a region-adaptive demosaicking algorithm with low computational complexity for single-sensor digital cameras is proposed. The proposed algorithm firstly divides the input image into two kinds of regions and then adopts different interpolation methods for each type. The proposed interpolation method makes full use of bilinear’s fast execution speeds in the smooth region. And it d...

We present first principles calculations of the electronic structure of small carbon nanotubes with different chiral angles theta and different diameters (d<1 nm). Results are obtained with a full potential method based on the density functional theory (DFT), with the local density approximation (LDA). We compare the band structure and density of states (DOS) of chiral nanotubes with those of z...

Given graphs G and H, a mapping f : V (G) → V (H) is a homomorphism if (f(u), f(v)) is an edge of H for every edge (u, v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a...

Inference and optimization of real-value edge variables in sparse graphs are studied using the Bethe approximation and replica method of statistical physics. Equilibrium states of general energy functions involving a large set of real edge variables that interact at the network nodes are obtained in various cases. When applied to the representative problem of network resource allocation, effici...

—In this paper a region-adaptive demosaicking algorithm with low computational complexity for single-sensor digital cameras is proposed. The proposed algorithm firstly divides the input image into two kinds of regions and then adopts different interpolation methods for each type. The proposed interpolation method makes full use of bilinear’s fast execution speeds in the smooth region. And it d...

Relational Over the last two decades, the advances in computer vision and pattern recognition power have opened the door to new opportunity of automatic facial expression recognition system[1]. This paper use Canny edge detection method for facial expression recognition. Image color space transformation in the first place and then to identify and locate human face .Next pick up the edge of eyes...

So-called full line concentration graphs represent a set of random variables by the vertices of an undirected graph. That is, some, but in general not all, pairs of vertices are joined by edges and a missing edge between, say, vertices i and j implies that the corresponding random variables are conditionally independent given all remaining variables. If the joint distribution is multivariate Ga...

Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...

In this paper, we address the challenging problem of recovering the defocus map from a single image. We present a simple yet effective approach to estimate the amount of spatially varying defocus blur at edge locations. The input defocused image is re-blurred using a Gaussian kernel and the defocus blur amount can be obtained from the ratio between the gradients of input and re-blurred images. ...