• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1520-1522
• /
• 2015

본 논문은 기존의 시간적으로 이웃한 프레임 사이의 움직임을 추정 보상하여 새로운 프레임을 생성하는 프레임률 향상 기법 (frame rate up conversion)을 제안한다. 움직임 추정(Motion Estimation)을 통하여 계산된 움직임 벡터를 이용하여 프레임을 생성하며, 생성된 프레임에서 발생되는 구멍 (hole)과 중첩 (overlap) 영역을 처리하는 기법을 제안한다. 특히 k-NN 보간법(k-nearest neighbor interpolation)[3]과 중간값을 적응적으로 활용하여 향상된 화질의 영상을 생성한다. 실험 결과를 통하여 제안하는 기술의 우수성을 입증하였다.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.339-347
• /
• 2011

As the volume visualization has been applied to render medical datasets, there has been a requirement to produce high quality images. Even though nice images can be generated by using previous linear filter, high order filter is required for better images. However, it takes much time for high order resampling, so that, overall rendering time is increased. In this paper, we perform high quality volume visualization using the cardinal interpolation. By enabling the empty space leaping which reduces the number of resampling, we achieve the efficient visualization. In detail, we divide the volume data into small blocks and leap empty blocks by referring the upper and lower bound value for each block. We propose a new method to estimate upper and lower bound value of for each block. As the result, we noticeably accelerated high quality volume visualization.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.1-10
• /
• 2014

In this paper, we propose MPI gridding algorithm of LiDAR data that minimizes the communication between the cores. The LiDAR data collected from aircraft is a 3D spatial information which is used in various applications. Since there are many cases where the LiDAR data has too high resolution than actually required or non-surface information is included in the data, filtering the raw LiDAR data is required. In order to use the filtered data, the interpolation using the data structure to search adjacent locations is conducted to reconstruct the data. Since the processing time of LiDAR data is directly proportional to the size of it, there have been many studies on the high performance parallel processing system using MPI. However, previously proposed methods in parallel approach possess possible performance degradations such as imbalanced data size among cores or communication overhead for resolving boundary condition inconsistency. We conduct empirical experiments to verify the effectiveness of our proposed algorithm. The results show that the total execution time of the proposed method decreased up to 4.2 times than that of the conventional method on heterogeneous clusters.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.10 no.1
• /
• pp.37-44
• /
• 1998

In this study a new hybrid method is developed for solving flow-dominated transport problems accurately and effectively. The method takes the forward-tracking particle method for advection. However, differently from the random-walk Lagrangian approach it solves the diffusion process on the fixed Eulerian grids. Therefore, neither any interpolating algorithm nor a large enough number of particles is required. The method was successfully examined for both cases of instantaneous and continuous sources released at a point. Comparison with a surrounding 5-point Hermite polynomial method (Eulerian-Lagrangian method) and the random-walk pure Lagrangian method shows that the present method is superior in result accuracy and time-saving ability.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.8-17
• /
• 2012

In this paper we proposes a new framework to obtain 3D shape information of thin film rapidly. The conventional equipments based on reflectometry are not suitable for obtaining 3D overall shape information of thin film rapidly since they require more than 30 minutes to measure the absolute thickness for 170 points. The proposed framework is based on an image analysis method that extracts contour lines from interference fringes images using Canny edge detector. The absolute thickness for contour lines are measured and then a height map from the contour lines is obtained by interpolation using Borgefors distance transformation. The extracted height map is visualized using the DirectX 3D terrain rendering method. The proposed framework can provide 3D overall shape information of thin film in about 5 minutes since relatively small number of real measurement for contour lines is required.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.33 no.4
• /
• pp.217-224
• /
• 2020

In this study, a framework for optimizing the opening in an outrigger wall is proposed. To solve a constrained bounded optimization problem, an in-house finite element program and SQP algorithm in Python SciPy library are utilized. The openings of the outrigger wall are located according to the strut-tie behavior of the outrigger wall deep beam. A linear interpolation method is used to obtain differentiable continuous functions required for optimization, whereas a database is used for the efficiency of the optimization program. By comparing the result of the two-variable optimization through the moving path of the search algorithm, it is confirmed that the algorithm efficiently determines the optimized result. When the size of each opening is set to individual variables rather than the same width of all openings, the value of the objective function is minimized to obtain better optimization results. It was confirmed that the optimization time can be effectively reduced when using the database in the optimization process.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.257-267
• /
• 2014

Distributed compressive video sensing (DCVS) is a low cost sampling paradigm for video coding based on the compressive sensing and the distributed video coding. In this paper, we propose using a skip-mode coding in DCVS under the assumption that in case of high temporal correlation, temporal interpolation can guarantee sufficiently good quality of nonkey frame, therefore no need to transmit measurement data in such a nonkey frame. Furthermore, we extend it to use a hierarchical structure for better temporal interpolation. Simulation results show that the proposed skip-mode coding can save the average subrate of whole video sequence while the PSNR is reduced only slightly. In addition, by using the proposed scheme, the computational complexity is also highly decreased at decoder on average by 43.75% for video sequences that have strong temporal correlation.

• Journal of Advanced Navigation Technology
• /
• v.13 no.3
• /
• pp.378-384
• /
• 2009

In this paper, we consider a cyclostationary-feature-detection based spectrum sensing algorithm for ATSC signal detection. One of the proposed algorithms for IEEE 802.22 standardization organization which meet the requirements of IEEE 802.22 is Thomson's algorithm based on cyclostationary feature detection. We propose an interpolation-based spectrum sensing algorithm for ATSC signal detection, which has less computation complexity than that of Thomson's algorithm and provides no performance loss compared to Thomson's algorithm. By using zero-padding in time domain and effective sensing scanning method, the proposed algorithm requires less computational complexity and shows no performance degradation compared to Thomson's algorithm.

• Journal of Broadcast Engineering
• /
• v.18 no.5
• /
• pp.702-712
• /
• 2013

In this paper, we proposed an algorithm that extracts the airway and lung without loss of information in spite of the pulmonary vessel and nodules of the chest wall in the chest CT images. We use a mask image in order to improve the performance and to save processing time of airway and lung segmentation. In the second step, by converting left and right lungs to binary image using the morphological information, we have removed the solitary pulmonary nodule to identify the value of the threshold lung and the chest wall. The last step is to connect the outer shell of the lung with cubic Spline interpolation by adding the perfect pixel and computing the distance of the removed part. Experimental results using Matlab verified that the proposed method could overcome the drawbacks of the conventional methods.

• The Journal of the Korea Contents Association
• /
• v.8 no.2
• /
• pp.74-82
• /
• 2008

This paper investigates chrominance reconstruction methods that reconstruct subsampled chrominance information efficiently using the correlation between luminance and chrominance components in the decompression process of compressed images, and analyzes drawbacks involved in the adaptive-weighted 2-dimensional linear interpolation among the methods, which shows higher efficiency in the view of computational complexity than other methods. To improve the drawback that the spatial frequency distribution is not considered for the decompressed image and to support the application on a low-performance system in behalf of 2-dimensional linear interpolation, this paper proposes the multi-mode reconstruction method which uses three reconstruction methods having different computational complexity from each other according to the degree of edge response of luminance component. The performance evaluation on a development platform for embedded systems showed that the proposed reconstruction method supports the similar level of image quality for decompressed images while reducing the overall computation time for chrominance reconstruction in comparison with the 2-dimensional linear interpolation.