• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.342-356
• /
• 2009

This paper presents a vote decision-based deinterlacing scheme for false directional error correction(VDD) to convert interlaced signal into non-interlaced signal using only one fields. The VDD using the vote decision goes through four steps process. The first step extracts regions having doubt of false edge using MM-ELA method. In these regions, the edge direction is decided by the majority vote using upper adjacent pixels's information through the second step. But, we still have undecided directions, which will be decided by the majority vote and the directional average decision at the third step. This step preserves the edge directions and minimizes visual degradation. Finally, the last step interpolates undecided pixels using DOI method which can consider the fine edge direction. Although the VDD with hierarchical structure has a high complexity, it can extract delicate edge compared to other pixel-by-pixel or window-by-window deinterlacing algorithms. Simulation results show that it has significantly improved both the subjective and objective qualities of the reconstructed images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3638-3657
• /
• 2022

In urban vehicular edge computing (VEC) environments, one edge server always serves many task requests in its coverage which results in the resource-constrained problem. To resolve the problem and improve system utilization, we first design a general hierarchical resource management framework based on typical VEC network structures. Following the framework, a specific interacting protocol is also designed for our decision algorithm. Secondly, a greedy bidding-based multi-hop task scheduling decision algorithm is proposed to realize effective task scheduling in resource-constrained VEC environments. In this algorithm, the goal of maximizing system utility is modeled as an optimization problem with the constraints of task deadlines and available computing resources. Then, an auction mechanism named greedy bidding is used to match task requests to edge servers in the case of multiple hops to maximize the system utility. Simulation results show that our proposal can maximize the number of tasks served in resource constrained VEC networks and improve the system utility.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.273-273
• /
• 2000

We present a new scheme to increase the performance of edge-preserving image smoothing from the parameter tuning of a Markov random field (MRF) function. The method is based on automatic control of the image smoothing-strength in MRF model ing in which an introduced parameter function is based on control of enforcing power of a discontinuity-adaptive Markov function and edge magnitude resulted from discontinuities of image intensity. Without any binary decision for the edge magnitude, adaptive control of the enforcing power with the full edge magnitude could improve the performance of discontinuity-preserving image smoothing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.778-786
• /
• 2008

The H.264/AVC video coding standard shows superior coding efficiency by adopting many new techniques. However, the encoding complexity increases greatly to achieve higher coding efficiency. Especially, the rate distortion optimization technique, which is used to decide the intra-prediction mode, increases the encoding complexity. In this paper, we propose an efficient intra-prediction mode decision method. By using the variance of pixel values and the edge direction, the computational complexity of the intra-prediction mode decision is greatly reduced.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.75-81
• /
• 2014

In a distribution of the digital image, there is a serious problem that is distributed an illegal forgery image by pirates. For the problem solution, this paper proposes an image forensic decision algorithm using an edge energy information of forgery image. The algorithm uses SA (Streaking Artifacts) and SPAM (Subtractive Pixel Adjacency Matrix) to extract the edge energy informations of original image according to JPEG compression rate(QF=90, 70, 50 and 30) and the query image. And then it decides the forge whether or not by comparing the edge informations between the original and query image each other. According to each threshold in TCJCR (Threshold by Combination of JPEG Compression Ratios), the matching of the edge informations of original and query image is excused. Through the matching experiments, TP (True Positive) and FN (False Negative) is 87.2% and 13.8% respectively. Thus, the minimum average decision error is 0.1349. Also, it is confirmed that the performed class evaluation of the proposed algorithm is 'Excellent(A)' because of the AUROC (Area Under Receiver Operating Characteristic) curve is 0.9388 by sensitivity and 1-specificity.

• Journal of Korea Multimedia Society
• /
• v.13 no.10
• /
• pp.1463-1473
• /
• 2010

In this paper, we propose a modified watershed algorithm to extract more correct edge and reduce processing time. Two new algorithms are proposed in this paper. The first one is applying two conventional watershed expansion methods known as rainfall and immersion simulation jointly. We analyze the advantage and problem of each simulation and then propose a new expansion method that keeps the advantage and removes the problem in order to extract more correct edge and reduce processing time. The second is a new priority decision algorithm to obtain more correct edge of a region. Some zero-crossing points of gradient are expected to be edge of a region but the conventional method has a limitation that it cannot extract those points as edge. Therefore we propose a new priority decision algorithm for watershed in order to get more correct edge. We compare the proposed method with the conventional method through experiments and prove that the proposed method can extract more correct edge of region.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.154-163
• /
• 2014

In this paper, there is suggested a fast intra prediction mode decision method in HEVC. To reduce the number of candidates in rough mode decision (RMD) process and rate-distortion optimization (RDO) process, the edge information and relative RMD cost are utilized. The experiment results show that the proposed method reduces encoding run-time by 26.81% with a negligible coding loss of 0.79% BD-rate on average.

• Journal of IKEEE
• /
• v.1 no.1 s.1
• /
• pp.111-119
• /
• 1997

This paper presented a method of extracting algorithm for Edge Multiple-Valued Decision Diagrams(EMVDD), a new data structure, from Binary Decision Diagram(BDD) which is resently used in constructing the digital logic systems based on the graph theory. And we discussed the function minimization method of the n-variables multiple-valued functions. The proposed method has the visible, schematical and regular properties.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.69-78
• /
• 1998

This paper presented a method of extracting algorithm for Edge Multiple-Valued Decision Diagrams(EMVDD), a new data structure, from Binary Decision Diagram(BDD) which is resently using in constructing the digital logic systems based on the graph theory. We discussed the function minimization method of the n-variables multiple-valued functions and showed that the algorithm had the regularity with module by which the same blocks were made concerning about the schematic property of the proposed algorithm. We showed the EMVDD of Full Adder by module construction and verified the proposed algorithm by examples. The proposed method has the visible, schematical and regular properties.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.2
• /
• pp.119-129
• /
• 2006

Art psychotherapy is widely accepted as an effective tool for diagnosis and treatment of psychological disorders. Important factors for art psychotherapy diagnosis, based on the projection theory that the world of the inner mind appears in drawings, include main color and imbalance of a drawing. This paper develops a system for a machine to determine the main color and the imbalance of a drawing by color recognition and edge detection. Our proposed color recognition procedure adopts NBS(National Bureau of Standards) distance between colors in HVC(Hue, Value, Chroma) color space which is most similar to the human eye's color perception. Our edge detection procedure applies blurring, clustering and transformation to a standard color in a series. Our system considers the numbers of pixels and clusters for each color as a criterion for main color and the frequency of edge coordinates for each region for imbalance. The proposed machine procedure, verified through case studies, can help overcome the subjectivity, ambiguity and uncertainty in human decision involved in art psychotherapy.