• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.1
• /
• pp.78-86
• /
• 1998

This paper presents a numerical method of the minimum-time trajectory planning for a robot manipulator amid obstacles. Each joint displacement is represented by the linear combination of the finite-term quintic B-splines which are the known functions of the path parameter. The time is represented by the linear function of the same path parameter. Since the geometric path is not fixed and the time is linear to the path parameter, the coefficients of the splines and the time-scale factor span a finite-dimensional vector space, a point in which uniquely represents the manipulator motion. The displacement, the velocity and the acceleration conditions at the starting and the goal positions are transformed into the linear equality constraints on the coefficients of the splines, which reduce the dimension of the vector space. The optimization is performed in the reduced vector space using nonlinear programming. The total moving time is the main performance index which should be minimized. The constraints on the actuator forces and that of the obstacle-avoidance, together with sufficiently large weighting coefficients, are included in the augmented performance index. In the numerical implementation, the minimum-time motion is obtained for a planar 3-1ink manipulator amid several rectangular obstacles without simplifying any dynamic or geometric models.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.1
• /
• pp.13-21
• /
• 2019

The content based on image retrieval makes use of features of information within image such as color, texture and share for Retrieval data. we present a novel approach for improving retrieval accuracy based on DCT Filter-Bank. First, we perform DCT on a given image, and generate a Filter-Bank using the DCT coefficients for each color channel. In this step, DC and the limited number of AC coefficients are used. Next, a feature vector is obtained from the histogram of the quantized DC coefficients. Then, AC coefficients in the Filter-Bank are separated into three main groups indicating horizontal, vertical, and diagonal edge directions, respectively, according to their spatial-frequency properties. Each directional group creates its histogram after employing Otsu binarization technique. Finally, we project each histogram on the horizontal and vertical axes, and generate a feature vector for each group. The computed DC and AC feature vectors bins are concatenated, and it is used in the similarity checking procedure. We experimented using 1,000 databases, and as a result, this approach outperformed the old retrieval method which used color information.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.4
• /
• pp.476-482
• /
• 2014

In this study, we analyzed the effect of corn growth on the radar backscattering coefficient. At first, we measured the backscattering coefficients of various corn fields using a polarimetric scatterometer system. The backscattering coefficients of the corn fields were also computed using the 1st-order VRT(Vector Radiative Transfer) model with field-measured input parameters. Then, we analyzed the experimental and numerical backscattering coefficients of corn fields. As a result, we found that the backscatter from an underlying soil layer is dominant for early growing stage. On the other hand, for vegetative stage with a higher LAI(Leaf-Area-Index), the backscatter from vegetation canopy becomes dominant, and its backscattering coefficients increase as incidence angle increases because of the effect of leaf angle distribution. It was also found that the estimated backscattering coefficients agree quite well with the field-measured radar backscattering coefficients with an RMSE(Root Mean Square Error) of 1.32 dB for VV-polarization and 0.99 dB for HH-polarization. Finally, we compared the backscattering characteristics of vegetation and soil layers with various LAI values.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.41-46
• /
• 2008

With widespread use of the Internet and improvements in streaming media and compression technology, digital music, video, and image can be distributed instantaneously across the Internet to end-users. However, most conventional Digital Right Management are often not secure and fast enough to process the vast amount of data generated by the multimedia applications to meet the real-time constraints. In this paper, we propose the copyright protection using encryption of DCT coefficients and motion vector in MPEG-4 video codec of mobile device. This paper presents a new Digital Rights Management that modifies the Motion Vector of Macroblock for mobile device. Experimental results indicate that the proposed DRM can not only achieve very low cost of the encryption but also enable separable authentication to individual mobile devices such as Portable Multimedia Player and Personal Digital Assistants. The performance of the proposed methods have low complexity and low increase of bit rate in overhead.

• Bulletin of the Korean Mathematical Society
• /
• v.26 no.1
• /
• pp.43-46
• /
• 1989

In this paper, we are concerned with the pointwise-hypoellipticity (see Definition 2.1) of an m-dimensional Frobenious Lie algebra L of analytic complex vector fields in somel open subset .ohm. of $R^{m+1}$. That is, L is a set of complex vector fields in .ohm. with (real-) analytic coefficients satisfying: (A) each point of .ohm. has an open neighborhood in which L is generated by m linearly independent elements of L; (B) L is closed under the commutation bracket [A, B]. The pointwise-analytic hypoellipticity of L is completely characterized by M.S. Baouendi and F. Treves in [1]. Here, we shall prove that if L is hypoelliptic at a point then it must be analytic hypoelliptic in a full neighborhood of the same point. When the coefficients are $C^{\infty}$, hypoellipticity of L was discussed in [2].2].

• Journal of Biomedical Engineering Research
• /
• v.16 no.3
• /
• pp.345-352
• /
• 1995

The LPC cepstrum coefficients, which are an acoustic features of speech signal, have been widely used as the feature parameter for various speech recognition systems and showed good performance. The vocal tract area function is a kind of articulatory feature, which is related with the physiological mechanism of speech production. This paper proposes the vocal tract area function as an alternative feature parameter for speech recognition. The linear predictive analysis using Burg algorithm and the vector quantization are performed. Then, recognition experiments for 5 Korean vowels and 10 digits are executed using the conventional LPC cepstrum coefficients and the vocal tract area function. The recognitions using the area function showed the slightly better results than those using the conventional LPC cepstrum coefficients.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.343-344
• /
• 2006

In this paper, the biomedical signal compression method with multi-stage vector quantization is proposed. It utilizes characteristic of wavelet coefficients in which the energy is concentrated on approximation coefficients. The transmitted codebook index consists code vectors obtained by wavelet coefficients of ECG and Error signals from the 1024 block length, respectively. The proposed compression method showed 2.1298% in average PRD and 1.8 kbits/sec in CDR.

• Communications for Statistical Applications and Methods
• /
• v.2 no.1
• /
• pp.1-12
• /
• 1995

An estimator of coefficients of polynomial measurement error model with vector predictor and first-order interaction terms is derived using Hermite polynomial. Asymptotic normality of estimator is provided and some simulation study is performed to compare the small sample properties of derived estimator with those of OLS estimator.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1552-1564
• /
• 1995

A fault detecting method of ternary logic is proposed by using the spectral coefficients of the Chrestenson function. Fault detecting conditions are derived for a stuck-at fault in case of single input, multiple inputs and internal lines in the ternary logic. The detecting conditions for min/max bridging faults are also considered. When using this fault analysis method, it is possible to detect faults without the test vector and minimize high volume memory for storing the vector and response data. Thus, the computational complexity for the test vector can be decreased.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.88-95
• /
• 1998

In this paper, we introduce a new DCT based hierarchical finite state vector quantization. Our proposed scheme uses difference of DCT coefficients to find a representative vector, and classifies image blocks into different hierarchical levels depending on their structural characteristics, and uses different coding rates and different number os state codebooks at each hierarchical levels. As a result, we obtained reconstructed images having satisfiable quality objectively.