• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.273-277
• /
• 2009

A compressed video stream is very sensitive to transmission errors that may severely degrade the reconstructed image. Therefore, error resilience is an essential problem in video communications. In this paper, we propose novel temporal error concealment techniques for recovering lost or erroneously received macroblock (MB). To reduce the computational complexity, the proposed method adaptively determines the search range for each lost MB to find best matched block in the previous frame. And the original corrupted MB split into for $8{\times}8$ sub-MBs, and estimates motion vector (MV) of each sub-MB using its boundary information. Then the estimated MVs are utilized to reconstruct the damaged MB. In simulation results, the proposed method shows better performance than conventional methods in both aspects of PSNR.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.18 no.5
• /
• pp.457-463
• /
• 2005

This paper presents a method for analyzing irregular shaped power distribution networks. The irregular shaped metal-dielectric-metal plane is split into several piece of rectangular segments to calculate the impedance of the irregular shaped plane. Impedance matrix for each rectangular segments is calculated using the Mobius transform method to reduce the calculation time. Then the segmentation and do-segmentation method is applied to the piece of rectangular segments. Applied to the 6 inch by 5 inch size irregular shaped board, the proposed method shows 10 times faster than the electromagnetic or circuit analysis method.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.124-126
• /
• 2003

다차원 색인 기법 M-트리는 노드의 중심점과 객체간의 상대적 거리로 색인을 구성하고, 검색 공간에 포함되는 객체를 액세스하는 기법으로서 노드들은 페이지 단위로 구성되며 하위 엔트리들을 포함할 수 있는 반경, 즉 유사도 거리에 의해 노드의 영역이 표현되어진다. 그러나 이와 같은 노드의 영역 표현에 있어서 노드 색인공간의 중첩으로 인해 질의 시 검색 패스가 증가하고 이로 인해 거리계산과 디스크 입출력의 증가를 야기하는 문제를 갖는다. 본 논문에서는 M-트리에서 문제가 되고 있는 노드 색인 공간의 중첩을 최소화할 수 있는 노드 분할 정책을 제안한다. 기존의 M-트리와는 다르게 노드의 가상 중심점을 계산하여 그것을 라우팅 객체로 만들어 노드를 커버하는 영역을 최소화하고 노드 안의 엔트리를 재분배하여 밀도 높은 노드를 구성 하도록 한다. 제안된 분할 알고리즘의 효율성을 증명하기 위한 실험 결과 색인공간의 중첩이 줄고 이로 인해 거리계산과 디스크 입출력의 횟수가 줄어듦을 보였다.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.150-152
• /
• 2003

Laser scanned lidar data record 3D surface information in detail. Exploring valuable spatial information from lidar data is a prerequisite task for its applications, such as DEM generation and 3D building model reconstruction. However, the inherent spatial information is implicit in the abundant, densely and randomly distributed point cloud. This paper proposes a novel method to organize point cloud data, so that further analysis or feature extraction can proceed based on a well organized data model. The principle of the proposed algorithm is to segment point cloud into 3D planes. A split and merge segmentation based on the octree structure is developed for the implementation. Some practical airborne and ground lidar data are tested for demonstration and discussion. We expect this data organization could provide a stepping stone for extracting spatial information from lidar data.

• Current Optics and Photonics
• /
• v.4 no.6
• /
• pp.530-539
• /
• 2020

Hyperspectral images feature a relatively narrow band and are easily disturbed by noise. Accurate estimation of the types and parameters of noise in hyperspectral images can provide prior knowledge for subsequent image processing. Existing hyperspectral-noise estimation methods often pay more attention to the use of spectral information while ignoring the spatial information of hyperspectral images. To evaluate the noise in hyperspectral images more accurately, we have proposed a spectral-spatial cooperative noise-evaluation method. First, the feature of spatial information was extracted by Gabor-filter and K-means algorithms. Then, texture edges were extracted by the Otsu threshold algorithm, and homogeneous image blocks were automatically separated. After that, signal and noise values for each pixel in homogeneous blocks were split with a multiple-linear-regression model. By experiments with both simulated and real hyperspectral images, the proposed method was demonstrated to be effective and accurate, and the composition of the hyperspectral image was verified.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.11
• /
• pp.771-780
• /
• 2001

It is indispensable to use the process and device simulation tool in order to analyze accurately the electrical characteristics of ULSI CMOS devices, in addition to developing and manufacturing those devices. The 3D Monte Carlo (MC) simulation result is not efficient for large-area application because of the lack of simulation particles. In this paper is reported a new efficient simulation strategy for 3D MC ion implantation into large-area application using the 3D MC code of TRICSI(TRansport Ions into Crystal Silicon). The strategy is related to our newly proposed split-trajectory method and ion-splitting method(ion-shadowing approach) for 3D large-area application in order to increase the simulation ions, not to sacrifice the simulation accuracy for defects and implanted ions. In addition to our proposed methods, we have developed the cell based 3D interpolation algorithm to feed the 3D MC simulation result into the device simulator and not to diverge the solution of continuous diffusion equations for diffusion and RTA(rapid thermal annealing) after ion implantation. We found that our proposed simulation strategy is very computationally efficient. The increased number of simulation ions is about more than 10 times and the increase of simulation time is not twice compared to the split-trajectory method only.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.37-43
• /
• 2020

In this paper, we propose an efficient AB² multiplication algorithm using SPB(shifted polynomial basis) over finite fields. Using the feature of the SPB, we split the equation for AB² multiplication into two parts. The two partitioned equations are executable at the same time, and we derive an algorithm that processes them in parallel. Then we propose an efficient semi-systolic AB² multiplier based on the proposed algorithm. The proposed multiplier has less area-time (AT) complexity than related multipliers. In detail, the proposed AB² multiplier saves about 94%, 87%, 86% and 83% of the AT complexity of the multipliers of Wei, Wang-Guo, Kim-Lee, Choi-Lee, respectively. Therefore, the proposed multiplier is suitable for VLSI implementation and can be easily adopted as the basic building block for various applications.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.485-491
• /
• 2012

This paper proposes 'Coding Unit Tree' based on quadtree efficiently with motion vector to represent splitting information of a Coding Unit (CU) in HEVC. The new international video coding, High Efficiency Video Coding (HEVC), adopts various techniques and new unit concept: CU, Prediction Unit (PU), and Transform Unit (TU). The basic coding unit, CU is larger than macroblock of H.264/AVC and it splits to process image-based quadtree with a hierarchical structure. However, in case that there are complex motions in CU, the more signaling bits with motion information need to be transmitted. This structure provides a flexibility and a base for a optimization, but there are overhead about splitting information. This paper analyzes those signals and proposes a new algorithm which removes those redundancy. The proposed algorithm utilizes a type code, a dominant value, and residue values at a node in quadtree to remove the addition bits. Type code represents a structure of an image tree and the two values represent a node value. The results show that the proposed algorithm gains 13.6% bit-rate reduction over the HM-1.0.

• The Journal of the Korea Contents Association
• /
• v.8 no.3
• /
• pp.8-17
• /
• 2008

A new algorithm for automatic extraction of interesting objects is proposed in this paper. The proposed algorithm can be summarized in two steps. First, segmentation of color image that split interesting objects and backgrounds is performed. According to the research stating, 'Humans perceive things by contracting color into three to four essential colors,' a color image is segmented into three regions utilizing k-mean algorithm, followed by annexing the regions when the similarities of them exceeds the critical value based on the calculation of degrees in the histogram similarity, Second, identifying the interesting objects out of the segmented image, partitioned by the image composition theory, is performed. To have a good picture, it is important to adjust positions of interesting objects according to picture composition. Extracting objects is a retro-deduction process using a weighted mask designed upon the triangular composition of picture. To prove the quality of the proposed method, experiments are performed over four hundreds images as well as comparison with recently proposed KMCC and GBIS methods.