• Journal of Korea Spatial Information System Society
• /
• v.1 no.2 s.2
• /
• pp.115-125
• /
• 1999

Much efforts are being process at many ways for digitization cadastral maps that will be the base map of Parceled Based Land Information Systems. But, current digitizing systems need too much time and cost digitizing about 720,000 cadastral maps. That's way we develop new digitization system for cadastral maps by using scanning and vectorizing methods. In this paper, we treat scanner test and vectorizing program that are the most important parts of new digitization system for cadastral maps. we analyze needs of Korean Cadastral Survey Corporation, and discuss algorithms and functions of developed programs. Using newly developed scanner test program, user could test various scanners, and use inexpensive scanner if it satisfy the accuracy needed. And vectorizing program will reduce much time and cost, because it is designed and customized practically to he adequate to cadastral maps and to improve work speed, accuracy and usage.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.13-20
• /
• 1990

This paper describes an interframe image coding using motion compensated and classified vector quantizer (MC-CVQ). It is essential to carefully encode blocks with significant pels in motion compensated vector quantizers (MCVQ). In this respect, we propose a new CVQ algorithm which is appropriate to the coding of interframe prediction error after motion compensation. In order to encode an image efficiently at a low bit rate, we partition each block, which is the processing element in MC, into equally sized 4 vectors, and classify vectors into 15 classes according to the position of significant pels. Vectors in each class are then encoded by the vector quantizer with the codebook independently designed for the class. The computer simulation shows that the signal-to-noise ratio and the average bit rate of MC-CVQ are 35-37dB and 0.2-0.25bit/pel, respectively, for the videophone or video conference type image.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2231-2233
• /
• 1998

본 논문은 손등의 정맥패턴을 이용한 개인식별을 위해 개발된 3가지의 알고리즘에 관해 각각의 성능을 비교한 결과를 제시한다. 세가지 방법은 각각 Unsharp Masking을 이용한 이치화 후 정맥과 손등 배경의 면적을 이용한 가중치를 적용한 원형정합 알고리즘[1]과 Kolmogorov Smirnov(KS) statistic[2]을 이용한 매칭 알고리즘을 개선한 방식, 그리고 정맥의 세선화 처리 후 분기점의 좌표, 정맥의 길이, 정맥 가지 사이의 분기각도 등의 특징벡터를 이용한 방법 등이다. 본 연구에서는 전처리 과정에 있어서, 원시영상의 혈관부위와 배경부위의 gray scale 분포가 겹친 상태에서 Unsharp Masking 필터링을 적용한 결과가 기타 다른 전처리 방식보다 우수하게 영상을 강화시킬 수 있음을 확인하였고, 가중치를 이용한 매칭방식이 다른 매칭방식보다 우수함을 확인하였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.337-340
• /
• 2002

본 논문에서는 휠체어 시스템에 화자 독립 고립단어 인식을 위한 임베디드 시스템 설계에 관한 내용을 서술한다. 실제 환경에서는 잡음이 포함되어 있어 인식률을 저하시키므로, 잡음을 제거하는 방식 중 가장 간단한 방식인 스펙트럼 차감법(Spectral subtraction method)을 사용하여 잡음을 제거했다 전처리 단계에서는 12차 LPC&Cepstrum 방식을 사용했고, 인식 알고리즘은 DHMM (Discrete Hidden Markov Model)을 전반부 인식기로 사용했다. 이 알고리즘을 적용하기 위해서는 데이터 간소화를 위해 벡터양자화(Vector Quantization) 처리가 전제되어야한다 또한 인식알고리즘은 인식률을 향상을 위해 후처리 인식기로 신경망(MLP:Multi-layer Perceptron)을 통해서 인식률을 향상시켰다 화자 독립 시스템에 맞는 인식 단어의 구성은 총 7개단어로 남녀 총 25명 목소리로 구성하였다. 그리고 하드웨어 구성은 32-bits floating point 방식인 TMS320C32를 적용했고, 메모리 부분은 4Mbyte로 설계를 했으며, 메인보드의 설계는 현재 완성 단계에 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.110-113
• /
• 2019

본 논문에서는 임베디드 시스템에서의 양자화 기계학습을 수행할 경우 발생하는 양자화 오차를 효과적으로 보상하기 위한 방법론을 제안한다. 경사 도함수(Gradient)를 사용하는 기계학습이나 비선형 신호처리 알고리즘에서 양자화 오차는 경사 도함수의 조기 소산(Early Vanishing Gradient)을 야기하여 전체적인 알고리즘의 성능 하락을 가져온다. 이를 보상하기 위하여 경사 도함수의 최대 성분에 대하여 직교하는 방향의 보상 탐색 벡터를 유도하여 양자화 오차로 인한 성능 하락을 보상하도록 한다. 또한, 기존의 고정 학습률 대신, 내부 순환(Inner Loop) 없는 비선형 최적화 알고리즘에 기반한 적응형 학습률 결정 알고리즘을 제안한다. 실험결과 제안한 방식의 알고리즘을 비선형 최적화 문제에 적용할 시 양자화 오차로 인한 성능 하락을 최소화시킬 수 있음을 확인하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.219-225
• /
• 2014

The New efficient Mux-based scan latch cell design and scan test of LOS/LOC modes are proposed for detection of delay faults in digital logic circuits. The proposed scan cell design can support LOS(Launch-off-Shift) and LOC(Launch-off-Capture) tests with high fault coverage and low scan power and it can alleviate the problem of the slow selector enable signal and hold signal by supporting the logic capable of switching at the operational clock speeds. Also, it efficiently controls the power dissipation of the scan cell design during scan testing. Functional operation and timing simulation waveform for proposed scan hold cell design shows improvement in at-speed test timing in both test modes.

• Journal of the Korea Computer Industry Society
• /
• v.10 no.5
• /
• pp.227-234
• /
• 2009

The Paper introduces a new technique for block matching motion estimation. since the temporal correlation of a animation sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the scene change detection algorithm for block matching using the temporal correlation of the animation sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that the PSNR values are improved as high as 9~32% in terms of average number of search point per motion vector estimation and improved about 0.06~0.21dB on an average except the FS(full search) algorithm.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.2 no.4
• /
• pp.36-44
• /
• 1997

For high performance ac drives, the speed sensorless vector control and the stator flux orientation concept have received increasing attention. This paper describes a speed and flux sensorless vector-controlled induction machine(IM) drive based on the stator flux-oriented control. To improve the accuracy and operating range, the control system employs the previously presented speed and flux estimation methods, and then we present a developed method of estimating the speed of IM. In the proposed method all differential and integral terms have been eliminated by giving a very fast, low-cost, effective and practical alternative to the methods currently available. The effectiveness of the proposed method is verified by simulations and experimental results.

• The Journal of the Acoustical Society of Korea
• /
• v.34 no.4
• /
• pp.316-320
• /
• 2015

In this paper, the pole filtering concept is applied to the Mel-frequency cepstral coefficient (MFCC) feature vectors in the conventional cepstral mean normalization (CMN) and cepstral mean and variance normalization (CMVN) frameworks. Additionally, performance of the cepstral mean and scale normalization (CMSN), which uses scale normalization instead of variance normalization, is evaluated in speech recognition experiments in noisy environments. Because CMN and CMVN are usually performed on a per-utterance basis, in case of short utterance, they have a problem that reliable estimation of the mean and variance is not guaranteed. However, by applying the pole filtering and scale normalization techniques to the feature normalization process, this problem can be relieved. Experimental results using Aurora 2 database (DB) show that feature normalization method combining the pole-filtering and scale normalization yields the best improvements.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.717-730
• /
• 2004

Recently. many researches on the personalization of a web-site have been actively made. The web personalization predicts the sets of the most interesting URLs for each user through data mining approaches such as clustering techniques. Most existing methods using clustering techniques represented the web transactions as bit vectors that represent whether users visit a certain WRL or not to cluster web transactions. The similarity of the web transactions was decided according to the match degree of bit vectors. However, since the existing methods consider only whether users visit a certain URL or not, users' interestingness on the URL is excluded from clustering web transactions. That is, it is possible that the web transactions with different visit proposes or inclinations are classified into the same group. In this paper. we propose an enhanced transaction modeling with interestingness weight to solve such problems and a new similarity measuring method that exploits the proposed transaction modeling. It is shown through performance evaluation that our similarity measuring method improves the accuracy of the web transaction clustering over the existing method.