• Communications for Statistical Applications and Methods
• /
• v.22 no.2
• /
• pp.173-180
• /
• 2015

We propose a selection procedure of principal components in principal component regression. Our method selects principal components using variable selection procedures instead of a small subset of major principal components in principal component regression. Our procedure consists of two steps to improve estimation and prediction. First, we reduce the number of principal components using the conventional principal component regression to yield the set of candidate principal components and then select principal components among the candidate set using sparse regression techniques. The performance of our proposals is demonstrated numerically and compared with the typical dimension reduction approaches (including principal component regression and partial least square regression) using synthetic and real datasets.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1117-1130
• /
• 2010

The main goal for this paper is consider the necessary conditions and sufficient conditions of wavelet frames in higher dimensions with an arbitrary expanding matrix dilation. At first, we give a necessary condition of wavelet frame in $L^2(R^n)$, which generalizes the univariate results of Shi from one dimension with an arbitrary real number a(a > 1) dilation to higher dimension with an arbitrary expansive matrix dilation. Secondly, we deduce a necessary condition for wavelet frames in $L^2(R^n)$ when the function $\psi$ satisfies some property of the decay. For the case n = 1, we obtain a corollary which has weaker condition comparing with existing result.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.612-614
• /
• 2003

In this paper we propose four-dimensional (4D) operators, which can be used to deal with sequential changes of topological relationships between 4D moving objects and we call them 4D development operators. In contrast to the existing operators, we can apply the operators to real applications on 4D moving objects. We also propose a new approach to define them. The approach is based on a dimension-separated method, which considers x-y coordinates and z coordinates separately. In order to show the applicability of our operators we show the algorithms for the proposed operators and development graph between 4D moving objects.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2202-2205
• /
• 2001

This paper is composed of two parts. One is image preprocessing part to measure the condition of the lane and vehicle. This finds the information of lines using RGB ratio cutting algorithm, the edge detection and Hough transform. The other obtains the situation of other vehicles using the image processing and viewport. At first, 2 dimension image information derived from vision sensor is interpreted to the 3 dimension information by the angle and position of the CCD camera. Through these processes, if vehicle knows the driving conditions which are lane angle, distance error and real position of other vehicles, we should calculate the reference steering angle by steering controller.

• Journal of the Korean Data Analysis Society
• /
• v.20 no.6
• /
• pp.2733-2746
• /
• 2018

The two inverse regression estimation methods, SIR and SAVE to estimate the central space are computationally easy and are widely used. However, SIR and SAVE may have poor performance in finite samples and need strong assumptions (linearity and/or constant covariance conditions) on predictors. The two non-parametric estimation methods, MAVE and dMAVE have much better performance for finite samples than SIR and SAVE. MAVE and dMAVE need no strong requirements on predictors or on the response variable. MAVE is focused on estimating the central mean subspace, but dMAVE is to estimate the central space. This paper explores and compares four methods to explain the dimension reduction. Each algorithm of these four methods is reviewed. Empirical study for simulated data shows that MAVE and dMAVE has relatively better performance than SIR and SAVE, regardless of not only different models but also different distributional assumptions of predictors. However, real data example with the binary response demonstrates that SAVE is better than other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3348-3364
• /
• 2021

Magic matrix-based data hiding schemes are applied to transmit secret information through open communication channels safely. With the development of various magic matrices, some higher dimensional magic matrices are proposed for improving the security level. However, with the limitation of computing resource and the requirement of real time processing, these higher dimensional magic matrix-based methods are not advantageous. Hence, a kind of data hiding scheme based on a single or a group of multi-dimensional flexible magic matrices is proposed in this paper, whose magic matrix can be expanded to higher dimensional ones with less computing resource. Furthermore, an adaptive mechanism is proposed to reduce the embedding distortion. Adapting to the secret data, the magic matrix with least distortion is chosen to embed the data and a marker bit is exploited to record the choice. Experimental results confirm that the proposed scheme hides data with high security and a better visual quality.

• Bulletin of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.159-164
• /
• 1989

Let M be a hypersurface of dimension n(.geq.2) in an (n+1)-dimensional real space form over bar M(c) with constant curvature c and H the second fundamental tensor of M. M is said to be birecurrent if here exists a covariant tensor field .alpha. of order 2 such that .del.$^{2}$H=H .alpha., where .del. is the connection of M. Also, M is said to be recurrent if there exists a 1-form .betha. such that .del.H=H .betha.. Matsuyama [2] recently proved that a recurrent hypersurface M in a real space form is locally symmetric and a complete irreducible birecurrent hypersurface M in a real space form is recurrent. The main purpose of this paper is to characterize the birecurrent or recurrent hypersurface M of a Riemannian manifold with constant curvature c and to prove that M is classified as a cylinder, $M^{n}$ (c) or ( $c_{1}$)* $M^{n-r}$ ( $c_{2}$) where 1/ $c_{1}$+1/ $c_{2}$=1/c.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1090-1093
• /
• 1987

In this paper, we describe the principle, the procedure and calculation of the measurement. Finally the experimental results are shown and discussions are given. Interpreting of a skewed symmetry in the image as a real symmetry in the 3-D space provides strong constraints on 3-D sharp analysis. In order to apply the idea to the real scene, a method is presented which can find the skewed symmetry in the image of the skewed symmetrical object, even if it is occluded partly. there parameters of the skewed symmetry are estimated by examining peaks in two 2-D hough spaces, onto which the parameters of all candidates of boundary line segments for skewed symmetries are voted. The method is characterized with a small amount of computation, finding of multiple symmetry axes and inference of the occluded parts of the symmetrical object.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.43-48
• /
• 2005

A robot system encompassing a remote control and monitoring through a virtual robot design is addressed and a tracking problem for a 2D (2 dimension) moving target by a robot vision is chosen as a case study. The virtual robot is developed, and it synchronizes with the real robot by compensating delay time. Two systems are displayed on a remote panel by communicating command and image data. The virtual robot utilizes an OpenGL library in Visual $C^{++}$ environment. Additionally, the remote monitoring and control between the real robot and the virtual robot are accomplished by employing an appropriate data compression in a network communication.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.751-754
• /
• 2009

This paper deals with the Cell-based distributed processing for generating free viewpoint images by merging multiple differently focused images. We previously proposed the method of generating free viewpoint images without any depth estimation. However, it is not so easy to realize real-time image reconstruction based on our previous method. In this paper, we discuss the method to reduce the processing time by dimension reduction for image filtering and Cell-based distributed processing. Especially, the method of high-speed image reconstruction by the Cell processor on SONY PLAYSTATION3(PS3) is described in detail. We show some experimental results by using real images and we discuss the possibility of real-time free viewpoint image reconstruction.