• East Asian mathematical journal
• /
• 제24권2호
• /
• pp.201-212
• /
• 2008

We characterize operators between Banach spaces sending unconditionally weakly p-summable sequences into sequences that lie in the range of a vector measure of bounded variation. Further, we describe operators between Banach spaces taking unconditionally weakly p-summable sequences into sequences that lie in the range of a vector measure.

• Korean Journal of Mathematics
• /
• 제10권2호
• /
• pp.103-116
• /
• 2002

We characterize operators between Banach spaces sending compact sets into sets that lie in the range of a vector measure. Further, we describe operators between Banach spaces taking compact sets into sets that lie in the range of a vector measure of bounded variation.

• Korean Journal of Mathematics
• /
• 제15권1호
• /
• pp.13-26
• /
• 2007

We prove that every strong null sequence in a Banach space X lies inside the range of a vector measure of bounded variation if and only if the condition $\mathcal{N}_1(X,{\ell}_1)={\Pi}_1(X,{\ell}_1)$ holds. We also prove that for $1{\leq}p<{\infty}$ every strong ${\ell}_p$ sequence in a Banach space X lies inside the range of an X-valued measure of bounded variation if and only if the identity operator of the dual Banach space $X^*$ is ($p^{\prime}$,1)-summing, where $p^{\prime}$ is the conjugate exponent of $p$. Finally we prove that a Banach space X has the property that any sequence lying in the range of an X-valued measure actually lies in the range of a vector measure of bounded variation if and only if the condition ${\Pi}_1(X,{\ell}_1)={\Pi}_2(X,{\ell}_1)$ holds.

• 대한수학회보
• /
• 제48권4호
• /
• pp.779-789
• /
• 2011

In this paper we study the Banach space $L^1$(G) of real valued measurable functions which are integrable with respect to a vector measure G in the sense of D. R. Lewis. First, we investigate conditions for a scalarly integrable function f which guarantee $f{\in}L^1$(G). Next, we give a sufficient condition for a sequence to converge in $L^1$(G). Moreover, for two vector measures F and G with values in the same Banach space, when F can be written as the integral of a function $f{\in}L^1$(G), we show that certain properties of G are inherited to F; for instance, relative compactness or convexity of the range of vector measure. Finally, we give some examples of $L^1$(G) related to the approximation property.

• 대한수학회보
• /
• 제38권1호
• /
• pp.113-120
• /
• 2001

Using the notions of admissibility, local convexity and measure of noncompactness, we give new fixed point theorems for quasicompact or condensing multivalued mappings with domains that are not necessarily convex subsets of an arbitrary topological vector space.

• 대한수학회보
• /
• 제37권2호
• /
• pp.209-215
• /
• 2000

Let X be a locally convex space. A series of clearcut characterizations for the boundedness of vector measure $\mu{\;}:{\;}\sum\rightarrow{\;}X$ is obtained, e.g., ${\mu}$ is bounded if and only if ${\mu}(A_j){\;}\rightarrow{\;}0$ weakly for every disjoint $\{A_j\}{\;}\subseteq{\;}\sum$ and if and only if $\{\frac{1}{j^j}{\mu}(A_j)\}^{\infty}_{j=1}$ is bounded for every disjoint $\{A_j\}{\;}\subseteq{\;}\sum$.

• 한국지능시스템학회논문지
• /
• 제14권3호
• /
• pp.369-374
• /
• 2004

Convex한 클러스터간의 최적의 거리와 Fuzzy Convex Clustering(FCC) 방법에 의한 효과적인 클러스터 결합 알고리즘을 제시하였다. 또한 두 convex한 클러스터간의 거리 측정 방법의 문제점인 정확성과 수행속도 개선하기 위하여 Support Vector Machines(SVM) 을 이용한 빠르고 정확한 거리 측정 방법을 제시하였다. 따라서 데이터의 부적절한 표현 없이 클러스터들의 개수를 크게 더 줄일 수 있었다. 본 논문에서는 제시한 알고리즘의 타당성을 위하여 여러 데이터에 대한 실험결과를 보여주므로서 제시한 알고리즘을 실제 영상 분할에 적용하여 다른 클러스터링 방법의 결과와 비교분석한다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• pp.772-775
• /
• 2006

Muilti-dimensional feature vector matching algorithm uses multiple features such as intensity, gradient, variance, first or second derivative of a pixel to find correspondence pixels in stereo images. In this paper, we proposed a new method for adjusting automatically the weight of feature in multi-dimensional feature vector matching considering sharpeness of a pixel in feature vector distance curve. The sharpeness consists of minimum and maximum vector distances of a small window mask. In the experiment we used IKONOS satellite stereo imagery and obtained accurate matching results comparable to the manual weight-adjusting method.

• The Journal of the Acoustical Society of Korea
• /
• 제26권2E호
• /
• pp.39-43
• /
• 2007

Music summarization refers to a technique which automatically extracts the most important and representative segments in music content. In this paper, we propose and evaluate a technique which provides the repeated part in music content as music summary. For extracting a repeated segment in music content, the proposed algorithm uses the weighted sum of similarity measures based on multi-level vector quantization for fixed-length summary or optimal-length summary. For similarity measures, count-based similarity measure and distance-based similarity measure are proposed. The number of the same codeword and the Mahalanobis distance of features which have same codeword at the same position in segments are used for count-based and distance-based similarity measure, respectively. Fixed-length music summary is evaluated by measuring the overlapping ratio between hand-made repeated parts and automatically generated ones. Optimal-length music summary is evaluated by calculating how much automatically generated music summary includes repeated parts of the music content. From experiments we observed that optimal-length summary could capture the repeated parts in music content more effectively in terms of summary length than fixed-length summary.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.54-57
• /
• 2000

In vector quantization (VQ), mean squared difference (MSD) is a widely used distance measure between vectors. But the distance between the means of each vector elements appears as a dominant quantity in MSD. In the case of image vectors, the coincidence of edge patterns is also important when the human visual system (HVS) is considered. Therefore, we propose a new distance measure that uses the variance of differences to encode vectors and to design codebooks. It can choose more proper codewords to reduce edge degradations and make a useful codebook, which has lots of various edge codewords in place of redundant shades.