• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.4
• /
• pp.137-143
• /
• 2002

Because Block Pulse functions are used in a variety of fields such as the analysis and controller design of systems, it is necessary to find the more exact value of the Block Pulse series coefficients. This paper presents a method for the state estimation of the time-invariant linear systems via the improved estimation method for the Block Pulse coefficients by using the Simpson's rule. The proposed method using the Simpson's rule improve the accuracy of the Block Pulse coefficients.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.639-642
• /
• 1999

There exist geometrically invariant relations in single-view images under a specific geometrical structure. This invariance may be utilized for 3D object recognition. Two types of invariants are compared in terms of the robustness to the variation of the feature points. Deviation of the invariant relations are measured by adding random noise to the feature point location. Zhu’s invariant requires six points on adjacent planes having two sets of four coplanar points, whereas the Kaist method requires four coplanar points and two non-coplanar points. Experimental results show that the latter method has the advantage in choosing feature points while suffering from weak robustness to the noise.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.591-600
• /
• 2013

This paper addresses a feature-based robust watermarking scheme for digital images using a local invariant features of SURF (Speeded-Up Robust Feature) descriptor. In general, the feature invariance is exploited to achieve robustness in watermarking schemes, but the leakage of information about hidden watermarks from publicly known locations and sizes of features are not considered carefully in security perspective. We propose embedding and detection methods where the watermark is bound with circular areas and inserted into extracted circular feature regions. These methods enhance the robustness since the circular watermark is inserted into the selected non-overlapping feature regions instead of entire image contents. The evaluation results for repeatability measures of SURF descriptor and robustness measures present the proposed scheme can tolerate various attacks, including signal processing and geometric distortions.

• Journal of Information Processing Systems
• /
• v.11 no.4
• /
• pp.643-654
• /
• 2015

Face recognition under controlled settings, such as limited viewpoint and illumination change, can achieve good performance nowadays. However, real world application for face recognition is still challenging. In this paper, we propose using the combination of Affine Scale Invariant Feature Transform (SIFT) and Probabilistic Similarity for face recognition under a large viewpoint change. Affine SIFT is an extension of SIFT algorithm to detect affine invariant local descriptors. Affine SIFT generates a series of different viewpoints using affine transformation. In this way, it allows for a viewpoint difference between the gallery face and probe face. However, the human face is not planar as it contains significant 3D depth. Affine SIFT does not work well for significant change in pose. To complement this, we combined it with probabilistic similarity, which gets the log likelihood between the probe and gallery face based on sum of squared difference (SSD) distribution in an offline learning process. Our experiment results show that our framework achieves impressive better recognition accuracy than other algorithms compared on the FERET database.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.1
• /
• pp.20-27
• /
• 1987

The hierarchical approach method is proposed to sperate each different time scale sub-systems from linear time invariant multi-parameter singular perturbation systems. By means of this proposal, the original multi-parameter singular perturbation systems is completely separated into independent subsystems with each different time scale. It is also investigated that the controllability of the system is invariant. And this paper applies singular perturbation methods to the minimum control effort problem for linear time invariant systems with constrained controls. Also near-optimum control theory, which is based on dividing the total time interval with the time scales respectively, is proposed. As a result, the time scale separation method is show to be particularly useful in a near optimum design which can be otained through a decentralized control structure.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.4
• /
• pp.919-920
• /
• 2011

For two even unimodular positive definite integral quadratic forms A[X], B[X] in n-variables, J. K. Koo [1, Theorem 1] showed that ${\theta}_A(\tau)/{\theta}_B(\tau)$ is a rational function of J, satisfying a certain condition. Where ${\theta}_A(\tau)$ and ${\theta}_B(\tau)$ are theta series related to A[X] and B[X], respectively, and J is the classical modular invariant. In this paper we give a simple proof of Theorem 1 of [1].

• Communications of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.981-989
• /
• 2019

In this paper we deal with some shadowing properties of discrete dynamical systems on a compact metric space via the density of subdynamical systems. Let $f:X{\rightarrow}X$ be a continuous map of a compact metric space X and A be an f-invariant dense subspace of X. We show that if $f{\mid}_A:A{\rightarrow}A$ has the periodic shadowing property, then f has the periodic shadowing property. Also, we show that f has the finite average shadowing property if and only if $f{\mid}_A$ has the finite average shadowing property.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.8 no.2
• /
• pp.15-21
• /
• 2004

A Conjugate Gradiant (CG) method is proposed for unconstained optimization which is invariant to a nonlinear scaling of a strictly convex quadratic function. The technique has the same properties as the classical CG-method when applied to a quadratic function. The algorithm derived here is based on a logarithmic model and is compared to the standard CG method of Fletcher and Reeves [3]. Numerical results are encouraging and indicate that nonlinear scaling is promising and deserves further investigation.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.91-97
• /
• 1993

In this article, we consider the case that S is a topologically complete subspace of $R^{k}$ , and that .GAMMA. is a set of monotone functions on S into S. It is obtained the sugficient condition for the existence of a unique invariant probability to which $P^{(n}$/(x,dy) converges exponentially fast in a metric stronger than the Kolmogorov's distance. This extends the earlier results of Bhattacharya and Lee (1988) who considered the case .GAMMA. a set of nondecreasing functions.tions.

• Journal of the Korean Mathematical Society
• /
• v.45 no.4
• /
• pp.903-921
• /
• 2008

A continuous linear operator $T\;:\;X{\rightarrow}X$ is called hypercyclic if there exists an $x\;{\in}\;X$ such that the orbit ${T^nx}_{n{\geq}0}$ is dense. We consider the problem: given an operator $T\;:\;X{\rightarrow}X$, hypercyclic or not, is the restriction $T|y$ to some closed invariant subspace $y{\subset}X$ hypercyclic? In particular, it is well-known that any non-constant partial differential operator p(D) on $H({\mathbb{C}}^d)$ (entire functions) is hypercyclic. Now, if q(D) is another such operator, p(D) maps ker q(D) invariantly (by commutativity), and we obtain a necessary and sufficient condition on p and q in order that the restriction p(D) : ker q(D) $\rightarrow$ ker q(D) is hypercyclic. We also study hypercyclicity for other types of operators on subspaces of $H({\mathbb{C}}^d)$.