• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.6
• /
• pp.657-664
• /
• 2001

It is possible to extract a 3D models from its multiple views using the self-calibration. Though it is possible to construct 3D models of objects from their multiple views, accuracy of 3D models depends on the fundamental matrix estimated between two views. In this paper, we show the fundamental matrix accuracy can be improved by taking a non-linear minimization technique. Furthermore, the corresponding points which are completely mismatches or have greater discrepancy errors in their locations, reduce the fundamental matrix accuracy. Thus, applying the Monte Carlo technique and the non-linear minimization Levenberg-Marquardt method to remove the outliers, we can estimate the fundamental matrix with the higher accuracy.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.21-24
• /
• 2000

Fractional Brownian motion(fBm)은 long-term persistence 특성을 가진 자연 현상, 1/f 잡음, 깊이가 낮은 해저에서의 배경음향잡음 등을 모델링하는데 많이 사용된다. 이 fBm은 nonstationary 유색잡음이다. 이러한 유색잡음 환경 하에서 신호를 검출하기 위한 한 방법은 Fredholm 적분방정식의 해를 구하는 것이다. 이 방정식을 이산화 하면 잡음의 공분산 행렬의 역행렬이 포함되어 계산량이 많다 본 논문에서는 fBm 잡음의 공분산 행렬을 웨이브렛 변환하여 얻어지는 행렬, 즉 fBm의 멀티스케일 성분들의 공분산행렬은 밴드화된 블록들로 근사화할 수 있다는 성질을 이용하여 적은 계산량으로 신호를 검출하는 알고리즘을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.40-48
• /
• 2002

Three-Dimensional scene reconstruction from images acquired with different viewpoints is possible as estimating Fundamental matrix(F-matrix) that indicates the epipolar geometry of two images. Correspondence points required to calculate F-matrix of two images include noise such as miss matches, so generally it is hard to calculate F-matrix accurately. In this paper, we classify noise into two types; outlier and minute noise. we propose SSOR algorithm that estimate F-matrix effectively. SSOR algorithm is rejecting outlier step by step in a noise environment. To evaluate the performance of proposed algorithm we simulated with synthetic images and real images. As a result of simulation we show that proposed algorithm is better than conventional algorithms.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.317-325
• /
• 2012

In this paper, we consider the encoding scheme of Low Density Parity Check codes. In particular, using the Jacket Pattern and circulant permutation matrices, we propose the simple encoding scheme of Richardson's lower triangular matrix. These encoding scheme can be extended to a flexible code rate. Based on the simple matrix process, also we can design low complex and simple encoders for the flexible code rates.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.15-24
• /
• 2015

Jacket matrices which are defined to be $m{\times}m$ matrices $J^{\dagger}=[J_{ik}^{-1}]^T$ over a Galois field F with the property $JJ^{\dagger}=mI_m$, $J^{\dagger}$ is the transpose matrix of element-wise inverse of J, i.e., $J^{\dagger}=[J_{ik}^{-1}]^T$, were introduced by Lee in 1984 and are used for Digital Signal Processing and Coding theory. This paper presents some square matrices $A_2$ which can be eigenvalue decomposed by Jacket matrices. Specially, $A_2$ and its extension $A_3$ can be used for modifying the properties of hyperbola and hyperboloid, respectively. Specially, when the hyperbola has n times transformation, the final matrices $A_2^n$ can be easily calculated by employing the EVD[7] of matrices $A_2$. The ideas that we will develop here have applications in computer graphics and used in many important numerical algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• The Korean Journal of Applied Statistics
• /
• v.23 no.6
• /
• pp.1179-1190
• /
• 2010

Management of the existing traffic network and understanding current traffic conditions is the most important and effective way to solve traffic congestion. This research investigates the status of Korea expressway through the Speed-Flow-Density diagram and finds the best suitable queueing model for each area. Dynamic structure in the queueing model enables us to reflect the structural change of the road in case of traffic congestion. To find the best model and estimate the parameters, we use the Newton-Raphson method. Finally, we examine the road efficiency in view of the optimal speed and density using the conditional distribution of speed and density of a S-F-D diagram.

• Proceedings of the KIPE Conference
• /
• 2005.07a
• /
• pp.601-604
• /
• 2005

본 논문에서는 전방향 등극기하를 이용하여 이동로봇의 효과적인 표식대응에 대하여 기술한다. 전방향 영상에서 등극점과 등극선의 특성에 따라 추출된 특징의 영상내 위치를 추정한다. 예측된 특징의 영상위치정보를 통해 효과적인 특징 대응을 하며 본 연구에서는 두영상에서 8개의 대응점을 이용하여 기초행렬 F를 구하고 이것으로 특징의 공간정보를 계산한다. 따라서 기초행렬 F에서 계산된 기초행렬 E로부터 로봇은 자신의 위치와 운동정보(회전, 병진운동)를 알 수 있다. 또한 효과적인 특징대응을 위해 탐색범위를 축소함으로써 계산시간의 단축과 강인한 특징대응을 제시하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.17-21
• /
• 2008

As with the binary pseudo-random sequences q-ary m-sequences possess very good properties which make them useful in many applications. So we construct a class of Jacket matrices by applying additive characters of the finite field $F_q$ to entries of all shifts of q-ary m-sequence. In this paper, we generalize a method of obtaining conventional Hadamard matrices from binary PN-sequences. By this way we propose Jacket matrix construction based on q-ary M-sequences.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.15 no.1
• /
• pp.77-84
• /
• 2011

This study is to develop nonlinear analysis algorithm for transfer matrix method, which can be applied to continuous beam analysis. Gauss-Lobatto integral rule is adopted and the transfer matrix is derived from stiffness matrix. In the transfer matrix method, the system equation has a constant number of unknowns regardless of number of D.O.F. Therefore, the transfer matrix method has computational efficiencies not only in linear elastic analysis but also in nonlinear analysis. To verify the developed method, the analysis results of several examples are compared with commercial code in moment-curvature, moment-displacement and load-displacement relation.