• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.2033-2036
• /
• 2004

A novel approach to estimate the real time moving trajectory of an object is proposed in this paper. The object position is obtained from the image data of a CCD camera, while a state estimator predicts the linear and angular velocities of the moving object. To overcome the uncertainties and noises residing in the input data, a Kalman filter and neural networks are utilized. Since the Kalman filter needs to approximate a non-linear system into a linear model to estimate the states, there always exist errors as well as uncertainties again. To resolve this problem, the neural networks are adopted in this approach, which have high adaptability with the memory of the input-output relationship. Kohonen Network(Self-Organized Map) is selected to learn the motion trajectory since it is spatially oriented. The superiority of the proposed algorithm is demonstrated through the real experiments.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.127-134
• /
• 2005

To connect the gap on the contours at the summit area, we propose the linear interpolation in the polar coordinates. Tn the experiments of applying both existing algorithms and a proposed method to some graphic images, the proposed method generated curves that average MAE was 1.940 pixels. In particular, our method with MAE of 1.240 on real map image was superior than the others. Also by generating new curves with neighbors-resembled appearance, the contours were reconstructed seamlessly.

• Journal of ILASS-Korea
• /
• v.11 no.1
• /
• pp.1-6
• /
• 2006

The present study is focused on the small scale turbulent mixing processes in the scalar Held. In order to deal with molecular mixing in turbulent flow, the linear eddy model is addressed. In each realization, the molecular mixing term is implemented deterministically, and turbulent stirring is represented by a sequence of instantaneous, statistically independent rearrangement event called by triplet map. The LEM approach is applied with relatively simple conditions. The characteristics of scalar mixing and PDF profiles are addressed in detail.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2434-2448
• /
• 2014

This research proposed the domain division depth map quantization for multiview intermediate image generation using Depth Image-Based Rendering (DIBR). This technique used per-pixel depth quantization according to the percentage of depth bits assigned in domains of depth range. A comparative experiment was conducted to investigate the potential benefits of the proposed method against the linear depth quantization on DIBR multiview intermediate image generation. The experiment evaluated three quantization methods with computer-generated 3D scenes, which consisted of various scene complexities and backgrounds, under varying the depth resolution. The results showed that the proposed domain division depth quantization method outperformed the linear method on the 7- bit or lower depth map, especially in the scene with the large object.

• Korean Journal of Mathematics
• /
• v.27 no.3
• /
• pp.735-741
• /
• 2019

Let ${\mathcal{H}}$ be a complex Hilbert space and ${\mathcal{B}}({\mathcal{H}})$ the algebra of all bounded linear operators on ${\mathcal{H}}$. In this paper, we prove that if ${\varphi}:{\mathcal{B}}({\mathcal{H}}){\rightarrow}{\mathcal{B}}({\mathcal{H}})$ is a unital surjective bounded linear map, which preserves m- isometries m = 1, 2 in both directions, then there are unitary operators $U,V{\in}{\mathcal{B}}({\mathcal{H}})$ such that ${\varphi}(T)=UTV$ or ${\varphi}(T)=UT^{tr}V$ for all $T{\in}{\mathcal{B}}({\mathcal{H}})$, where $T^{tr}$ is the transpose of T with respect to an arbitrary but fixed orthonormal basis of ${\mathcal{H}}$.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.117-122
• /
• 2007

For multiple antenna systems, we consider the hybrid iterative detection of the maximum a posteriori probability(MAP) detection and the linear detection such as the minimum-mean-square-error(MMSE) filtering with soft cancelation. We devise methods to obtain both the lower complexity of the linear detection and the superior performance of the MAP detection. Using the a prior probability of the coded bit which is extrinsic of the outer decoder, we compute the threshold of grouping and determine the detection scheme symbol by symbol. Through the simulation results, it is shown that the proposed receiver obtains the superior performance to the MMSE detector and the lower complexity than the MAP detector.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.183-194
• /
• 2004

The proliferation of the Internet and the rapid progress of wire/wireless communication technology makes security of digital images more and more important since the exchanges of digital images occur more and more frequently. And as the tight relationship between chaos theory and cryptography, many researches for development of new encryption systems based on chaotic maps have been widely progressed recently. In this paper, we propose a digital image encryption system based on both one-dimensional PLCM(Piecewise Linear Chaotic Map) and two-dimensional baker map. This proposed system is a product cipher that contains a perturbance-based chaotic stream cipher based on ID PLCM and a chaotic block cipher based on 2D baker map and is very high secure and easily implementable cipher having both a good confusion property and a good diffusion property. And with test results, we showed this system is very secure against statistical attacks.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.2
• /
• pp.190-198
• /
• 2002

In general, we have used the Viterbi algorithm of Speech recognition for decoding. But a decoder in speaker verification has to recognize same word of every speaker differently. In this paper, we propose a noble decoding algorithm that could replace the typical Viterbi algorithm for the speaker verification system. We utilize for the proposed algorithm the speaker adaptation algorithms that transform feature vectors into the region of the client' characteristics in the speech recognition. There are many adaptation algorithms, but we take MLLR (Maximum Likelihood Linear Regression) and MAP (Maximum A-Posterior) adaptation algorithms for proposed algorithm. We could achieve improvement of performance about 30% of EER (Equal Error Rate) using proposed algorithm instead of the typical Viterbi algorithm.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.25 no.3
• /
• pp.35-46
• /
• 1997

The objective of this study is to investigate actual conditions of terrestrial vegetation part in Environmental impact statement, and to prepare a proposal for the efficiency of Environmental Impact Assessment. 13 E.I.S.s made out during 1996.6-1997.5. have been chosen and analysed with respect to scope of survey, item of survey, method of survey, and result of survey. Actual conditioins of terrestrial vegetation part in E.I.S. are summarized as follows : 1. The mean number of total participants in drawing up E.I.S. is 26.0 persons, that of participants in terrestrial vegetation part is 2.3 persons. 2. In case of planar project, the mean of scope of survey is 16.1 times as large as area of project . In case of linear project, the scope of survey has been determined arbitrarily. 3. The most part of survey has been dependent on literature, and field survey has been practically neglected. 4. Results of survey mostly missed the point that E.I.A. pursues. And proposals are as follows : 1. Participants in terrestrial vegetation part in drawing up E.I.S should be increased. 2. It is necessary to subdivide scope of survey in view of difference between planar project and linear project. 3. As for item and method of survey, field survey should be specially reinforced. 4. Several sheets of map as results of survey should be included in E.I.S. The vegetation map, the D.G.N. map, and the planting map should be included and drawn by smaller scale as possible.

• Journal of Biomedical Engineering Research
• /
• v.32 no.3
• /
• pp.245-250
• /
• 2011

Parallel imaging technique can provide several advantages for a multitude of MRI applications. Especially, in SENSE technique, sensitivity maps were always required in order to determine the reconstruction matrix, therefore, a number of difference approaches using sensitivity information from coils have been demonstrated to improve of image quality. Moreover, many filtering methods were proposed such as adaptive matched filter and nonlinear diffusion technique to optimize the suppression of background noise and to improve of image quality. In this study, we performed SENSE reconstruction using computer simulations to confirm the most suitable method for the feasibility of filtering effect and according to changing order of polynomial fit that were applied on variation of spatial resolution of sensitivity map. The image was obtained at 0.32T(Magfinder II, Genpia, Korea) MRI system using spin-echo pulse sequence(TR/TE = 500/20 ms, FOV = 300 mm, matrix = $128{\times}128$, thickness = 8 mm). For the simulation, obtained image was multiplied with four linear-array coil sensitivities which were formed of 2D-gaussian distribution and the image was complex white gaussian noise was added. Image processing was separated to apply two methods which were polynomial fitting and filtering according to spatial resolution of sensitivity map and each coil image was subsampled corresponding to reduction factor(r-factor) of 2 and 4. The results were compared to mean value of geomety factor(g-factor) and artifact power(AP) according to r-factor 2 and 4. Our results were represented while changing of spatial resolution of sensitivity map and r-factor, polynomial fit methods were represented the better results compared with general filtering methods. Although our result had limitation of computer simulation study instead of applying to experiment and coil geometric array such as linear, our method may be useful for determination of optimal sensitivity map in a linear coil array.