• Journal of Korea Multimedia Society
• /
• v.12 no.8
• /
• pp.1066-1072
• /
• 2009

This paper proposes a method to reduce the complexity and improve the performance for gentle-slope edges which is the disadvantage of deinterlacing algorithm using the new edge-directed interpolation. To improve the performance for gentle-slope edges, the proposed algorithm increases the number of neighboring reference pixels. To reduce the artifacts and the computational complexity, the proposed algorithm adaptively determines the number of neighboring reference pixels. With computer simulations for a variety of images, it shows that the proposed algorithm provides improved performance in PSNR and subjective evaluation compared with the existing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.241-248
• /
• 2007

In predictive image coding, a LS (Least Squares)-based adaptive predictor is an efficient method to improve image edge predictions. This paper proposes a hybrid interpolation with weighted edge detector. A hybrid approach of switching between bilinear interpolation and EDI (Edge-Directed Interpolation) is proposed in order to reduce the overall computational complexity The objective and subjective quality is also similar to the bilinear interpolation and EDI. Experimental results demonstrate that this hybrid interpolation method that utilizes a weighted edge detector can achieve reduction in complexity with minimal degradation in the interpolation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.63-73
• /
• 1988

In this paper, an algorithm is proposed to evaluate the source-to-terminal reliability, the probability that a source node can communicate with a terminal node, in a probabilistic derected graph. By using Satyanaratana's factoring $theorem^{(7)}$, the original graph can be partitioned into two reduced graphs obtained by contracting and deleting the edge connected to the source node in the probabilistic directed graph. The edge removal proposed in this paper and the general series-parallel reduction can then be applied to the reduced graph. This edge reduction can be applied recursively to the reduced graphs until a source node can be connected to a terminal node by one edge. A computer program which can be applied to evaluating the source-to-terminal reliability in a complex and large network has also been developed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.111-119
• /
• 2009

This paper presents an adaptive image interpolation algorithm using local characteristics. An input image is classified into edge region and flat low frequency region. And then, the edge region is further partitioned into directive edge region and high frequency texture region. A bilinear interpolation is applied to flat low frequency region, cubic convolution is applied to texture region, and new edge directed interpolation to directive edge region, respectively. Simulation results show that the proposed algorithm outperforms the existing interpolation methods in terms of visual quality as well as PSNR.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.619-630
• /
• 2013

In this paper, we propose an edge directed color demosaicing algorithm considering color channel correlation. The proposed method consists of local region classification step and edge directional interpolation step. In the first step, each region of a given Bayer image is classified as normal edge, pattern edge, and flat regions by using intra channel and inter channel gradients. Especially, two criteria and verification process for the normal edge and pattern edge classification are used to reduce edge direction estimation error, respectively. In the second step, edge directional interpolation process is performed according to characteristics of the classified regions. For horizontal and vertical directional interpolations, missing color components are obtained from interpolation equations based on intra channel and inter channel correlations in order to improve the performance of the directional interpolations. The simulation results show that the proposed algorithm outperforms conventional approaches in both objective and subjective terms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1C
• /
• pp.140-148
• /
• 2004

Natural images can be classified into edge or flat region. Edges have also various shapes such as long edge, texture and so on. Because the conventional deinterlacing methods commonly use one specific algorithm, they are faced with the difficulty that does not adapt various shapes of images. In this paper, a selective deinterlacing method based on the characteristics of local region of image is proposed. An input image is classified into three regions; flat region, complex edge, long edge. And then for each region, the proper method is assigned according to the characteristic of the local feature. For long edge region, the modified $NEDI(New Edge Directed Interpolation)^{[1]}$ method that interpolates long edge very well is used. The linear $filter^{[2]}$ that enhances high frequency components is used for complex edge, and the bilinear interpolation method is applied to flat region. The proposed method shows improved performance in PSNR and subjective evaluation compared with previous algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.53-61
• /
• 2010

In this paper, we present a color interpolation algorithm that uses novel edge direction estimator and region classifier. The proposed edge direction estimator accurately determines the edge direction based on the correlation between the images obtained by the channel separated and down-sampled Bayer color filter array(CFA) pattern. The correlation is defined based on the similarity between the edge direction in the local region of the image and the shifting direction of the images. Also, the region of an image is defined as the flat, the edge, and the pattern-edge regions, where the edges are appeared repeatedly. When all the pixels in the image are classified into the three different regions, each pixel is interpolated horizontally or vertically according to the estimated direction. Experimental results show that the proposed algorithm outperforms the conventional edge-directed methods on objective and subjective criteria.

• Cross-Cultural Studies
• /
• v.19
• /
• pp.205-232
• /
• 2010

The purpose of this paper is to examine the possibility of application of some French and German movies to teaching of multi-culture in elementary, middle and high schools. Three different films are selected. (2005), a French animation film directed by B?n?dicte Galup and Michel Ocelot, is appropriate for the education of understanding cultural relativity and improving multi-cultural sensitivity in elementary school. is a French short film directed by Walter Salles and Daniela Thomaso and included in omnibus style film (2006). This short film relating a story of an immigrated woman who leaves her baby in a cr?che and travels through Paris to work for a bourgeois mother can be used for developing a bond of sympathy between natives and immigrants. It is recommended for the class of junior high school. Finally (2007), a German film directed by Fatih Akin, provide a learning model for the education of multi-culture in high school classrooms. The cinematographic aesthetic of this film is focused on a process of reconciliation with others over the cultural, racial, national and generational differences. Analyzing the structure of the film and being guided by teachers the students can understand better in improving abilities to understand others.

• Journal of Korea Multimedia Society
• /
• v.22 no.2
• /
• pp.210-224
• /
• 2019

Given a positive integer k as input, a spatial preference query finds the k best data objects based on the scores (e.g., qualities) of feature objects in their spatial neighborhoods. Several solutions have been proposed for spatial preference queries in Euclidean space. A few algorithms study spatial preference queries in undirected spatial networks where each edge is undirected and the distance between two points is the length of the shortest path connecting them. However, spatial preference queries have not been thoroughly investigated in directed spatial networks where each edge has a particular orientation that makes the distance between two points noncommutative. Therefore, in this study, we present a new method called ALPS+ for processing spatial preference queries in directed spatial networks. We conduct extensive experiments with different setups to demonstrate the superiority of ALPS+ over conventional solutions.

• Kyungpook Mathematical Journal
• /
• v.50 no.1
• /
• pp.89-100
• /
• 2010

Let g = (V, E, ${\mu}$) be a weighted directed tree, where V is a vertex set, E is an edge set, and ${\mu}$ is ${\sigma}$-finite measure on V. The tree g induces a composition operator C on the Hilbert space $l^2$(V). Hand-type directed trees are defined and characterized the weak hyponormalities of such C in this note. Also some additional related properties are discussed. In addition, some examples related to directed hand-type trees are provided to separate classes of weak-hyponormal operators.