• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.485-487
• /
• 2015

본 논문에서는 애견의 안구 영상을 분석하여 백내장을 추출하는 방법을 제안한다. 제안된 방법은 애견의 영상에서 안구 영역을 선택한 후, 양선형 보간법을 적용하여 선택된 안구 영역을 확대한 후, 퍼지 스트레칭 기법을 적용하여 명암 대비를 강조한다. 강조된 영상에서 이진화 기법과 침식, 팽창기법을 적용하여 잡음 영역을 제거한다. 잡음이 제거된 안구 영역에 8 방향 윤곽선 추적 기법을 적용하여 백내장을 추출한다. 추출된 백내장 부분을 애견의 평균적인 백내장의 크기와 비교 분석하여 백내장 가능성을 도출한다.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.204-211
• /
• 1999

항공기, 자동차, 전차 등 차량의 시스템 또는 운동의 시뮬레이션에서는 다양한 종류의 불연속적인 파라미터 값들이 데이터 테이블의 형태로 주어지게 되는데, 본 연구에서의 관심은 적분 스텝의 크기가 고정되는 일반적인 실시간 시뮬레이션의 제약 하에서 기존의 검색 기법들을 비교하고, 최적의 검색 기법을 개발하는 것이다. 본 연구에서는 전통적으로 수치해석, 시뮬레이션, 데이터베이스 등 다양한 학문 및 응용기술 분야에서 개발된 데이터 검색 기법들을 조사하여 비교하였다. 또한, 다양한 크기와 형태의 데이터 테이블들을 사용하여 수치비교시험을 수행하였는데, 그 경향은 이론에 근거한 예상과 대체로 일치하였다. 한편, 검색하고자 하는 파라미터 값이 임의의 dynamics를 갖고 변한다면, 이러한 정보를 이용하여 주어진 데이터 테이블 내의 검색 영역을 축소 시켜 검색속도를 향상시킬 수가 있다. 다양한 수치시험에서 이분 검색법(bisection method)은 축소된 테이블의 크기에만 영향을 받지만 보간 검색법(interpolation method)과 그 변형 기법들은 검색 대상 테이블들의 축소로 데이터의 형태가 직선형이 되는 효과를 얻기 때문에 검색속도를 단축시키는데 매우 탁월한 효과를 나타내었다. 결론적으로 dynamic-window 개념을 도입한 보간 검색법과 그 변형들이 이론적으로도 실험적으로도 최적의 검색속도를 보장함이 입증되었다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.464-467
• /
• 2003

본 논문에서는 체적 데이터에 대한 효율적인 볼륨 랜더링을 수행하기 위해서, 기존의 광선 추적 기법에 광선 보간을 통해 광선을 추적하는 기법인 IRCF를 제안한다. IRCF 과정은 이웃 화소에 대해 광선추적을 통해서 얻은 불투명도의 정보를 이용하여 보간한 위치에서 새롭게 광선추적을 해가는 방식이다 기존의 광선 추적 랜더링의 경우 고화질의 영상을 얻지만, Volume Rendering Operations의 계샨량이 많아 랜더링 속도가 떨어져 현재 개선된 랜더링 기법들이 많이 제안되고 있는 실정이다. 본 논문은 다른 각도로의 접근하고자 하여 제안한 IRCF 과정을 통해 Volume Rendering Operations의 계샨량을 최대한 줄여 랜더링 속도를 높이고 기존 방식의 고화질 영상에 가깝게 결과를 얻을 수가 있었다. 또한, 본 논문에서는 기존의 광선 추적 기법에서 표현하는 일반적인 회전, 절단, 불투명 등 제어 효과들을 제안한 기법을 통해 비교 분석한다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.15 no.2
• /
• pp.207-213
• /
• 1997

The purpose of this study is to aim at presenting efficient technique of 3-D Terrain Modelling through multilateral approach methods and to compare with raw data, using low-densed randomly located point data. The subject religion of this study are selected two sites and take into consideration for degree of freedom about low-densed randomly located point data. The result of this study by precision analysis of digital cartographic map-ping using low-densed randomly located point data bave shown that . First, making digital cartographic map, the technique of making it using low-desned randomly located point data by TIN-based results to good and fast run-time in A and B sites all together. Second, the visualization analysis results of digital cartographic map using TIN and GRID-based terrain modeling techniqus similar exacts A and B sites, but the terrain modeling techniqus by TIN-based are small data size than GRID-based with the data with the data size of saving with DXF files. Third, making digital catographic map using terrain modeling techniques by Grid-based, the standard errors of low-densed randomly located point data and interpolated data using gridding method have more good results by radial basis function interpolation techniques at A and B sites all together.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.5D
• /
• pp.895-907
• /
• 2006

In this study, in order to maximize the accuracy and efficiency of the existing interpolation method fractal methods are applied. Developed FEDISA model revives the irregularity of the real terrain with only a few information about base terrain, which can produce almost complete geographic information. The area of the model is set to $150m{\times}150m$, $300m{\times}300m$, $600m{\times}600m$, $1,200m{\times}1,200m$ to compare the real data with the data of the existing interpolation method and FEDISA model. By statistical verification of the results, the adaptability and efficiency of FEDISA model are investigated. It seems that FEDISA model will help a lot to obtain the terrain information about the changed terrain, such as the bottom of reservoirs and dams as well as large amount of destruction due to cutting and banking.

• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.873-882
• /
• 2011

In this paper, we propose an efficient deinterlacing algorithm which interpolates the missing scan lines by weighted summing of the intra and the inter interpolation pixels according to the spatio-temporal variation. In the spatial interpolation, we adopt a new edge based spatial interpolation method which includes edge directional refinement. The conventional edge dependent interpolation algorithms are very sensitive to noise due to the failure of estimating edge direction. In order to exactly detect edge direction, our method first finds the edge directions around the pixel to be interpolated and then refines edge direction of the pixel using weighted maximun frequent filter. Futhermore, we improve the accuracy of motion detection by reducing the possibility of motion detection error using 3 tab median filter. In the final interpolation step, we adopt weighted sum of intra and inter interpolation pixels according to spatio-temporal variation ratio, thereby improving the quality in slow moving area. Simulation results show the efficacy of the proposed method with significant improvement over the previous methods in terms of the objective PSNR quality as well as the subjective image quality.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.6
• /
• pp.504-510
• /
• 2004

The objective of this paper is to propose the image interpolation method with pseudomedian filter for Field warping and morphing, and to evaluate and analyze its subjective image quality. The Field warping relatively gives rise to more computing overhead, but it can use the control line to control the warping result with more elaboration. Due to the working characteristics of the image warping and morphing process, various complex geometrical transformations occur and a image interpolation technique is needed to effectively process them. Of the various interpolation techniques, bilinear interpolation which shows above average performance is the most widely used. However, this technology has its limits in the reconstructivity of diagonal edges. The proposed interpolation method is to efficiently combine the bilinear interpolation and the pseudomedian filter-based interpolation which shows good performance in the reconstructivity of diagonal edges. According to the proposed interpolation method, we could get more natural warping and morphing results than other interpolation methods.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.7
• /
• pp.333-341
• /
• 2008

In this paper, a new interpolation model for the head related transfer function (HRTF) was proposed. In the method herein, we assume that the impulse response of the HRTF for each azimuth angle is given by linear interpolation of the time-delayed neighboring impulse responses of HRTFs. The time delay of the HRTF for each azimuth angle is given by sum of the sound wave propagation time from the ears to the sound source, which can be estimated by using azimuth angle, the physical shape of the underlying head and the distance between the head and sound source, and the refinement time yielding the minimum mean square error. Moreover, in the proposed model, the interpolation intervals were not fixed but varied, which were determined by minimizing the total number of HRTFs while the synthesized signals have no perceptual difference from the original signals in terms of sound location. To validate the usefulness of the proposed interpolation model, the proposed model was applied to the several HRTFs that were obtained from one dummy-head and three human heads. We used the HRTFs that have 5 degree azimuth angle resolution at 0 degree elevation (horizontal plane). The experimental results showed that using only $30\sim40%$ of the original HRTFs were sufficient for producing the signals that have no audible differences from the original ones in terms of sound location.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.618-633
• /
• 2000

In this paper, a Gaussian interpolation filter and cubic interpolation filter are presented to do more accurate channel estimation compared to the conventional linear interpolation filter for COFDM systems. In addition to an interpolation filter, a low pass filter using FFT and IFFT is also presented to reduce the noisy components of a channel estimate obtained by an interpolation filter. Channel estimates after low-pass filtering combined with interpolation filters can lower the error floor compared to the use of only interpolation filters. Computer simulation demonstrates that the presented channel estimation methods exhibit an improved performance compared to the conventional linear interpolation filter for COFDM systems in time-varying multipath fading channel and0.1 ~ 0.2 dB of Eb/No difference at BER=10-4 when the perfect channel estimation is compared.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.345-354
• /
• 2005

Subsequence matching is one of the most important operations in the field of data mining. The existing subsequence matching algorithms use only one index, and their performance gets worse as the difference between the length of a query sequence and the site of windows, which are subsequences of a same length extracted from data sequences to construct the index, increases. In this paper, we propose a new subsequence matching method based on index interpolation to overcome such a problem. An index interpolation method constructs two or more indexes, and performs search ing by selecting the most appropriate index among them according to the given query sequence length. In this paper, we first examine the performance trend with the difference between the query sequence length and the window size through preliminary experiments, and formulate a search cost model that reflects the distribution of query sequence lengths in the view point of the physical database design. Next, we propose a new subsequence matching method based on the index interpolation to improve search performance. We also present an algorithm based on the search cost formula mentioned above to construct optimal indexes to get better search performance. Finally, we verify the superiority of the proposed method through a series of experiments using real and synthesized data sets.