• Journal of the Korean Data and Information Science Society
• /
• v.5 no.1
• /
• pp.1-10
• /
• 1994

Projection pursuit(PP) is a computer-intensive method which seeks out interesting linear projections of multivariate data onto a lower dimension space by machine. By working with lower dimensional projections, projection pursuit avoids the sparseness of high dimensional data. We show through simulation that two projection pursuit discriminant mothods proposed by Chen(1989) and Huber(1985) do not improve very much the error rate than the existing methods and compare several classification procedures.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.573-580
• /
• 2001

The large amounts of high dimensional data contains a significant amount of noises by it own sparsity, which adds difficulties in high dimensional clustering. The CLIP is developed as a clustering algorithm to support characteristics of the high dimensional data. The CLIP is based on the incremental one dimensional projection on each axis and find product sets of the dimensional clusters. These product sets contain not only all high dimensional clusters but also they may contain noises. In this paper, we propose extended CLIP algorithm which refines the product sets that contain cluster. We remove high dimensional noises by applying two dimensional projections iteratively on the already found product sets by CLIP. To evaluate the performance of extended algorithm, we demonstrate its effectiveness through a series of experiments on synthetic data sets.

• Journal of information and communication convergence engineering
• /
• v.11 no.1
• /
• pp.62-68
• /
• 2013

This paper proposes a method for identification of harmful video images based on the degree of harmfulness in the video content. To extract harmful candidate frames from the video effectively, we used a video color extraction method applying a projection map. The procedure for identifying the harmful video has five steps, first, extract the I-frames from the video and map them onto projection map. Next, calculate the similarity and select the potentially harmful, then identify the harmful images by comparing the similarity measurement value. The method estimates similarity between the extracted frames and normative images using the critical value of the projection map. Based on our experimental test, we propose how the harmful candidate frames are extracted and compared with normative images. The various experimental data proved that the image identification method based on the 2-dimensional projection map is superior to using the color histogram technique in harmful image detection performance.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.568-576
• /
• 2001

Most of clustering algorithms data to degenerate rapidly on high dimensional spaces. Moreover, high dimensional data often contain a significant a significant of noise. which causes additional ineffectiveness of algorithms. Therefore it is necessary to develop algorithms adapted to the structure and characteristics of the high dimensional data. In this paper, we propose a clustering algorithms CLIP using the projection The CLIP is designed to overcome efficiency and/or effectiveness problems on high dimensional clustering and it is the is based on clustering on each one dimensional subspace but we use the incremental projection to recover high dimensional cluster and to reduce the computational cost significantly at time To evaluate the performance of CLIP we demonstrate is efficiency and effectiveness through a series of experiments on synthetic data sets.

• The Korean Journal of Applied Statistics
• /
• v.35 no.1
• /
• pp.63-75
• /
• 2022

This paper proposes the so-called MOSUM-based sparse projection method for change points detection in high-dimensional time series. Our method is inspired by Wang and Samworth (2018), however, our method improves their method in two ways. One is to find change points all at once, so it minimizes sequential error. The other is localized so that more robust to the mean changes offsetting each other. We also propose data-driven threshold selection using block wild bootstrap. A comprehensive simulation study shows that our method performs reasonably well in finite samples. We also illustrate our method to stock prices consisting of S&P 500 index, and found four change points in recent 6 years.

• Journal of Welding and Joining
• /
• v.30 no.1
• /
• pp.78-84
• /
• 2012

Due to the inherent dimensional uncertainty, tolerances accumulate in the final assembly. Tolerance accumulation has serious effect on the performance of ECV assembly. This paper proposes a method of tolerance accumulation analysis using Monte Carlo simulation, which includes welding process in assemble process. This method can predict the final tolerance distributions of the completed assembly with the prescribed statistical tolerance distribution of each part to be assembled. With the inclusion of welding, another dimensional uncertainties due to partial melting is to be accounted as well. Partial melting of projection height was included in the tolerance propagation analysis. Verification of the proposed method was performed by making use of Monte Carlo simulation. Monte Carlo simulation results showed promising results in that we can predict the final tolerance distributions in advance before actual assembly process of precision machinery.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3194-3216
• /
• 2018

Slow Feature Discriminant Analysis (SFDA) is a supervised feature extraction method inspired by biological mechanism. In this paper, a novel method called Two Dimensional Slow Feature Discriminant Analysis via $L_{2,1}$ norm minimization ($2DSFDA-L_{2,1}$) is proposed. $2DSFDA-L_{2,1}$ integrates $L_{2,1}$ norm regularization and 2D statically uncorrelated constraint to extract discriminant feature. First, $L_{2,1}$ norm regularization can promote the projection matrix row-sparsity, which makes the feature selection and subspace learning simultaneously. Second, uncorrelated features of minimum redundancy are effective for classification. We define 2D statistically uncorrelated model that each row (or column) are independent. Third, we provide a feasible solution by transforming the proposed $L_{2,1}$ nonlinear model into a linear regression type. Additionally, $2DSFDA-L_{2,1}$ is extended to a bilateral projection version called $BSFDA-L_{2,1}$. The advantage of $BSFDA-L_{2,1}$ is that an image can be represented with much less coefficients. Experimental results on three face databases demonstrate that the proposed $2DSFDA-L_{2,1}/BSFDA-L_{2,1}$ can obtain competitive performance.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.1
• /
• pp.5-14
• /
• 1995

An optical measurement method of three dimensional surface profiles which is named the slit beam projection is suggested and practically implemented. This method is intended especially for noncontact and fast digitization of sculptured surfaces for CAD modeling and die manufacturing. Its basic principles are based on geometric optics. Deatiled optical principles and an sub-pixel image processing technique to enhance the measuring resolutions are described in this study. The measuring performances of the slit beam projection are presented and discussed to demonstrate that an actual measuring accuracy of below .+-. 0.2mm can be achived over the whole measuring range(500mm*300mm*200mm)

• 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 Korea Society of Industrial Information Systems
• /
• v.14 no.5
• /
• pp.43-51
• /
• 2009

In this paper, we propose an efficient method of face retrieval by using PCA(principal component analysis) based features. The coarse-to-fine strategy is adopted to sort the retrieval results in the lower dimensional eigenface space and to rearrange candidates at high ranks in higher dimensional eigenface space. To evaluate similarity between a query face image and class reference image, we utilize the PD (projection distance), MQDF(modified quadratic distance function) and MED(minimum Euclidean distance). The experimental results show that the proposed method which rearrange the retrieval results incrementally by using projection distance is efficient for face image retrieval.