• 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.

• Journal of Korea Multimedia Society
• /
• v.17 no.2
• /
• pp.132-142
• /
• 2014

Stereo camera is drawing attention as an essential sensor for future intelligence robot system since it has the advantage of acquiring not only distance but also other additive information for an object. However, it cannot match correlated point on target image for low textured region or periodic patterned region such as wall of building or room. In this paper, we propose a stereo matching technique that increase the matching performance by fusing belief propagation stereo matching algorithm and local distance measurements of 2D-laser range finder in order to overcome this kind of limitation. The proposed technique adds laser measurements by referring quad-tree based segment information on to the local-evidence of belief propagation stereo matching algorithm, and calculates compatibility function by reflecting over-segmented information. Experimental results of the proposed method using simulation and real test images show that the distance information for some low textured region can be acquired and the discontinuity of depth information is preserved by using segmentation information.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.5
• /
• pp.503-510
• /
• 2016

In this paper I analyzed two decoding algorithms of decentralized LT codes for distributed storage by simulations in small-scale wireless sensor network. From the simulation results we can see that when the decoding ration is above 2.0, the successful decoding probability of OBP decoding is about 99%, while that of BP decoding is below 50% with n=100, and about 70% with n=200. We showed that OBP decoding algorithm is an efficient decoding scheme for decentralized LT codes for distributed storage in small-scale wireless sensor network.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.931-932
• /
• 2008

An implementation of modified stereo matching using efficient belief propagation(BP) algorithm is presented in this paper. Edges of the image were found using conventional edge detection algorithms. Resulting edge information is used to suppress propagation of wrong probabilistic information. Proposed method can effectively reduce errors that incurred by ambiguous scene properties.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.2
• /
• pp.123-126
• /
• 2010

An implementation of modified stereo matching using efficient belief propagation (BP) algorithm is presented in this paper. We do recommend the use of the simple sobel, prewitt edge operator. The application of B band sobel edge operator over image demonstrates result with somewhat noisy (distinct border). When we adopt the only MRF + BP algorithm, however, borders cannot be distinguished due to that the message functions in the BP algorithm is just the mechanism which passes energy data to the only large gap of each Message functions In order to address the abovementioned disadvantageous phenomenon, we use the sobel edge operator + MRF + BP algorithm to distinguish the border that is located between the similar message data. Using edge information, the result shows that our proposed process diminishes the propagation of wrong probabilistic information. The enhanced result is due to that our proposed method effectively reduced errors incurred by ambiguous scene properties.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.3
• /
• pp.51-56
• /
• 2005

To improve the BER of OFDM on a fading channel, a low-density parity check coded OFDM system is proposed in this paper. LDPC codes are decoded with Sum-Product or Belief Propagation Algorithm known by probability propagation algorithm. When LDPC codes are applied to OFDM system, the BER performance is dependant on the iteration number of decoding. To improve the spectral efficiency, multi-level modulations are used in mobile communication system. But, It is not clear how to decode LDPC code used in OFDM with multi-level modulations. In the paper, a decoding algorithm is described for LDPC coded OFDM with MPSK. When use the proposed decoding algorithm, we get the good BER for AWGN and a Fading Channel. Simulation results show that the proposed decoding algorithm is confirmed LDPC coded OFDM with MPSK.

• Korean Journal of Cognitive Science
• /
• v.4 no.1
• /
• pp.261-294
• /
• 1993

Most of expert systems,as a rule-based system,should be convenient to modify a rule and to insert a new rule, which is called modularity of rules. When we think correlated evidences in expert systems. conventional systems are too local to recognize the common origin of the information, and they would update the belief of the hypothesis as if it were supposed by independence soureces. In this paper to overcome such drawbacks we propose Fuzzy Belief Network which is based on the Beysian Network which provide the modulartiy between rules. To build Fuzzy Belief Network, we define nodes and links and propose algorithms for data fusion in individual node and for propagation belief value obtained as a result of data fusion.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.113-116
• /
• 2008

본 논문에서는 다시점 비디오(multi-view video)에서 보다 다양한 시점을 제공하기 위한 가상 시점 비디오 생성 기법을 제안한다. 제안하는 가상 시점 비디오 생성 기법은 우선적으로 대칭적 신뢰 전파 기법(symmetric belief propagation)을 기반으로, 각 시점의 깊이 정보 및 폐색 영역(occlusion region)을 추출하기 위해서 에너지를 최소화한다. 추출된 깊이 정보 및 에너지를 이용하여 참조하는 시점 간의 가중치를 적용하여, 새로운 가상 시점의 비디오를 생성하고, 추출된 폐색 영역의 값을 이용하여, 가상 시점의 비디오를 보정하는 가상 시점 비디오 생성 기법을 제안한다. 또한 제안하는 알고리즘을 한정된 중간 시점 영상에서 임의의 가상 시점으로 확장하여, 임의의 두 시점 간의 자유로운 시점(free-view point)을 제공함을 확인한다. 실험을 통하여 제안하는 기법이 다시점 비디오에서 높은 화질의 가상 시점 비디오를 제공함을 확인한다.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.1
• /
• pp.53-57
• /
• 2010

Low-density parity-check (LDPC) codes with belief-propagation (BP) algorithm achieve a remarkable performance close to the Shannon limit at reasonable decoding complexity. Conventionally, each iteration in decoding process contains two steps, the horizontal step and the vertical step. In this paper, an efficient implementation of the adaptive offset min-sum (AOMS) algorithm for decoding LDPC codes using the single-step method is proposed. Furthermore, the performances of the AOMS algorithm compared with belief-propagation (BP) algorithm are investigated. The algorithms using the single-step method reduce the implementation complexity, speed up the decoding process and have better efficiency in terms of memory requirements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5401-5421
• /
• 2016

Both low-density parity-check (LDPC) codes and the multiple access technique of spatially coupling data transmission (SCDT) can be expressed in bipartite graphs. To improve the performance of iterative demodulation and decoding for SCDT, a novel joint sparse graph (JSG) with SCDT and LDPC codes is constructed. Based on the JSG, an approach for iterative joint demodulation and decoding by belief propagation (BP) is presented as an exploration of the flooding schedule, and based on BP, density evolution equations are derived to analyze the performance of the iterative receiver. To accelerate the convergence speed and reduce the complexity of joint demodulation and decoding, a novel serial schedule is proposed. Numerical results show that the joint demodulation and decoding for SCDT based on JSG can significantly improve the system's performance, while roughly half of the iterations can be saved by using the proposed serial schedule.