• Title/Summary/Keyword: kernel estimation

Search Result 294, Processing Time 0.034 seconds

Approach for visualizing research trends: three-dimensional visualization of documents and analysis of relative vitalization

  • Yea, Sang-Jun;Kim, Chul
    • International Journal of Contents
    • /
    • 제10권1호
    • /
    • pp.29-35
    • /
    • 2014
  • This paper proposes an approach for visualizing research trends using theme maps and extra information. The proposed algorithm includes the following steps. First, text mining is used to construct a vector space of keywords. Second, correspondence analysis is employed to reduce high-dimensionality and to express relationships between documents and keywords. Third, kernel density estimation is applied in order to generate three-dimensional data that can show the concentration of the set of documents. Fourth, a cartographical concept is adapted for visualizing research trends. Finally, relative vitalization information is provided for more accurate research trend analysis. The algorithm of the proposed approach is tested using papers about Traditional Korean Medicine.

붓스크랩 기법을 이용한 다심 광커넥터 손실특성 예측 (Bootstrap Simulation for Performance Evaluation of Optical Multifiber Connectors)

  • 전오곤;강기훈
    • 품질경영학회지
    • /
    • 제26권4호
    • /
    • pp.250-264
    • /
    • 1998
  • The purpose of the thesis is to develop simulation program for forecasting of optical connector. So we can achieve the time and the money saving for making the optical connector. Optical performance (insertion loss) of optical connector mainly relies on 3 misalignment factors-ferrule factor due to mis-manufacture from design, auto-centering effect that is fiber behavior phenomena between hole and fiber, fiber misalignment factor. Simulation use experimental data with auto-centering effect and fiber factor and use pseudo data with ferrule through random number generation because it is developing stage. In this study we a, pp.y kernel density estimation method with experimental data in order to know whether it belong to or not specific parametric distribution family. And we simulate to forecast insertion loss of optical multifiber connector under specific design model using nonparametric bootstrap resampling data and parametric pseudo samples from uniform distribution. We obtain the tolerance specifications of misalignment factors satisfying not exceed in maximum 1.0dB and choose optimal hole diameter.

  • PDF

Exploratory Methods for Joint Distribution Valued Data and Their Application

  • Igarashi, Kazuto;Minami, Hiroyuki;Mizuta, Masahiro
    • Communications for Statistical Applications and Methods
    • /
    • 제22권3호
    • /
    • pp.265-276
    • /
    • 2015
  • In this paper, we propose hierarchical cluster analysis and multidimensional scaling for joint distribution valued data. Information technology is increasing the necessity of statistical methods for large and complex data. Symbolic Data Analysis (SDA) is an attractive framework for the data. In SDA, target objects are typically represented by aggregated data. Most methods on SDA deal with objects represented as intervals and histograms. However, those methods cannot consider information among variables including correlation. In addition, objects represented as a joint distribution can contain information among variables. Therefore, we focus on methods for joint distribution valued data. We expanded the two well-known exploratory methods using the dissimilarities adopted Hall Type relative projection index among joint distribution valued data. We show a simulation study and an actual example of proposed methods.

새로운 커널을 이용한 웨이블릿 영역에서의 이진 블록 정합 움직임 예측 (New Kernel for 1BT Block Motion Estimation based on the Wavelet Transform)

  • 유근호;이혁;정제창
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2010년도 하계학술대회
    • /
    • pp.299-302
    • /
    • 2010
  • 영상 압축은 멀티미디어 전송에 있어 핵심적인 기술이다. 동영상 압축 기술 중 움직임 예측부는 전체 동영상 압축 부호화에서 가장 복잡한 부분으로, 멀티미디어의 실시간 전송을 위하여 고속 알고리듬이 필요한 부분이다. 본 논문은 기존의 고속 움직임 예측 알고리듬의 하나인 이진 블록 정합 움직임 예측 알고리듬을 개선하여 더욱 빠른 속도의 알고리듬을 제안한다. 제안하는 알고리듬은 웨이블릿 변환 후 새로운 커널을 적용하여 기존의 알고리듬을 개선한다. 제안하는 알고리듬은 기존의 알고리듬의 속도를 유지하면서 화질을 개선시킨다.

  • PDF

THE MEAN-SQUARE ERROR BOUNDS FOR THE GAUSSIAN QUADRATURE OF ANALYTIC FUNCTIONS

  • Ko, Kwan-Pyo;Park, U-Jin
    • 대한수학회지
    • /
    • 제34권2호
    • /
    • pp.293-307
    • /
    • 1997
  • In this paper we present the $L^2$-estimation for the kernel $K_n$ of the remaider term for the Gaussian quadrature with respect to one of four Chebyshev weight functions and the error bound of the type on the contour $$ $\mid$R_n(f)$\mid$ \leq \frac{2\pi}{\sqrt{l(\Gamma)}} max_{z\in\Gamma}$\mid$f(z)$\mid$ (\smallint_\Gamma $\mid$K_n(z)$\mid$^2$\mid$dz$\mid$)^\frac{2}{1}, $$ where $l(\Gamma)$ denotes the length of the contour $\Gamma$.

  • PDF

TFT-LCD 영상에서 결함 군집도 특성 기반의 확률밀도함수를 이용한 결함 검출 알고리즘 (Defect Detection algorithm of TFT-LCD Polarizing Film using the Probability Density Function based on Cluster Characteristic)

  • 구은혜;박길흠
    • 한국멀티미디어학회논문지
    • /
    • 제19권3호
    • /
    • pp.633-641
    • /
    • 2016
  • Automatic defect inspection system is composed of the step in the pre-processing, defect candidate detection, and classification. Polarizing films containing various defects should be minimized over-detection for classifying defect blobs. In this paper, we propose a defect detection algorithm using a skewness of histogram for minimizing over-detection. In order to detect up defects with similar to background pixel, we are used the characteristics of the local region. And the real defect pixels are distinguished from the noise using the probability density function. Experimental results demonstrated the minimized over-detection by utilizing the artificial images and real polarizing film images.

Parameter optimization for SVM using dynamic encoding algorithm

  • Park, Young-Su;Lee, Young-Kow;Kim, Jong-Wook;Kim, Sang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.2542-2547
    • /
    • 2005
  • In this paper, we propose a support vector machine (SVM) hyper and kernel parameter optimization method which is based on minimizing radius/margin bound which is a kind of estimation of leave-one-error. This method uses dynamic encoding algorithm for search (DEAS) and gradient information for better optimization performance. DEAS is a recently proposed optimization algorithm which is based on variable length binary encoding method. This method has less computation time than genetic algorithm (GA) based and grid search based methods and better performance on finding global optimal value than gradient based methods. It is very efficient in practical applications. Hand-written letter data of MNI steel are used to evaluate the performance.

  • PDF

Restoration of Chest X-ray by Kalman Filter

  • Kim, Jin-Woo
    • Journal of information and communication convergence engineering
    • /
    • 제8권5호
    • /
    • pp.581-585
    • /
    • 2010
  • A grid was sandwiched between two cascaded imaging plates. Using a fan-beam X-ray tube and a single exposure scheme, the two imaging plates, respectively, recorded grid-less and grid type information of the object. Referring to the mathematical model of the Grid-less and grid technique, it was explained that the collected components whereas that of imaging plates with grid was of high together with large scattered components whereas that of imaging plate with grid was of low and suppressed scattered components. Based on this assumption and using a Gaussian convolution kernel representing the effect of scattering, the related data of the imaging plates were simulated by computer. These observed data were then employed in the developed post-processing estimation and restoration (kalman-filter) algorithms and accordingly, the quality of the resultant image was effectively improved.

종단간 순방향/역방향 전송 지연에 따른 TCP Reno 혼잡제어 알고리즘 성능향상 (Performance improvement of TCP Reno congestion control algorithm using end-to-end estimation of forward/backward delay variation)

  • 한규형;김은기
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2005년도 추계학술발표대회 및 정기총회
    • /
    • pp.1295-1298
    • /
    • 2005
  • 기존 TCP Reno 의 혼잡 제어는 트래픽에 수동적으로 동작하는 방법으로서 혼잡이 이미 발생한 상태에서 동작하게 되므로 발생 시점의 라우터 버퍼는 이미 최대치에 도달해 있게 된다. 따라서 이후에 도착하는 모든 패킷은 폐기되므로 이 패킷들을 전송한 모든 송신원은 거의 동시에 윈도우 크기를 줄이는 Slow-start 단계에 들어가게 되어 일시적으로 링크 사용률이 떨어지는 전역 동기화(global synchronization)가 발생하게 된다. 이러한 문제를 해결하기 위해서는 네트워크의 혼잡이 발생하기 전에 능동적으로 대처하는 방안이 필요하다. 본 논문에서는 새로운 RTT 계산 알고리즘인 순방향/역방향 전송지연 알고리즘을 이용하여 네트워크의 혼잡을 미리 예측하고 네트워크 혼잡에 능동적으로 대처할 수 있는 새로운 알고리즘을 제안한다. 본 논문에서는 리눅스(Linux) 커널(Kernel)의 TCP Reno 의 흐름제어 및 혼잡제어를 수정하여 네트워크 혼잡에 능동적으로 대처 할 수 있는 새로운 TCP Reno 를 설계, 구현하였다.

  • PDF

Estimating Discriminatory Power with Non-normality and a Small Number of Defaults

  • Hong, C.S.;Kim, H.J.;Lee, J.L.
    • 응용통계연구
    • /
    • 제25권5호
    • /
    • pp.803-811
    • /
    • 2012
  • For credit evaluation models, we extend the study of discriminatory power based on AUC obtained from a ROC curve when the number of defaults is small and distribution functions of the defaults and non-defaults are normal distributions. Since distribution functions do not satisfy normality in real world, the distribution functions of the defaults and non-defaults are assumed as normal mixture distributions based on results that the normal mixture could be better fitted than other distribution estimation methods for non-normal data. By using several AUC statistics, the discriminatory power under such a circumstance is explored and compared with those of normal distributions.