• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 제14회 신호처리 합동 학술대회 논문집
• /
• pp.535-538
• /
• 2001

In this paper, we present a novel method to solve the inevitable RGB beam mismatch problem in projection TV receivers. Conventional methods solve the mismatch problem by directly controlling the cathode ray tube (CRT) using the convergence yoke (CY). Unlike conventional methods, the proposed method is based on digital video processing using image warping techniques. Firstly RGB beam projection paths are mathematically modeled. Then based on the modeling, the input video signal to CRT is prewarped so that RGB beams are landed at the same point on the screen. Since the proposed method is based on a digital video processing instead of using CY, it can outperform the conventional method in terms of quality and cost. The experimental results with a real 60´projection TV demonstrate that the proposed method indeed produces converged images on the projection TV screen.

• 한국정보과학회논문지:데이타베이스
• /
• 제37권5호
• /
• pp.250-257
• /
• 2010

스카이라인을 응용한 다양한 질의처리기법 중에 하나로 리버스 스카이라인이 연구되었다. 하지만 리버스 스카이라인을 이용한 다양한 위치기반서비스를 제공하기 위해서는 지금까지 연구된 리버스 다이나믹 스카이라인만으로는 제공할 수 있는 서비스에 한계가 있으며, 질의처리를 위한 비용도 크다는 단점이 존재했다. 본 논문에서는 거리공간의 객체정보를 대상으로 질의처리가 가능한 효과적인 연속 리버스 스카이라인 처리 기법을 제안한다. 제안하는 기법의 우수성을 보이기 위해서 제안하는 기법과 기존에 연구된 리버스 스카이라인 질의처리기법에 대한 성능평가를 수행하고 비교 분석했다. 그 결과, 기존의 기법보다 제안하는 기법이 연속질의를 처리하는데 우수한 성능을 보이는 것을 확인했다.

• 대한전자공학회논문지
• /
• 제27권12호
• /
• pp.1878-1888
• /
• 1990

In this paper, the input-output interconnection method of the multi-valued signal processing circuit using perfect Shuffle technique and Kronecker product is discussed. Using this method, the design method of circuit of the multi-valued Reed-Muller expansions(MRME) to be used the multi-valued signal processing on finite field GF(p**m) is presented. The proposed input-output interconnection method is shown that the matrix transform is efficient and that the module structure is easy. The circuit design of MRME on FG(p**m) is realized following as` 1) contructing the baisc gates on GF(3) by CMOS T gate, 2) designing the basic cells to be implemented the transform and inverse transform matrix of MRME using these basic gates, 3) interconnecting these cells by the input-output interconnecting method of the multivalued signal processing circuits. Also, the circuit design of the multi-valued signal processing function on GF(3\ulcorner similar to Winograd algorithm of 3x3 array of DFT (discrete fourier transform) is realized by interconnection of Perfect Shuffle technique and Kronecker product. The presented multi-valued signal processing circuits that are simple and regular for wire routing and posses the properties of concurrency and modularity are suitable for VLSI.

• International journal of advanced smart convergence
• /
• 제10권2호
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.

• 전자통신동향분석
• /
• 제33권4호
• /
• pp.54-60
• /
• 2018

In this paper, we analyze the trends of deep-learning based plant data processing technologies. In recent years, the deep-learning technology has been widely applied to various AI tasks, such as vision (image classification, image segmentation, and so on) and natural language processing because it shows a higher performance on such tasks. The deep-leaning method is also applied to plant data processing tasks and shows a significant performance. We analyze and show how the deep-learning method is applied to plant data processing tasks and related industries.

• 한국정보처리학회논문지
• /
• 제7권4호
• /
• pp.1132-1140
• /
• 2000

The purpose of this paper was to present the method of progress efficiency of morphosyntaxical analyzer for French information processing in the view of multilingual information processing. This study indicated that he method prohibit the additional useless word type by decomposing word type by decomposing works which were created by morphological amalgamation. Findings also suggested the need of preprocessing in order to decrease the overload of morphosyntaxical analysis algorithm. In addition, general rules were proposed to divide word form and to decompose complex sentence.

• 한국위성정보통신학회논문지
• /
• 제10권3호
• /
• pp.11-15
• /
• 2015

본 연구에서는 수재해 정보 플랫폼 내 자료처리 시스템 설계를 위해 자료처리 과정의 복잡도를 분석하고 이에 따른 설계 방안을 제시하였다. 일반적으로 자료를 수집하고 분석하는 시스템은 자료와 알고리즘의 자료처리 과정이 고정된 고정 자료-알고리즘 자료처리 방식을 사용한다. 하지만 시스템의 복잡도가 증가하면 자료처리 시스템에서 관리해야 하는 자료처리 과정의 수가 급증하는 문제가 발생한다. 이를 해결하기 위해 자료와 알고리즘 사이에 인터페이스가 존재하는 동적 자료-알고리즘 자료처리 방식을 적용할 수 있다. 각 방식의 장단점을 분석한 뒤, 수재해 정보 플랫폼에 최적화된 자료처리 시스템의 설계안을 제시할 수 있었다.

• 한국항행학회논문지
• /
• 제18권4호
• /
• pp.401-408
• /
• 2014

하둡(Hadoop)은 맵리듀스(MapReduce) 분산처리 프로그래밍 모델과 HDFS(Hadoop distributed file system) 분산 파일시스템으로 구성된다. 하둡은 빅데이터 처리에 적합한 프레임워크로서, 대량의 스몰파일 처리에 문제점이 있다. 하둡에서 대량의 스몰파일 처리는 하나의 파일마다 매퍼가 생성되며, 파일의 메타정보를 저장하기 위해 많은 메모리가 필요한 문제점이 있다. 본 논문은 하둡 플랫폼에서 다양한 방법으로 대량의 스몰파일 처리방법을 비교 검토하였다. 일반 압축은 데이터의 크기와 상관없이 하나의 매퍼로 처리해야 하기 때문에, 하둡 처리 포맷으로 적절하지 않다. 시퀀스 와 하둡 아카이브 파일의 처리는 스몰파일을 압축 및 병합을 통해 네임노드의 메모리 문제가 제거되었다. 하둡 아카이브 파일은 스몰파일의 병합시간이 시퀀스 파일보다 빠른 속도를 보였다. CombineFileInputFormat 클래스를 이용한 처리는 병합과정이 필요 없으며, 빅데이터 처리방법과 유사한 속도를 보였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.835-838
• /
• 2000

Popular methods for extracting a text region in video images are in general based on analysis of a whole image such as merge and split method, and comparison of two frames. Thus, they take long computing time due to the use of a whole image. Therefore, this paper suggests the faster method of extracting a text region without processing a whole image. The proposed method uses line sampling methods, FFT and neural networks in order to extract texts in real time. In general, text areas are found in the higher frequency domain, thus, can be characterized using FFT The candidate text areas can be thus found by applying the higher frequency characteristics to neural network. Therefore, the final text area is extracted by verifying the candidate areas. Experimental results show a perfect candidate extraction rate and about 92% text extraction rate. The strength of the proposed algorithm is its simplicity, real-time processing by not processing the entire image, and fast skipping of the images that do not contain a text.

• 산업경영시스템학회지
• /
• 제18권36호
• /
• pp.143-152
• /
• 1995

This paper determines the allocation of computers and data files to minimize the sum of processing and communication costs which occur in processing jobs at each node. The problem of optimally configuring a distributed computer system belongs to the class of NP-Complete problems and the object function of this paper is nonlinear function and is hard to solve. This paper seeks the solution of distributed processing system by Tabu Search. Firstly, it presents the method of generating the starting solution proper to the distributed processing system. Secondly, it develops the method of searching neighborhood solutions. Finally, it determines the Tabu restriction appropriate to the distributed processing system. According to the experimental results, this algorithm solves a sized problems in reasonable time and is effective in the convergence of the solution. The algorithm developed in this paper is also applicable to the general allocation problems of the distributed processing system.