• Journal of the Korean Mathematical Society
• /
• v.61 no.2
• /
• pp.309-339
• /
• 2024

Let M be a real hypersurface in the complex hyperbolic quadric Q^m*, m ≥ 3. The Riemannian curvature tensor field R of M allows us to define a symmetric Jacobi operator with respect to the Reeb vector field ξ, which is called the structure Jacobi operator R_ξ = R( · , ξ)ξ ∈ End(TM). On the other hand, in [20], Semmelmann showed that the cyclic parallelism is equivalent to the Killing property regarding any symmetric tensor. Motivated by his result above, in this paper we consider the cyclic parallelism of the structure Jacobi operator R_ξ for a real hypersurface M in the complex hyperbolic quadric Q^m*. Furthermore, we give a complete classification of Hopf real hypersurfaces in Q^m* with such a property.

• International Journal of Advanced Culture Technology
• /
• v.6 no.3
• /
• pp.142-150
• /
• 2018

This paper describes the algorithm that lowers the dimension, maintains the object recognition and significantly reduces the eigenspace configuration time by combining the edge orientation histogram and principle component analysis. By using the detected object region as a recognition input image, in this paper the object recognition method combined with principle component analysis and the multi-layer network which is one of the intelligent classification was suggested and its performance was evaluated. As a pre-processing algorithm of input object image, this method computes the eigenspace through principle component analysis and expresses the training images with it as a fundamental vector. Each image takes the set of weights for the fundamental vector as a feature vector and it reduces the dimension of image at the same time, and then the object recognition is performed by inputting the multi-layer neural network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1238-1243
• /
• 2007

The computational complexity for the zero-forcing (ZF)-based multiuser (MU) multiple-input multiple-output(MIMO) preprocessing matrices can be immoderately large as the number of transmit antennas or users increases. In this paper, we show that the span of singular vector space of a matrix can be obtained from the singular vectors of the parted rows of that matrix with computational saving and propose a computationally efficient recursive-algorithm for achieving the ZF-based preprocessing matrices. Analysis about the complexities shows that a new recursive-algorithm can lighten the computational load.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.619-622
• /
• 2001

In this paper, an efficient approach to classification of transient and harmonic disturbances in power systems is proposed. First, the Stop-and-Go CA CFAR Detector is utilized to detect a disturbance from the power signals which are mixed with other disturbances and noise. Then, (i) Wigner Distribution, SVD(Singular Value Decomposition) and Fisher´s Criterion (ii) DWT and Fisher´s Criterion, are applied to extract an efficient feature vector. For the classification procedure, a combined neural network classifier is proposed to classify each corresponding disturbance class. Finally, the 10 class data simulated by Matlab power system blockset are used to demonstrate the performance of the proposed classification system.

• Journal of KSNVE
• /
• v.4 no.1
• /
• pp.71-82
• /
• 1994

We propose a systematic method to select the master states, which are retained in the reduced model after the order reduction process. The proposed method is based on the fact that the range space of right eigenvector matrix is spanned by orthogonal base vectors, and tries to keep the orthogonality of the submatrix of the base vector matrix as much as possible during the reduction process. To quentify the skewness of that submatrix, we define "Absolute Singularity Factor(ASF)" based on its singular values. While the degree of observability is concerned with estimation error of state vector and up to n'th order derivatives, ASF is related only to the minimum state estimation error. We can use ASF to evaluate the estimation performance of specific partial measurements compared with the best case in which all the state variables are identified based on the full measurements. A heuristic procedure to find suboptimal master states with reduced computational burden is also proposed. proposed.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.193-204
• /
• 1996

Overflow queuing models are ofter analyzed by explicitly solving a large sparse singular linear systems arising from Kolmogorov balance equation. The system is often converted into an eigenvalue problem the dominant eigenvector of which is the desired null vector. In this paper we convert an overflow queuing problem the dominant eigenvector of which is the desired null vector. In this paper we convert an overflow queuing problem into an overflow queuing problem into an eigen-value problem into an eigen-value problem of size 1/2 of the original. Then we devise an orthogonal projector that enhances its convergence by removing unsanted eigen-components effectively. Numerical result with some suggestion is given at the end.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.757-758
• /
• 2006

In this paper, the palmprint classification and recognition method based on PCA (Principal Components Analysis) using the dimension reduction of singular vector is proposed. And the 135dpi palmprint image which is obtained by the palmprint acquisition device is used for the effectual palmprint recognition system. The proposed system consists of the palmprint acquisition device, DB generation algorithm and the palmprint recognition algorithm. The palmprint recognition step is limited 2 times. As a results, GAR and FAR are 98.5% and 0.036%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.15-24
• /
• 2009

Compressed sensing addresses the recovery of a sparse vector from its few linear measurements. Recently, the success for the vector case has been extended to the matrix case. Compressed sensing of low-rank matrices solves the ill-posed inverse problem with fie low-rank prior. The problem can be formulated as either the rank minimization or the low-rank approximation. In this paper, we survey recently proposed efficient algorithms to solve these two formulations.

• Journal of the Society of Disaster Information
• /
• v.19 no.1
• /
• pp.10-17
• /
• 2023

Purpose: In this paper, a distance estimation technique for indoor location estimation using IR-UWB is proposed and researched. We propose an algorithm that can increase the SNR lowered due to clutter or noise in an indoor environment. Method: In order to clutter suppression and detect weak signals, we analyze the existing studies of background remover, correlation, and singular vector decomposition techniques and propose an algorithm. Result: The proposed algorithm, the average error was 0.57m up to 11.5m, and the error were 0.49m from 6m to 11.5m. the average error rate was reduced by about 1m compared to the previous study. Conclusion: It can be used as a technique for detecting weak signals in clutter and noise environments for distance or location estimation, and can also be used as a human life detection technique to reduce damage to people in a disaster situation by using UWB radar which has highly transparent.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.62-68
• /
• 2014

This paper presents a novel user selection method based on the signal-to-interference-plus-noise ratio (SINR), which is approximated using limited feedback data at the base stations (BSs) of multiple user multiple-input multiple-output (MU-MIMO) systems. In the proposed system, the codebook vector index, the quantization error obtained from the correlation between the measured channel and the codebook vector, and the measured value of the largest singular value are fed back from each user to the BS. The proposed method not only generates precoding vectors that are orthogonal to the precoding vectors of the previously selected users and are highly correlated with the codebook vector of each user but also adopts the quantization error in approximating the SINR, which eventually provides a significantly more accurate SINR than the conventional SINR-based user selection techniques. Computer simulations show that the proposed method enhances the sum rate of the conventional SINR-based methods by at least 2.4 (2.62) bps/Hz when the number of transmit antennas and number of receive antennas per user terminal is 4 and 1(2), respectively, with 100 candidate users and an SNR of 30 dB.