• 충청수학회지
• /
• 제23권1호
• /
• pp.65-71
• /
• 2010

Let $\Lambda$ be a transitive set for f. In this paper, we show that if a f-invariant set $\Lambda$ has the $C^{1}$-stably shadowing property, then $\Lambda$ admits a dominated splitting.

• 대한수학회보
• /
• 제36권1호
• /
• pp.203-207
• /
• 1999

In this paper, we find a condition of an open subset of the affine space which admits a cocompact affine action. To do it, the asymptotic flag of an open convex subset is introduced and some applications to affine manifolds are presented.

• East Asian mathematical journal
• /
• 제26권5호
• /
• pp.655-670
• /
• 2010

The complete multipartite graph $K_{n(m)}$ with n $ {\geq}$ 4 partite sets of size m is shown to have a decomposition into 4-cycles in such a way that vertices of each cycle belong to distinct partite sets of $K_{n(m)}$, if 4 divides the number of edges. Such cycles are called gregarious, and were introduced by Billington and Hoffman ([2]) and redefined in [3]. We independently came up with the result of [3] by using a difference set method, and improved the result so that the composition is circulant, in the sense that it is invariant under the cyclic permutation of partite sets. The composition is then used to construct gregarious 4-cycle decompositions when one partite set of the graph has different cardinality than that of others. Some results on joins of decomposable complete multipartite graphs are also presented.

• ETRI Journal
• /
• 제23권2호
• /
• pp.41-51
• /
• 2001

MPEG-7 standardization work has started with the aims of providing fundamental tools for describing multimedia contents. MPEG-7 defines the syntax and semantics of descriptors and description schemes so that they may be used as fundamental tools for multimedia content description. In this paper, we introduce a texture based image description and retrieval method, which is adopted as the homogeneous texture descriptor in the visual part of the MPEG-7 final committee draft. The current MPEG-7 homogeneous texture descriptor consists of the mean, the standard deviation value of an image, energy, and energy deviation values of Fourier transform of the image. These are extracted from partitioned frequency channels based on the human visual system (HVS). For reliable extraction of the texture descriptor, Radon transformation is employed. This is suitable for HVS behavior. We also introduce various matching methods; for example, intensity-invariant, rotation-invariant and/or scale-invariant matching. This technique retrieves relevant texture images when the user gives a querying texture image. In order to show the promising performance of the texture descriptor, we take the experimental results with the MPEG-7 test sets. Experimental results show that the MPEG-7 texture descriptor gives an efficient and effective retrieval rate. Furthermore, it gives fast feature extraction time for constructing the texture descriptor.

• 충청수학회지
• /
• 제24권1호
• /
• pp.19-34
• /
• 2011

A bounded linear operator T on a complex Banach space X is said to have property (I) provided that T has Bishop's property (${\beta}$) and there exists an integer p > 0 such that for a closed subset F of ${\mathbb{C}}$ ${X_T}(F)={E_T}(F)=\bigcap_{{\lambda}{\in}{\mathbb{C}}{\backslash}F}(T-{\lambda})^PX$ for all closed sets $F{\subseteq}{\mathbb{C}}$, where $X_T$(F) denote the analytic spectral subspace and $E_T$(F) denote the algebraic spectral subspace of T. Easy examples are provided by normal operators and hyponormal operators in Hilbert spaces, and more generally, generalized scalar operators and subscalar operators in Banach spaces. In this paper, we prove that if T has property (I), then the quasi-nilpotent part $H_0$(T) of T is given by $$KerT^P=\{x{\in}X:r_T(x)=0\}={\bigcap_{{\lambda}{\neq}0}(T-{\lambda})^PX$$ for all sufficiently large integers p, where ${r_T(x)}=lim\;sup_{n{\rightarrow}{\infty}}{\parallel}T^nx{\parallel}^{\frac{1}{n}}$. We also prove that if T has property (I) and the spectrum ${\sigma}$(T) is finite, then T is algebraic. Finally, we prove that if $T{\in}L$(X) has property (I) and has decomposition property (${\delta}$) then T has a non-trivial invariant closed linear subspace.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1420-1423
• /
• 2002

The classification and recognition of two-dimensional trademark patterns independently of their position, orientation, size and scale by proposing two feature vectors has been discussed. The paper presents experimentation on two feature vectors showing size- invariance and scale-invariance respectively. Both feature vectors are equally invariant to rotation as well. The feature extraction is based on local as well as global statistics of the image. These feature vectors have appealing mathematical simplicity and are versatile. The results so far have shown the best performance of the developed system based on these unique sets of feature. The goal has been achieved by segmenting the image using connected-component (nearest neighbours) algorithm. Second part of this work considers the possibility of using back propagation neural networks (BPN) for the learning and matching tasks, by simply feeding the feature vectosr. The effectiveness of the proposed feature vectors is tested with various trademarks, not used in learning phase.

• 대한수학회보
• /
• 제56권1호
• /
• pp.169-178
• /
• 2019

Let $M^{2n+1}$, $n{\geq}1$, be a smooth manifold with a pseudoconvex integrable CR structure of hypersurface type. We consider a sequence of CR invariant subsets $M={\mathcal{S}}_0{\supset}{\mathcal{S}}_1{\supset}{\cdots}{\supset}{\mathcal{S}}_n$, where $S_q$ is the set of points where the Levi-form has nullity ${\geq}q$. We prove that ${\mathcal{S}}{_q}^{\prime}s$ are locally given as common zero sets of the coefficients $A_j$, $j=0,1,{\ldots},q-1$, of the characteristic polynomial of the Levi-form. Some sufficient conditions for local existence of complex submanifolds are presented in terms of the coefficients $A_j$.

• 대한수학회지
• /
• 제58권1호
• /
• pp.91-107
• /
• 2021

A bounded linear operator T on a separable infinite dimensional Banach space X is called strongly hypercyclic if $$X{\backslash}\{0\}{\subseteq}{\bigcup_{n=0}^{\infty}}T^n(U)$$ for all nonempty open sets U ⊆ X. We show that if T is strongly hypercyclic, then so are Tn and cT for every n ≥ 2 and each unimodular complex number c. These results are similar to the well known Ansari and León-Müller theorems for hypercyclic operators. We give some results concerning multiplication operators and weighted composition operators. We also present a result about the invariant subset problem.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2010년도 춘계학술발표대회
• /
• pp.405-408
• /
• 2010

This paper presents a new feature extraction technique, correlation coefficient and Manhattan distance (MD) based method for recognition of rotated object in an image. This paper also represented a new concept of intensity invariant. We extracted global features of an image and converts a large size image into a one-dimensional vector called circular feature vector's (CFVs). An especial advantage of the proposed technique is that the extracted features are same even if original image is rotated with rotation angles 1 to 360 or rotated. The proposed technique is based on fuzzy sets and finally we have recognized the object by using histogram matching, correlation coefficient and manhattan distance of the objects. The proposed approach is very easy in implementation and it has implemented in Matlab7 on Windows XP. The experimental results have demonstrated that the proposed approach performs successfully on a variety of small as well as large scale rotated images.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.32-35
• /
• 2003

In this paper, we describe how to represent lower case hand-written English alphabets by a sequence of two to seven fuzzy sets. Each fuzzy set represents an arc segment of the character and each arc segment is assumed to be a part of an ellipse. The part of an ellipse is defined by five quantities: its short and long radii, its orientation angle, whether it is a part of the lower half or the upper half and whether it is the full half or a part of a half. Hence, we use the Cartesian product of five fuzzy sets to represent each arc segment. We show that this representation is a translation, rotation, and scaling invariant and that it can be used to generate the hand-written English alphabets. The representation we describe is different from the one proposed earlier by the author and when compared with the previous representation, the one described in this paper simulates more closely the behavior of how one writes English characters.