• Explosives and Blasting
• /
• v.19 no.2
• /
• pp.19-26
• /
• 2001

국토의 효율적 활용을 위한 각종 토목.건설공사나 석재 및 골재생산 등을 위해 암반을 굴착함에 있어 다양한 산업용 화약류가 이용되고 있다. 그러나 화약의 사용으로 인해 수반되는 발파진동은 인체 및 구조물 등에 피해를 발생시켜 인근의 주민과 마찰을 일으키고 있다.본 연구에서는 발파진동속도 data를 취합하여 분석 사용함에 있어서 V, T, L 성분의 최대 실벡터합을 사용하는 경우와 최대 벡터합을 사용하는 경우를 비교하여 실제 현장 기험시 적용성을 높이고자 하였다. 진동속도는 최대 실 벡터합에 비해 최대 벡터합에 의해 구해진 진동속도의 크기가 장승근에서는 24.6%, 삼승근에서는 26.1%가 증가하는 것으로 나타났으며, 단일성분의 최대치, 최대 실벡터합, 최대 벡터합의 안전율은 1 : 1.154 : 1.359로 나타났다

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.23-28
• /
• 2010

We propose a reference vector diversity method in multi-cell multi-user uplink system with the subspace interference alignment to obtain higher sum rate capacity. The proposed method transmits several reference vectors before the data transmission, and selects the best reference vector to maximize the cell sum rate. The proposed method provides higher sum-rate capacity compared with the previous interferenc alignment. Simulation result exhibits the proposed method improves the sum-rate capacity by 60%.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.08a
• /
• pp.235-237
• /
• 1998

벡터양자화기의 부호화 단계에서 계산량을 줄이는 새로운 알고리즘을 제안한다. 벡터양자화기의 부호화는 주어진 입력벡터에 가장 가까운 코드워드를 찾는 것인데 모든 코드워드와 거리계산을 필요로 하기 때문에 많은 계산량이 소요되믈 효율적인 알고리즘이 필요하다. 본 논문에서는 입력벡터와 코드워드와의 유클리디안 거리계산 대신에 벡터 차의 절대값 합을 이용하여 주어진 입력벡터에 최단거리의 코드워드가 될 수 없는 코드워드를 제외함으로써 유클리디안 거리계산을 최소화하여 계산량을 줄이는 알고리즘을 제안된 방법을 고정 소수점 연산을 이용한 DSP 칩에 효과적이며 이는 실험 결과를 통하여 확증할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.457-463
• /
• 2011

This paper proposes theorthogonal reference vectors selection method of the subspace interference alignment. The proposed method selects multiple orthogonal reference vectors instead of using one reference vector for all users at the same time. The proposed scheme selects a reference vector which maximizes a sum-rate for a certain cell, generates orthogonal vectors to the previous selected vector and selects the one of orthogonal vectors whose sum rate is maximized for each cell. Larger channel gain and sum-rate than the previous method can be obtained by selection degree of freedom. The computer simulation demonstrates the proposed method gives higher sum-rate compared with that of the previous reference vector selection method.

• The Journal of the Korea Contents Association
• /
• v.9 no.8
• /
• pp.121-128
• /
• 2009

Iris recognition is a biometric technology which can identify a person using the iris pattern. Recently, iris information is used in many fields such as access control and information security. It is important for the iris recognition system to extract the feature which is invariant to changes in iris patterns. Those changes can be occurred by the influence of lights, changes in the size of the pupil. In this paper, we propose a novel method based on vector summation of gradient orientation vectors. Experimental results show that the proposed method reduces processing time with simple vector calculation, requires small feature space and has comparable performance to the well-known previous methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.254-259
• /
• 2013

A newly developed fall recognition algorithm using gravity weighted 3-axis accelerometer data as the input of HMM (Hidden Markov Model) is introduced. Five types of fall feature parameters including the sum vector magnitude(SVM) and a newly-defined gravity-weighted sum vector magnitude(GSVM) are applied to a HMM to evaluate the accuracy of fall recognition. A GSVM parameter shows the best accuracy of falls which is 100% of sensitivity and 97.96% of specificity, and comparing with SVM, the results archive more improved recognition rate, 5.2% of sensitivity and 4.5% of specificity. GSVM shows higher recognition rate than SVM due to expressing falls characteristics well, whereas SVM expresses the only momentum.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.485-494
• /
• 2011

In this paper, novel sub-space interference alignment algorithms are proposed to boost the capacity in multi-cell environment. In the case of conventional sub-space alignment, arbitrary reference vectors have been adopted as transmitting vectors at the transmitter side, and the inter-cell interference among users are eliminated by using orthogonal vectors of the chosen reference vectors at the receiver side. However, in this case, sum-rate varies using different reference vectors even though the channel values keep constant, and vice versa. Therefore, the relationship between reference vectors and channel values are analyzed in this paper, and novel interference alignment algorithms are proposed to increase multi-cell capacity. Reference vectors with similar magnitude are adopted in the proposed algorithm. Simulation results show that the proposed algorithms provide about 50 % higher sum-rate than conventional algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.811-816
• /
• 2019

This paper first proposes a technique to separate clean speech signals and mixed noise signals by using an independent vector analysis algorithm of frequency band for 4 channel speech source signals with a noise. An improved output speech signal from the proposed independent vector analysis algorithm is obtained by using the cross-correlation between the signal outputs from the frequency domain delay-sum beamforming and the output signals separated from the proposed independent vector analysis algorithm. In the experiments, the proposed algorithm improves the maximum SNRs of 10.90dB and the segmental SNRs of 10.02dB compared with the frequency domain delay-sum beamforming algorithm for the input mixed noise speeches with 0dB and -5dB SNRs including white noise, respectively. Therefore, it can be seen from this experiment and consideration that the speech quality of this proposed algorithm is improved compared to the frequency domain delay-sum beamforming algorithm.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.4
• /
• pp.799-805
• /
• 2014

This paper deals with a method for getting the Type III sums of squares on the basis of projections under the assumption of two-way fixed effects model. For unbalanced data in general total sum of squares is not equal to the sum of componentwise Type III sums of squares. There are some differencies between two quantities. The suggested method using projections can detect where the differences occur and how much they are different. The traditional ANOVA method could not explain clearly the differences. It also discusses how eigenvectors and eigenvalues of the projection matrices can be used to get the Type III sums of squares.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.275-280
• /
• 2004

In this paper, a very fast block matching scheme was proposed to reduce the computations of Block Sum Pyramid Algorithm for motion estimation in video coding. The proposed algorithm is based on Block Sum Pyramid Algorithm and Efficient Multi-level Successive Elimination Algorithm. The proposed algorithm can reduce the computations of motion estimation greatly with 100% motion estimation accuracy. The efficiency of the proposed algorithm was verified by experimental results.