• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1207-1214
• /
• 2008

We give an elementary proof of one of the main results in [H.O. Kim, R.Y. Kim, J.K. Lim, The infimum cosine angle between two finitely generated shift-invariant spaces and its applications, Appl. Comput. Har-mon. Anal. 19 (2005) 253-281] concerning the existence of an oblique projection onto a finitely generated shift-invariant space along the orthogonal complement of another finitely generated shift-invariant space under the assumption that the generators generate Riesz bases.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.3
• /
• pp.563-573
• /
• 2010

Using the fiberization technique of a shift-invariant space and the matrix characterization of the decomposition of a shift-invariant space of finite length into an orthogonal sum of singly generated shift-invariant spaces, we show that the main result in [13] can be interpreted as a statement about the length of a shift-invariant space, and give a more natural construction of multiwavelet frames from a frame multiresolution analysis of $L^2(\mathbb{R}^d)$.

• Honam Mathematical Journal
• /
• v.36 no.4
• /
• pp.901-906
• /
• 2014

In this note we provide a concrete description on the invariant subspaces for the backward shift on the Hardy space $H^2(\mathbb{T})$.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.139-151
• /
• 2012

In the previous paper, we gave a characterization of backward shift invariant subspaces of the Hardy space over the bidisk on which [${S_z}^n$, $S_w^*$] = 0 for a positive integer n ${\geq}$ 2. In this case, it holds that ${S_z}^n=cI$ for some $c{\in}\mathbb{C}$. In this paper, it is proved that if [$S_{\varphi}$, $S_w^*$] = 0 and ${\varphi}{\in}H^{\infty}({\Gamma}_z)$, then $S_{\varphi}=cI$ for some $c{\in}\mathbb{C}$.

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.613-623
• /
• 2016

As a generalization of the Fourier transform, the fractional Fourier transform plays an important role both in theory and in applications of signal processing. We present a new approach to reach a uniform sampling theorem in the shift-invariant spaces associated with the fractional Fourier transform domain.

• Journal of the Korean Mathematical Society
• /
• v.49 no.3
• /
• pp.571-583
• /
• 2012

Let $G$ be a metrizable, ${\sigma}$-compact locally compact abelian group with a compact open subgroup. In this paper we define the Gramian and the dual Gramian operators for shift invariant subspaces of $L^2(G)$ and we use them to characterize shift generated dual frames for shift in- variant spaces, which forms a frame for a subspace of $L^2(G)$. We present necessary and sufficient conditions for which standard dual is a unique SG-dual frame of type I and type II.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.6
• /
• pp.1229-1236
• /
• 2009

We introduce two kinds of quasi-inner functions. Since every rationally invariant subspace for a shift operator S$_K$ on a vector-valued Hardy space H$^2$(${\Omega}$, K) is generated by a quasi-inner function, we also provide relationships of quasi-inner functions by comparing rationally invariant subspaces generated by them. Furthermore, we discuss fundamental properties of quasi-inner functions and quasi-inner divisors.

• Journal of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.255-271
• /
• 2023

In this paper, we deal with random attractors for dynamical systems forced by a deterministic noise. These kind of systems are modeled as skew products where the dynamics of the forcing process are described by the base transformation. Here, we consider skew products over the Bernoulli shift with the unit interval fiber. We study the geometric structure of maximal attractors, the orbit stability and stability of mixing of these skew products under random perturbations of the fiber maps. We show that there exists an open set U in the space of such skew products so that any skew product belonging to this set admits an attractor which is either a continuous invariant graph or a bony graph attractor. These skew products have negative fiber Lyapunov exponents and their fiber maps are non-uniformly contracting, hence the non-uniform contraction rates are measured by Lyapnnov exponents. Furthermore, each skew product of U admits an invariant ergodic measure whose support is contained in that attractor. Additionally, we show that the invariant measure for the perturbed system is continuous in the Hutchinson metric.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.427-446
• /
• 1995

Let S be a set and B be a $\sigma$-field on S. We consider $(\Omega = S^Z, T = B^z, P)$ as the basic probability space. We denote by T the left shift on $\Omega$. We assume that P is invariant under T, i.e., $PT^{-1} = P$, and that T is ergodic. We denote by $X = \cdots, X_-1, X_0, X_1, \cdots$ the coordinate maps on $\Omega$. From our assumptions it follows that ${X_i}_{i \in Z}$ is a stationary and ergodic process.

• Journal of information and communication convergence engineering
• /
• v.21 no.2
• /
• pp.139-144
• /
• 2023

Engineers prefer deep neural networks (DNNs) for solving computer vision problems. However, DNNs pose two major problems. First, neural networks require large amounts of well-labeled data for training. Second, the covariate shift problem is common in computer vision problems. Domain adaptation has been proposed to mitigate this problem. Recent work on adversarial-learning-based unsupervised domain adaptation (UDA) has explained transferability and enabled the model to learn robust features. Despite this advantage, current methods do not guarantee the distinguishability of the latent space unless they consider class-aware information of the target domain. Furthermore, source and target examples alone cannot efficiently extract domain-invariant features from the encoded spaces. To alleviate the problems of existing UDA methods, we propose the mixup regularization in adversarial discriminative domain adaptation (ADDA) method. We validated the effectiveness and generality of the proposed method by performing experiments under three adaptation scenarios: MNIST to USPS, SVHN to MNIST, and MNIST to MNIST-M.