• Communications for Statistical Applications and Methods
• /
• v.15 no.1
• /
• pp.87-94
• /
• 2008

Andrews (1972) proposed to combine trigonometric functions to represent n observations of p variates, where the coefficients in linear sums are taken from the values of corresponding observation's respective variates. By viewing Andrews' plot as a collection of n trajectories of p-dimensional objects (observations) as a weighting point loaded with dimensional weights moves along a certain path on the hyper-dimensional sphere, we develop graphical techniques for further uses in data visualization. Specifically, we show that the parallel coordinate plot is a special case of Andrews' plot and we demonstrate the versatility of Andrews' plot with a projection pursuit engine.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.361-370
• /
• 2001

Testing equality of covariance matrix of k populations has long been an interesting issue in statistical inference. To overcome the sparseness of data points in a high-dimensional space and deal with the general cases, we suggest several projection pursuit type statistics. Some results on the limiting distributions of the statistics are obtained. some properties of Bootstrap approximation are investigated. Furthermore, for computational reasons an approximation which is based on Number theoretic method for the statistics is adopted. Several simulation experiments are performed.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.213-220
• /
• 2002

Anthropometric survey is important as a basis for human engineering fields. According to our experiences, there are difficulties in obtaining the measurements of some body parts because respondents are reluctant to expose. In order to overcome these difficulties, we propose a method for estimating such hard-to-measure measurements by using easy-to-measure measurements those are closely related to them. Multiple Regression Model, Feedforward Neural Network(FNN) Model and Projection Pursuit Regression(PPR) Model will be used as analytical tools for this purpose. The method we propose will be illustrated with real data from the 1992 Korea national anthropometric survey.

• Communications for Statistical Applications and Methods
• /
• v.4 no.2
• /
• pp.327-332
• /
• 1997

다층 신경망은 비모수 회귀함수 추정의 한 방법이다. 다충 신경망을 학습시키기 위해 역전파 알고리즘이 널리 사용되고 있다. 그러나 이 알고리즘은 이상치에 매우 민감하여 이상치를 포함하고 있는 자료에 대하여 원하지 않는 회귀함수를 추정한다. 본 논문에서는 통계물리에서 자주 사용하는 방법을 이용하여 로버스트 역전파 알고리즘을 제안하고 수학적으로 신경망과 매우 유사한 PRP(projection pursuit regression) 방법, 일반적인 역전파 알고리즘과 모의실험을 통해 비교 분석한다.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.271-275
• /
• 2005

현대시로부터 $C^d-$분할표를 생성하여 그의 구조적 특징을 사영탐색-플롯(Projection Pursuit-plot)을 이용하여 조사하는 방법을 소개하고, 여러 시집에서 자주 인용된 김소월 시와 서정주 시들에 적용하여 유사성을 비교한다.

• The Korean Journal of Applied Statistics
• /
• v.29 no.6
• /
• pp.1061-1075
• /
• 2016

In this paper, we discuss various methods to visualize high dimensional large-scale data and review some issues associated with visualizing this type of data. High-dimensional data can be presented in a 2-dimensional space with a few selected important variables. We can visualize more variables with various aesthetic attributes in graphics or use the projection pursuit method to find an interesting low-dimensional view. For large-scale data, we discuss jittering and alpha blending methods that solve any problem with overlapping points. We also review the R package tabplot, scagnostics, and other R packages for interactive web application with visualization.

• Journal of IKEEE
• /
• v.25 no.1
• /
• pp.76-82
• /
• 2021

In this paper, the compressed sensing basic pursuit denoise algorithm adopted to synthetic aperture radar imaging is investigated to improve the object recognition. From the incomplete data sets for image processing, the compressed sensing algorithm had been integrated to recover the data before the conventional back- projection algorithm was involved to obtain the synthetic aperture radar images. This method can lead to the reduction of measurement events while scanning the objects. An ultra-wideband radar scheme using a stripmap synthetic aperture radar algorithm was utilized to detect objects hidden behind the box. The Ultra-Wideband radar system with 3.1~4.8 GHz broadband and UWB antenna were implemented to transmit and receive signal data of two conductive cylinders located inside the paper box. The results confirmed that the images can be reconstructed by using a 30% randomly selected dataset without noticeable distortion compared to the images generated by full data using the conventional back-projection algorithm.

• The Korean Journal of Applied Statistics
• /
• v.12 no.2
• /
• pp.335-345
• /
• 1999

시뮬레이션 실행 시간이 매우 오래 걸려서 보통 이용하는 비선형최고제곱법으로는 시뮬레이션의 입력 파라메터(또는 절대 상수)를 추정하기 힘든 경우의 추정 문제를 통계적인 메타모델을 이용하여 해결하는 방법에 대하여 기술하였다. 미리 답을 알고 있는 장난감 모형을 이용하여 절대 상수를 추정하기 위해 사용되는 세가지 통계적 메타모델들(전통적 희귀모형, 공간적 선형모형 그리고 projection pursuit 희귀모형)의 성능을 비교하였다. 그 결과 일양 크리깅(universal Kriging)에 의한 공간적 모형이 가장 우수하였고, 이를 실제 핵융합 시뮬레이션 자료에 적용하여 절대 상수를 추정하였다.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.843-848
• /
• 1999

Support vector machine(SVM) is a new and very promising classification and regression technique developed by Bapnik and his group at AT&T Bell laboratories. However it has failed to establish itself as common machine learning tool. This is partly due to the fact that SVM is not easy to implement and its standard implementation requires the optimization package for quadratic programming. In this paper we present simple iterative Kernl Adatron algorithm for nonparametric regression which is easy to implement and guaranteed to converge to the optimal solution and compare it with neural networks and projection pursuit regression.

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

Within the last several years, there has been a large number of algorithms developed for face recognition. The majority of these algorithms have been view- and projection-based algorithms. Our definition of projection is not restricted to projecting the image onto an orthogonal basis the definition is expansive and includes a general class of linear transformation of the image pixel values. The class includes correlation, principal component analysis, clustering, gray scale projection, and matching pursuit filters. In this paper, we perform a detailed analysis of this class of algorithms by evaluating them on the FERET database of facial images. In our experiments, a projection-based algorithms consists of three steps. The first step is done off-line and determines the new basis for the images. The bases is either set by the algorithm designer or is learned from a training set. The last two steps are on-line and perform the recognition. The second step projects an image onto the new basis and the third step recognizes a face in an with a nearest neighbor classifier. The classification is performed in the projection space. Most evaluation methods report algorithm performance on a single gallery. This does not fully capture algorithm performance. In our study, we construct set of independent galleries. This allows us to see how individual algorithm performance varies over different galleries. In addition, we report on the relative performance of the algorithms over the different galleries.