• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.5
• /
• pp.54-63
• /
• 2007

The purpose of this study is to present a new energy minimization method for image completion with hierarchical approach. The goal of image completion is to fill in missing part in a possibly large region of an image so that a visually plausible outcome is obtained. An exemplar-based Markov Random Field Modeling(MRF) is proposed in this paper. This model can deal with following problems; detection of global features, flexibility on environmental changes, reduction of computational cost, and generic extension to other related domains such as image inpainting. We use the Priority Belief Propagation(Priority-BP) which is a kind of Belief propagation(BP) algorithms for the optimization of MRF. We propose the hierarchical Priority-BP that reduces the number of nodes in MRF and to apply hierarchical propagation of messages for image completion. We show that our approach which uses hierarchical Priority-BP algorithm in image completion works well on a number of examples.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.103-112
• /
• 1998

This paper proposes a propagation prediction model which can calculate a propagation path loss easily at option point in case of the propagation processing by repeat reflection when we analysis a propagation route, it makes the calculation speed which is the defect of a geometrical of image method and a ray-launching method improve and we develop and apply the algorithms which can do an angle of incidence, an angle of reflection with a propagation direct path, a reflection path and a maximum reflection number arithmetic process synchronously. Finally we choose as a sample which is the real road condition where is around SK telecoms chunnam branch office in wolgok-dong, kwangsan-ku, kwangju and simulate proposition model then we demonstrate the relative superiority with comparing the results.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.49-61
• /
• 1996

Back-propagation(BP) algorithm needs a lot of time to train the artificial neural network (ANN) to get high accuracy level in classification tasks. So there have been extensive researches to process back-propagation algorithm on parallel processors. This paper prsents a linear systolic array which calculates forward-backward propagation of BP algorithm at the same time using effective space-time transformation and PE structure. First, we analyze data flow of forwared and backward propagations and then, represent the BP algorithm into data dapendency graph (DG) which shows parallelism inherent in the BP algorithm. Next, apply space-time transformation on the DG of ANN is turn with orthogonal direction projection. By doing so, we can get a snakelike systolic array. Also we calculate the interval of input for parallel processing, calculate the indices to make the right datas be used at the right PE when forward and bvackward propagations are processed in the same PE. And then verify the correctness of output when forward and backward propagations are executed at the same time. By doing so, the proposed system maximizes parallelism of BP algorithm, minimizes th enumber of PEs. And it reduces the execution time by 2 times through making idle PEs participate in forward-backward propagation at the same time.

• 전자공학회논문지 IE
• /
• v.46 no.1
• /
• pp.31-36
• /
• 2009

This study was to simulate it that the sending receiving vehicles run on the general national roads with the one-way two-lanes at 80[km/h] speed. This study was to select 280[m] radius of curvature based on the statistical data with high rate of traffic accidents, 140[m] length of direct roads considering the stopping stadia, 90[m] length of curve, and 8 points of curved roads at 11.25[m] intervals. As a result above, when the distance between the sending and receiving vehicles became more than 111[m], the propagation path of reflected wave by the adjacent vehicles became longer than the propagation path of reflected wave by the left/right reflectors because the number of repeated reflection increased. In this study, the repeated reflection for the propagation's reach to the receiving vehicles was about $1{\sim}2$[times] as it supposed it less than 111[m]. Accordingly, it found out that the propagation path of reflected wave received through the left/right reflectors was about $1{\sim}1.5[m]$ larger than the reflected wave produced by the adjacent vehicles regardless of lanes on which the sending and receiving vehicles were located.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.9
• /
• pp.898-902
• /
• 2015

Alternative radio-navigation technologies aim at providing continuous navigation solution even if one cannot use GNSS (Global Navigation Satellite System). In shadowing region such as indoor environment, GNSS signal is no longer available and the alternative navigation system should be used together with GNSS to provide seamless positioning. For soldiers in battlefield where GNSS signal is jammed or in street battle, the alternative navigation system should work without positioning infrastructure. Moreover, the radio-navigation system should have scalability as well as high accuracy performance. This paper presents a TWR (Two-Way-Ranging)-based cooperative positioning system (CPS) that does not require location infrastructure. It is assumed that some members of CPS can obtain GNSS-based position and they are called mobile anchors. Other members unable to receive GNSS signal compute their position using TWR measurements with mobile anchors and neighboring members. Error propagation in CPS is analytically studied in this paper. Error budget for TWR measurements is modeled first. Next, location error propagation in CPS is derived in terms of range errors. To represent the location error propagation in the CPS, Location Error Propagation Indicator (LEPI) is proposed in this paper. Simulation results show that location error of tags in CPS is mainly influenced by the number of hops from anchors to the tag to be positioned as well as the network geometry of CPS.

• Journal of Korea Spatial Information System Society
• /
• v.4 no.1 s.7
• /
• pp.5-14
• /
• 2002

The generalization of geospatial data is an important way in deriving a new database from an original one. The generalization of a geospatial object changes not only its geometric and aspatial attributes but also results in propagation to other objects along their relationship. We call it generalization propagation of geospatial databases. Without proper handling of the propagation, it brings about an inconsistent database or loss of semantics. Nevertheless, previous studies in the generalization have focused on the derivation of an object by isolating it from others. And they have proposed a set of generalization operators, which were intended to change the geometric and aspatial attributes of an object. In this paper we extend the definition of generalization operators to cover the propagation from an object to others. In order to capture the propagation, we discover a set of rules or constraints that must be taken into account during generalization procedure. Each generalization operator with constraints is expressed in relational algebra and it can be converted to SQL statements with ease. A prototype system was developed to verify the correctness of extended operators.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.944-947
• /
• 1998

오늘날 항만에서의 컨테이너 처리를 하지 못하고 있는 가운데 자동화 처리를 위해서는 식별자의 인식이 가장 큰 문제점을 해결하기 위해 항만에서 컨테이너의 식별자 인식에 신경망 알고리즘의 하나인 back-propagation을 사용하여 기존의 식별자 인식 방법보다 신속하고 정확한 처리가 가능하도록 구현하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.141-145
• /
• 1998

This paper CMOS full adder design method based on carry-propagation-free addition trees and a circuit technique, so called multiple-valued current-mode (MVCM) circuits. The carry-paopagation-free addition method uses a redundant digit sets called redundant positive-digit number representations. The carry-propagation-free addition is by three steps, and the adder can be designed directly and efficiently from the algorithm using MVCM circuit. We demonstrate the effectiveness of the proposed method through simulation(SPICE).

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.327-329
• /
• 1998

Up-Propagation is an algorithm for inverting and learning neural network generative models. Sensory input is processed by inverting a model that generates patterns from hidden variables using top-down connections. The inversion process is iterative, utilizing a negative feedback loop that depends on an error signal propagated by bottom-up connections. The error signal is also used to learn the generative model from examples. the algorithm is benchmarked against principal component analysis in experiments on images of handwritten digits.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.267-268
• /
• 2007

A dynamic range compression algorithm using Markov random field (MRF) modeling to display high dynamic range (HDR) images on low dynamic range (LDR) devices is proposed in this work. The proposed algorithm separates foreground objects from the background using the edge information, and then compresses the color differences across the edges based on the MRF modeling. By minimizing a cost function using belief propagation, the proposed algorithm can provide an effective LDR image. Simulation results show that the proposed algorithm provides good results.