• Electronics and Telecommunications Trends
• /
• v.30 no.4
• /
• pp.140-150
• /
• 2015

모바일 트래픽 증대는 향후 급격히 증가할 것으로 예측되며 LTE에서 AII-IP기반의 고속 대용량 데이터처리는 망의 부하증가를 의미한다. 비디오 컨퍼런싱, 온라인 음악, 게임, 영화 스트리밍, 네트워크 브라우징, 블로깅 등 현재 온라인 상에서 급격하게 사용되고 있는 새로운 애플리케이션들은 높은 대역폭(Bandwidth)과 고속용량이 필요하고 망 운용자들은 대역폭과 네트워크 용량 한계점을 줄이기 위한 해결책에 관심을 갖게 되었다. 이를 위해 3GPP에서는 데이터 오프로딩(Data Offloading) 기술을 정의하였으며 이는 펨토셀과 non-3GPF액서스 망 등과 정합하는 기술을 제공하였다. 본고에서는 망의 부하를 줄이기 위한 이들 오프로딩 기술에 대한 요구사항, 구조 및 구현 시 고려해야 하는 주요 이슈들에 대해서 살펴본다.

• Annual Conference on Human and Language Technology
• /
• 1993.10a
• /
• pp.493-501
• /
• 1993

본 논문에서는 한글의 자소간 흘림의 연속 필기를 허용하는 원고 작성기의 구현을 연구하였다. 이러한 온라인 한글 필기의 응용에서는 신속한 인식속도를 갖는 인식방법이 요구되며, 인식중에도 계속적인 필기가 가능하도록 하여 사용자에게 편의를 제공할 수 있어야 한다. 본 논문에서는 이와같은 요구사항을 만족시키기 위하여 스트링 정합방법에 기반한 신속한 인식 방법을 사용한다. 또한, 글자인식과 필기데이타 수집이 병행적으로 처리되도록 구성됨으로써 원고작성시에 자유로운 필기동작이 가능하도록 하였다. 실험결과 50명이 쓴 21,076자에 대하여 88.96%의 인식률을 제공하였으며, 제안하는 구현 방법이 원고작성 응용에 적합하게 동작함을 알 수 있었다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.255-258
• /
• 2004

본 논문에서는 필기수식의 인식 및 계산을 목적으로 입력 필기수식의 심볼별 분리 및 순차적 정렬 후 인식하는 알고리즘을 제안한다. 제안된 방법은 온라인 필기인식의 특징인 실시간 개념을 이용하여 태블릿 상에서 입력받은 수식의 픽셀별 좌표를 입력받아서 분리 과정을 수행 한 후, 필기순서와 무관한 순차적인 하나의 완성된 수식을 제공한다. 다음으로 통계적 패턴 정합 및 숫자별 특정 가중치를 이용하여 완성된 수식을 인식하고 계산 결과를 출력한다. 본 모듈은 PDA에 임베디드를 목적으로 구현하였으며, 여러 검증과정을 통해 약 98%의 인식률 향상을 얻을 수 있었다.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.283-292
• /
• 2006

Interest about a latest security connection technology rises, and try to overcome security vulnerability Certification about on-line user methods through fingerprint that is biometries information apply. In this study, designs and implements fingerprint recognition system that is invariant to rotation by fingerprint recognition system for certification about on-line user. Proposed method focused in matching process through pre-process of fingerprint image, feature point extraction. Improved process time and correct recognition rate in fingerprint recognition system that is invariant to rotation presented in existing study. Also, improved noise, distortion problems that happen in preprocess of existing study applying directional Laplacian filter.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1102-1107
• /
• 2004

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using “Delta” and “Core” as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. Therefore, I would like to represent the more correct matching algorism in this paper which has not only better matching rate but also lower mismatching rate compared to the present matching algorism by selecting the line segment connecting two minutiae on the same ridge and furrow structures as the reference point.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.809-819
• /
• 2000

This paper deals with an optimal capacity allocation problem and performance analysis in Advanced Information Communication Processing System(AICPS). AICPS is a gateway system interconnection PSTN(Public Switched Telephone Network), ISDN(Intergrated Services Digital Network), PSDN(Packet Switched Data Network), internet, Frame Relay and ATM together. This study considers not only ISDN and Internet but also user behavior of On-line service which is analyzed by Markov process. A call blocking probability of TNAS and INAS is computed by Erlang's formula. Then, PNAS and WNAS's call blocking probability are computed by Stochastic knapsack modeling. The result is compared with result of simulation. Finally, we allocate an optimal capacity minimizing total call blocking probability.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.1-3
• /
• 2022

코로나 19 팬데믹으로 인한 4차 산업혁명이 앞당겨지고 초현실, 초실감, 초연결 사회 등의 키워드가 대두되고 언택트(Untact) 시대가 일상생활에 불가항력적으로 접목되면서 몰입감과 흥미성, 유희성을 목적으로 한 콘텐츠들이 다양하게 활성화되었다. 특히, 메타버스(Metaverse) 플랫폼이 빠르게 진화하면서 물리적 현실과 디지털 가상성을 융합한 다중 사용자에게 다양한 경험이 가능한 서비스가 주목받고 있다. 메타버스는 다중 사용자 플랫폼에서 원활한 커뮤니케이션과 대규모 멀티플레이가 가능한 온라인 비디오 게임, 오픈 게임 월드, AR 협업 공간과 호환되는 사회적, 몰입감이 있는 VR(Virtual Reality) 플랫폼 서비스 중 하나이다. 우리는 메타버스 플랫폼 개발 시 필요로 하는 요소기술 및 3D 데이터 획득을 통한 VR 콘텐츠를 설계하고 구현하고자 한다. 1) 콘텐츠 시나리오 및 사용자 인터랙션 설계; 2) 볼류메트릭 캡처를 활용한 실사 기반의 동적(Dynamic) 데이터 생성; 3) 컴퓨터 그래픽 기반 가상공간 설계 및 정적(Static)데이터 요소기술 개발; 4) 가상 현실 공간 데이터와 볼류메트릭 캡처의 실사 데이터 정합; 5) 공간 데이터 시각화 생성 및 모듈형 공간 이동 제어 기능 개발; 최종적으로 6) VR 환경에서의 콘텐츠 구현을 목표로 한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5385-5391
• /
• 2013

As on-line purchases is activated, customers' demand increases for the realistic and accurate digital information of a product design. In this paper, we propose a practical method that can generate a realistic 3D model of a real product using a 3D geometry obtained by a 3D scanner and its photographic images. In order to register images to the 3D geometry, the camera focal length, the CCD scanning aspect ratio and the transformation matrix between the camera coordinate and the 3D object coordinate must be determined. To perform this 2D-3D registration with consideration of computational complexity, a three-step method is applied, which consists of camera calibration, determination of a temporary optimum translation vector (TOTV) and nonlinear optimization for three rotational angles. A case study for a metallic coated industrial part, of which the colour appearance is hardly obtained by a 3D colour scanner has performed to demonstrate the effectiveness of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.892-898
• /
• 2012

Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.69-80
• /
• 1999

Recently, social requirements of personal identification techniques are rapidly expanding in a number of new application ares. Especially fingerprint recognition is the most important technology. Fingerprint recognition technologies are well established, proven, cost and legally accepted. Therefore, it has more spot lighted among the any other biometrics technologies. In this paper we propose a new on-line fingerprint recognition algorithm for non-inked type live scanner to fit their increasing of security level under the computing environment. Fingerprint recognition system consists of two distinct structural blocks: feature extraction and feature matching. The main topic in this paper focuses on the feature matching using the fingerprint minutiae (ridge ending and bifurcation). Minutiae matching is composed in the alignment stage and matching stage. Success of optimizing the alignment stage is the key of real-time (on-line) fingerprint recognition. Proposed alignment algorithm using clique shows the strength in the search space optimization and partially incomplete image. We make our own database to get the generality. Using the traditional statistical discriminant analysis, 0.05% false acceptance rate (FAR) at 8.83% false rejection rate (FRR) in 1.55 second average matching speed on a Pentium system have been achieved. This makes it possible to construct high performance fingerprint recognition system.