• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1615-1618
• /
• 2002

본 논문은 MAP(Maximum A Posteriori) 복호 알고리즘을 이용한 MAP Decoder의 설계에 관해 다룬다. 채널코딩기법은 채널을 통해서 디지털 정보를 전송할 때 신뢰성을 제공하기 위해서 사용되어 진다. 즉 수신단에서 수신된 정보의 오류를 검사하고 수정하기 위한 목적으로 송신단에서는 디지털 정보에 부가 정보를 첨가해서 전송하게 된다. 그래서 무선 이동 통신에서 성능이 우수한 채널코딩기법은 우수한 통신 품질을 위해서는 필수적이라고 할 수 있다. 최근에 Shannon의 한계에 매우 근접한 성능으로 많이 알려진 오류정정부호로 터보코드가 발표되었고 많은 연구가 진행되고 있다. 터보코드의 부호기로는 RSC(recursive systematic convolutional)코드가 사용되며 디코딩 알고리즘으로는 주로 MAP 복호 알고리즘을 사용한다. 본 논문에서 제안된 MAP 복호기는 하드웨어로 구현하기 위해서 변형된 LOG-MAP 복호 알고리즘을 이용하였고 터보디코더의 반복 복호에 이용할 수 있다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.2 s.6
• /
• pp.213-220
• /
• 1995

Map Matching is the method for correcting the current position from dead reckoning in Car Navigation System. In this paper, we proposed the new map matching algorithm that can correct the positioning error caused by sensors and digital map data around the cross road area. To do this, first we set the error boundary of the cross road area by combining the relative error of moving distance and the absolute error of road length, second, we find out the starting point of turning within the determined error boundary of the cross point area, third, we compare the turning angle of the car to the angle of each possible road, and the last, we decide the matched road. We used wheel sensor as a speed sensor and used optical fiber gyro as a directional sensor, and assembled the sensors to the notebook computer. We testified our algorithm by driving the Daejeon area-which is a part of south Korea-as a test area. And we proved the efficiency by doing that.

• Journal of Korea Multimedia Society
• /
• v.14 no.7
• /
• pp.917-923
• /
• 2011

In this paper, a new prediction based embedded compression (EC) codec algorithm for the JPEG2000 encoder system is proposed to reduce excessive memory requirements. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform (DWT) stages compared with direct implementation of the DWT engine of this paper. The LOCO-I predictor and MAP are widely used in many lossless picture compression codec. The proposed EC algorithm use these predictor which are very simple but surprisingly effective. The predictive EC scheme adopts a forward adaptive quantization and fixed length coding to encoding the prediction error. Simulation results show that our LOCO-I and MAP based EC codecs present only PSNR degradation of 0.48 and 0.26 dB in average, respectively. The proposed algorithm improves the average PSNR by 1.39 dB compared to the previous work in [9].

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.709-713
• /
• 2005

A new algorithm is proposed for the extraction of line segments to construct 3D wire-frame models of building from the high-resolution aerial images. The purpose of this study Is the accurate and effective extraction of line segments, considering the problems such as discordance of lines and blurred edges existing in the conventional methods. Using the edge map extracted from aerial images, chain code tracking of edges was performed. Then, we extract the line segments considering the strength of edges and the direction of them. SUSAN (Smallest Uni-value Segment Assimilating Nucleus) algorithm proposed by Smith was used to extract an edge map. The proposed algorithm consists of 4 steps: removal of the horizontal, vertical and diagonal components of edges to reduce non-candidate point of line segments based on the chain code tracking of the edge map, removal of contiguous points, removal of the same angle points, and the extraction of the start and end points to be line segments. By comparing the proposed algorithm with Boldt algorithm, better results were obtained regarding the extraction of the representative line segments of buildings, having relatively less extraction of unnecessary line segments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.3
• /
• pp.223-230
• /
• 2001

Since self-organizing map (SOM) preserves the topology of ordering in input spaces and trains itself by unsupervised algorithm, it is Llsed in many areas. However, SOM has a shortcoming: structure cannot be easily detcrmined without many trials-and-errors. Structure-adaptive self-orgnizing map (SASOM) which can adapt its structure as well as its weights overcome the shortcoming of self-organizing map: SASOM makes use of structure adaptation capability to place the nodes of prototype vectors into the pattern space accurately so as to make the decision boundmies as close to the class boundaries as possible. In this scheme, the initialization of weights of newly adapted nodes is important. This paper proposes a method which optimizes SASOM with genetic algorithm (GA) to determines the weight vector of newly split node. The leanling algorithm is a hybrid of unsupervised learning method and supervised learning method using LVQ algorithm. This proposed method not only shows higher performance than SASOM in terms of recognition rate and variation, but also preserves the topological order of input patterns well. Experiments with 2D pattern space data and handwritten digit database show that the proposed method is promising.

• Korean Journal of Remote Sensing
• /
• v.25 no.5
• /
• pp.455-464
• /
• 2009

Lee(2009) proposed the boundary-adaptive despeckling method using a Bayesian model which is based on the lognormal distribution for image intensity and a Markov random field(MRF) for image texture. This method employs the Point-Jacobian iteration to obtain a maximum a posteriori(MAP) estimate of despeckled imagery. The boundary-adaptive algorithm is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The boundary-adaptive scheme was comprehensively evaluated using simulation data and the effectiveness of boundary adaption was proved in Lee(2009). This study, as an extension of Lee(2009), has suggested a modified iteration algorithm of MAP estimation to enhance computational efficiency and to combine classification. The experiment of simulation data shows that the boundary-adaption results in yielding clear boundary as well as reducing error in classification. The boundary-adaptive scheme has also been applied to high resolution Terra-SAR data acquired from the west coast of Youngjong-do, and the results imply that it can improve analytical accuracy in SAR application.

• Journal of Ocean Engineering and Technology
• /
• v.38 no.4
• /
• pp.187-198
• /
• 2024

Autonomous underwater vehicles (AUVs) have a limited bandwidth for real-time communication, limiting rapid responses to unexpected obstacles. This study addressed how AUVs can navigate to a target without a pre-existing obstacle map by generating one in real-time and avoiding obstacles. This paper proposes using forward-looking sonar with an occupancy grid map (OGM) for real-time obstacle mapping and a potential field algorithm for avoiding obstacles. The OGM segments the map into grids, updating the obstacle probability of each cell for precise, quick mapping. The potential field algorithm attracts the AUV towards the target and uses repulsive forces from obstacles for path planning, enhancing computational efficiency in a dynamic environment. Experiments were conducted in coastal waters with obstacles to verify the real-time obstacle mapping and avoidance algorithm. Despite the high noise in sonar data, the experimental results confirmed effective obstacle mapping and avoidance. The OGM-based potential field algorithm was computationally efficient, suitable for single-board computers, and demonstrated proper parameter adjustments through two distinct scenarios. The experiments also identified some of challenges, such as dynamic changes in detection rates, propulsion bubbles, and changes in repulsive forces caused by sudden obstacles. An enhanced algorithm to address these issues is currently under development.

• International Journal of CAD/CAM
• /
• v.3 no.1_2
• /
• pp.77-83
• /
• 2003

We propose two algorithms to generate (1) polygonal meshes and (2) developable surface patches far generalized cylinders defined by contours of discrete curves. To solve the contour blending problem of generalized cylinder, the presented algorithms have adopted the algorithm and related properties of LIDM (linear interpolation by direction map) that interpolate geometric shapes based on direction map merging and group scaling operations. Proposed methods are fast to compute and easy to implement.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.3
• /
• pp.430-435
• /
• 2008

In the paper, an algorithm called a Constraint algorithm is proposed to solve the fan-in problem occurred in ADC encoding circuits. The Flash ADC architecture uses a double-base number system (DBNS). The DBNS has known to represent the multi-dimensional logarithmic number system (MDLNS) used for implementing the multiplier accumulator architecture of FIR filter in digital signal processing (DSP) applications. The authors use the DBNS with the base 2 and 3 to represent binary output of ADC. A symmetric map is analyzed first, and then asymmetric map is followed to provide addition read DBNS to DSP circuitry. The simulation results are shown for the Double-Base Integer Encoder (DBIE) of the 6-bit ADC to demonstrate an effectiveness of the Constraint algorithm, using $0.18{\mu}\;m$ CMOS technology. The DBIE’s processing speed of the ADC is fast compared to the FAT tree encoder circuit by 0.95 GHz.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.67-73
• /
• 2008

In the Markov network which models disparity map with the Markov Random Field(MRF), the belief propagation algorithm is operated by message passing between nodes corresponding to each pixels. Belief propagation algorithm required much iteration for accurate result. In this paper, we propose the stereo matching algorithm using belief propagation in multi-resolution domain. Multi-resolution method based on wavelet or lifting can reduce the search area, therefore this algorithm can generate disparity map with fast speed.