• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.7
• /
• pp.774-781
• /
• 2014

The radar measurements are composed of range, Doppler and angles which are expressed as polar-coordinate components. An approach to match the measurements with the states of target dynamics which are modeled in cartesian coordinates is to use the pseudo-measurements or the extended Kalman filter in order to solve the mismatching problem. Another approach is that the states of dynamics are modeled in polar coordinates and measurement equation is linear. However, this approach bears that we have to deal with a time-varying dynamics. In this study, it is proposed that the states of dynamics are expressed as polar-coordinate component and the system matrix of the dynamic equation is modeled as a time-invariant. Nonlinear terms that appear due to the proposed modeling are regarded as a system input. The results of a series of simulation runs indicate that the tracking filter that uses the proposed modeling is viable from the fact that the Doppler measurement is easy to be augmented in the measurement equation.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.6
• /
• pp.17-25
• /
• 2001

Traditional adaptive noise cancelling methods rely their performance on various interfering parameters, such as convergence speed, tracking ability, numerical stability, relative frequency characteristics between target and reverberation signals, and activity of the target. In this paper, an adaptive noise cancelling method is suggested, which Provides a successful tradeoff mon these factors. It is designed to work on the transform domain, adopts the Gram-Schmidt orthogonalization process, and is implemented by the escalator algorithm. The transform domain approach supports a tradeoff between the convergence speed and numerical cost. The proposed method is verified by applying a real-data collected in the shallow waters off the east coasts of korea. It is shown that it has a good reverberation-rejection capability even for the target signal with adjacent frequency components to those of the reverberation, and its performance is invariant for the activity of the target.

• Bulletin of the Korean Mathematical Society
• /
• v.22 no.1
• /
• pp.11-15
• /
• 1985

Manddelberg [9] has shown that a Clifford algebra of a free quadratic space over an arbitrary semi-local ring R in Brawer-Wall group BW(R) is determined by its rank, determinant, and Hasse invariant. In this paper, we prove a corresponding result when R is a full ring.Throughout this paper, unless otherwise specified, we assume that R is a commutative ring having 2 a unit. A quadratic space (V, B, .phi.) over R is a finitely generated projective R-module V with a symmetric bilinear mapping B: V*V.rarw.R which is non-degenerate (i.e., the natural mapping V.rarw.Ho $m_{R}$(V,R) induced by B is an isomorphism), and with a quadratic mapping .phi.: V.rarw.R such that B(x,y)=1/2(.phi.(x+y)-.phi.(x)-.phi.(y)) and .phi.(rx) = $r^{2}$.phi.(x) for all x, y in V and r in R. We denote the group of multiplicative units of R by U9R). If (V, B, .phi.) is a free rank n quadratic space over R with an orthogonal basis { $x_{1}$,.., $x_{n}$}, we will write < $a_{1}$,.., $a_{n}$> for (V, B, .phi.) where the $a_{i}$=.phi.( $x_{i}$) are in U(R), and denote the space by the table [ $a_{ij}$ ] where $a_{ij}$ =B( $x_{i}$, $x_{j}$). In the case n=2 and B( $x_{1}$, $x_{2}$)=1/2 we reserve the notation [a $a_{11}$, $a_{22}$] for the space. A commutative ring R having 2 a unit is called full [10] if for every triple $a_{1}$, $a_{2}$, $a_{3}$ of elements in R with ( $a_{1}$, $a_{2}$, $a_{3}$)=R, there is an element w in R such that $a_{1}$+ $a_{2}$w+ $a_{3}$ $w^{2}$=unit.TEX>=unit.t.t.t.

• Journal of Advanced Navigation Technology
• /
• v.22 no.3
• /
• pp.228-232
• /
• 2018

Dealing with quntization error in a control system properly becomes much more important as many devices are connected through network and controlled. Thus, in this paper, we study a data rate condition on quantizer to achieve practical stability in a discrete time linear time invariant system with state feedback control. First, required data rate is shown to depend on eigenvalue of the closed loop system, the size of the initial state vector, the magnitude of initial quantization error, and control gain in the absence of process noise. It additionally depends on the maximum magnitude of process noise when noise is not zero. Asymptotic analysis shows that a new design method may be needed to reduce the date rate for a networked control in the presence of quantization error and noise.. We provide a simple numerical evaluation of uniform quantizer and logarithmic qunatizer to assess their characteristics of practical stability depending on data rate in the presence of noise.

• Journal of Advanced Navigation Technology
• /
• v.23 no.6
• /
• pp.577-583
• /
• 2019

A dynamic system is called positive if any trajectory of the system starting from non-negative initial states remains forever non-negative for non-negative controls. In this paper, we consider the new stability condition for the positive time-varying linear discrete interval systems with time-varying delay and unstructured uncertainty. The delay time is considered as time-varying within certain interval having minimum and maximum values and the system is subjected to nonlinear unstructured uncertainty which only gives information on uncertainty magnitude. The proposed stability condition is an improvement of the previous results which can be applied only to time-invariant systems or had no consideration of uncertainty, and they can be expressed in the form of a very simple inequality. The stability conditions are derived using the Lyapunov stability theory and have many advantages over previous results using the upper solution bound of the Lyapunov equation. Through numerical example, the proposed stability conditions are proven to be effective and can include the existing results.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.339-349
• /
• 2008

We present a novel method to estimate the light source direction and relight a face texture image of a single 3D model under arbitrary unknown illumination conditions. We create a virtual irradiance sphere to detect the light source direction from a given illuminated texture image using both normal vector mapping and weighted bilinear interpolation. We then induce a relighting equation with estimated ambient and diffuse coefficients. We provide the result of a series of experiments on light source estimation, relighting and face recognition to show the efficiency and accuracy of the proposed method in restoring the shading and shadows areas of a face texture image. Our approach for face relighting can be used for not only illuminant invariant face recognition applications but also reducing visual load and Improving visual performance in tasks using 3D displays.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.319-322
• /
• 2013

Image retrieval research activity has moved its focus from global descriptors to local descriptors of feature point such as SIFT. MPEG is Currently working on standardization of effective coding of location and local descriptors of feature point in the context mobile based image search driven application in the name of MPEG-7 CDVS (Compact Descriptor for Visual Search). The extracted feature points consist of two parts, location information and Descriptor. For efficient image retrieval, we proposed a novel method that is gradual block-based efficient lossy location coding to compress location information according to distribution in images. From experimental result, the number of average bits per feature point reduce 5~6% and the accuracy rate keep compared to state of the art TM 3.0.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.125-133
• /
• 2003

In this paper we propose an efficient content-based image retrieval method using the color and wavelet based texture features. The color features are obtained from soft-color histograms of the global image and the wavelet-based texture features are obtained from the invariant moments of the high-pass sub-band through the spatial-frequency analysis of the wavelet transform. The proposed system, called a color and texture based two-step retrieval(CTBTR), is composed of two-step query operations for an efficient image retrieval. In the first-step matching operation, the color histogram features are used to filter out the dissimilar images quickly from a large image database. The second-step matching operation applies the wavelet based texture features to the retained set of images to retrieve all relevant images successfully. The experimental results show that the proposed algorithm yields more improved retrieval accuracy with computationally efficiency than the previous methods.

• Journal of KIISE:Software and Applications
• /
• v.34 no.10
• /
• pp.937-944
• /
• 2007

In this paper, we propose multiple human tracking with an moving stereo camera. The tracking process is based on mean shift algorithm which is using color information of the target. Color based tracking approach is invariant to translation and rotation of the target but, it has several problems. Because of mean shift uses color distribution, it is sensitive to color distribution of background and targets. In order to solve this problem, we combine color and depth information of target. Also, we build human body part model to handle occlusions and we have created adaptive box scale. As a result, the proposed method is simple and efficient to track multiple humans in real time.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.535-538
• /
• 1990

The main problem in speech recognition is the enormous variability in acoustic signals due to complex but predictable contextual effects. Especially in plosive consonants it is very difficult to find invariant cue due to various contextual effects, but humans use these contextual effects as helpful information in plosive consonant recognition. In this paper we experimented on three artificial neural net models for the recognition of plosive consonants. Neural Net Model I used "Multi-layer Perceptron ". Model II used a variation of the "Self-organizing Feature Map Model". And Model III used "Interactive and Competitive Model" to experiment contextual effects. The recognition experiment was performed on 9 Korean plosive consonants. We used VCV speech chains for the experiment on contextual effects. The speech chain consists of Korean plosive consonants /g, d, b, K, T, P, k, t, p/ (/ㄱ, ㄷ, ㅂ, ㄲ, ㄸ, ㅃ, ㅋ, ㅌ, ㅍ/) and eight Korean monothongs. The inputs to Neural Net Models were several temporal cues - duration of the silence, transition and vot -, and the extent of the VC formant transitions to the presence of voicing energy during closure, burst intensity, presence of asperation, amount of low frequency energy present at voicing onset, and CV formant transition extent from the acoustic signals. Model I showed about 55 - 67 %, Model II showed about 60%, and Model III showed about 67% recognition rate.