• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2005.11a
• /
• pp.175-178
• /
• 2005

TM plane-wave scattering from finite rectangular grooves in a conducting plane is systematically analyzed with the overlapping T-block method. Multiple rectangular grooves are divided into several overlapping T-blocks to obtain the fast CPU time, CAD applicability, and wide versatility. The scattered fields are obtained in simple closed forms including a fast-convergent integral.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.57-57
• /
• 2001

본 논문은 영상 시퀸스로부터 이미지 모자이킹의 구성을 위한 효율적인 알고리즘을 기술한다. 영상의 기하학적인 특징을 이용하거나 비선형 방정식을 풀었던 기존의 알고리즘과는 달리, 제안한 알고리즘은 4개의 유사특징점을 이용해 영상간 사영 변환식의 8개 파라미터를 직접 계산한다. 본 논문에서 정의된 유사특징점은 영상의 그레이레벨의 분산을 기반으로 하고, 두 영상의 중첩 영역에서만 결정된다. 또한 선택된 4개의 유사특징점에 대한 대응점 검출을 위해 카메라 이동 및 조명 변화에 의한 영상의 변화를 고려한 블록 정합 알고리즘을 적용한다. 제안된 알고리즘은 다양한 영상에 적용하여 그 성능을 평가하였다. 모의 실험 결과는 제안된 알고리즘이 기존의 알고리즘에 비해 계산량을 감소시키면서, 정확한 사영 변환식을 유도하여 모자이킹 영상을 구성하는 것을 보여주고 있다.

• Journal of KIISE:Software and Applications
• /
• v.26 no.4
• /
• pp.487-499
• /
• 1999

공간 또는 다차원 데이터베이스에서는 노드영역의 중첩 및 다차원성 때문에 다수의 색인 노드를 읽어야 하는 질의가 빈번히 나타난다. 이와 관련하여 기존 연구에서는 질의를 처리하기 위해 읽어야하는 노드의 수를 줄일수 있는 새로운 색인방법을 다수 제안하였으며 본 논문에서는 같은 수의 노드를 디스크에서 빨리 읽을 수 있도록 클러스터링하는 간단한 방법을 제안한다. 제안된 방법은 노드를 형제 노드 군으로 분할하여 한 형제 노드군을 연속된 디스크 블록 군에 저장하고 노드 분할 또는 병합이 일어날때도 이런 클러스터링을 동적으로 유지한다. 약 130,000개의 TIGER 데이터와 Hilbert R-트리를 이용할 실험 결과 , 제안된 형제 노드 클러스터링을 통해 공간 영역 질의, 공간 근접질의, 공간조인 질의 등을 처리할 때 필요한 디스크 접근 시간을 최대 86%까지 줄일 수 있었다. 반면 색인 갱신과정에서 형제노드 클러스터링을 동적으로 유지하는 데 필요한 디스크 읽기 쓰기 회수의 증가량은 1% 미만밖에 되지 않았다.

• Journal of the Society of Naval Architects of Korea
• /
• v.45 no.6
• /
• pp.637-645
• /
• 2008

It is very hard to control the quality of coating work in shipbuilding process, because it is highly affected by several parameters such as space between object and nozzle tip, spray velocity, pressure, tip size, etc.. Even so a coating work in shipbuilding is done by workers' experience and skill as yet. It causes not only an excessive use of paints but also a decrease of productivity. In order to solve this problem, we developed a formula that predicts the film thickness and determined the proper coating pattern. Also we had done a series of experiments to verify the results of this study.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.271-272
• /
• 2007

In this paper, we propose a modified overlapped block-based motion estimation(MOBME) algorithm for a frame rate up conversion. The proposed method performs motion estimation based on the OBME and FSME. The proposed method shows better performance in estimating the true motion than the conventional method.

• Annual Conference on Human and Language Technology
• /
• 2023.10a
• /
• pp.388-392
• /
• 2023

개체 추출은 정보추출의 기초를 구성하는 태스크로, 관계 추출, 이벤트 추출 등 다양한 정보추출 태스크의 기반으로 중요하다. 최근에는 다중 레이블 개체와 중첩 개체를 다루기 위해 스팬기반의 개체추출이 주류로 연구되고 있다. 본 논문에서는 스팬을 표현하는 다양한 매핑과 자질들을 살펴보고 개체추출의 성능에 어떤 영향을 주는지를 분석하여 최적의 매핑 및 자질 조합을 제시하였다. 또한, 모델 구조에 있어서, 사전 학습 언어모델(PLM) 위에 BiLSTM 블록의 추가 여부에 따른 성능 변화를 분석하고, 모델의 학습에 있어서, 미세조정(finetuing) 이전에 예열학습(warmup training)을 사용하는 것이 효과적인지를 실험을 통해 비교 분석하여 제시하였다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.11 s.102
• /
• pp.1131-1137
• /
• 2005

An orthogonal frequency division multiplexing(OFDM) system has the problem of peak-to-average power ratio (PAPR) due to the overlapping phenomena of many sub-carriers. In order to improve the performance of PAPR, we propose in this paper a new genetic sub-block phase weighting(GA-SPW) using the SPW technique. Not only the selecting mapping(SLM) and the partial sequence(PTS) but also the previously proposed SPW becomes more effective as the number of sub-blocks and phase elements increases. However, all of them have limitation on the number of sub-blocks since the searching repetition increases exponentially as the number of sub-blocks increases. Therefore, in this research, a new GA SPW is proposed to reduce the amount of calculation by using Genetic algorithm(GA). In the proposed method, the number of calculations involved in the iterative phase searching yields to depend on the number of population and generation not on the number of sub-blocks and phase elements. The superiority of the proposed method is presented in the experimental results and analysis.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

• Journal of the Korean Society of Radiology
• /
• v.17 no.5
• /
• pp.671-677
• /
• 2023

When a scintillator block is constructed using fine scintillator pixels, the scintillator block located at the edge of the scintillator block results in overlapping images. To solve this problem, a light guide was inserted between the scintillator block and the photosensor, and images of all scintillation pixels were separated and acquired. However, loss of light may occur through the light guide, which eventually affects the quality of the image due to a decrease in energy resolution. Therefore, in this study, a detector was designed that can separate scintilltion pixels better by using a reflector on the side of the light guide and can secre excellent energy resolution by minimizing light loss. For comparative evaluation with previous studies, flood images were obtained through DETECT2000 capable of light simulation, and the degree of separation and light collection rate were evaluated. When a reflector was used on the side of the light guide, all materials showed excellent separation regardless of the material of the light guide, which showed better separation results than previous studies. In addition, the light collection rate was more that five times better when the reflector was applied than when it wa not. If this detector is applied to a small animal positron emission tomography, it will be possilbe to secre excellent image quality through excellent spatial resolution and energy resolution.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.1
• /
• pp.1-9
• /
• 2009

OFDM(Orthogonal Frequency Division Multiplexing) system is robust to frequency selective fading and narrowband interference in high-speed data communications. However, an OPDM signal consists of a number of independently modulated subcarriers and the superposition of these subcarriers causes a problem that can give a large PARR(Peak-to-Average Power Ratio). PTS(Partial Transmit Sequence) scheme can reduce the PAPR by dividing OFDM signal into subblocks and then multiplying the phase weighting factors to each subblocks, but computational complexity for selecting of phase weighting factors increases exponentially with the number of subblocks. Therefore, in this paper, MG-PSO(Modified Greedy algorithm-Particle Swarm Optimization) algorithm that combines modified greedy algorithm and PSO(Particle Swarm Optimization) algorithm is proposed to use for the phase control method in PTS scheme. This method can solve the computational complexity and guarantee to reduce PAPR. We analyzed the performance of the PAPR reduction when we applied the proposed method to telecommunication systems.