• Title/Summary/Keyword: vector measures

Search Result 173, Processing Time 0.028 seconds

AUTO-CORRELATIONS AND BOUNDS ON THE NONLINEARITY OF VECTOR BOOLEAN FUNCTIONS

  • Kim, Wansoon;Park, Junseok
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.17 no.1
    • /
    • pp.47-56
    • /
    • 2004
  • The nonlinearity of a Boolean function f on $GF(2)^n$ is the minimum hamming distance between f and all affine functions on $GF(2)^n$ and it measures the ability of a cryptographic system using the functions to resist against being expressed as a set of linear equations. Finding out the exact value of the nonlinearity of given Boolean functions is not an easy problem therefore one wants to estimate the nonlinearity using extra information on given functions, or wants to find a lower bound or an upper bound on the nonlinearity. In this paper we extend the notion of auto-correlations of Boolean functions to vector Boolean functions and obtain upper bounds and a lower bound on the nonlinearity of vector Boolean functions in the context of their auto-correlations. Also we can describe avalanche characteristics of vector Boolean functions by examining the extended notion of auto-correlations.

  • PDF

SEQUENCES IN THE RANGE OF A VECTOR MEASURE

  • Song, Hi Ja
    • Korean Journal of Mathematics
    • /
    • v.15 no.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.

  • PDF

LOCAL INFLUENCE ON THE GOODNESS-OF-FIT TEST STATISTIC IN MAXIMUM LIKELIHOOD FACTOR ANALYSIS

  • Jung, Kang-Mo
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.2
    • /
    • pp.489-498
    • /
    • 1998
  • The influence of observations the on the goodness-of-fit test in maximum likelihood factor analysis is investigated by using the local influence method. under an appropriate perturbation the test statistic forms a surface. One of main diagnostics is the maximum slope of the perturbed surface the other is the direction vector cor-responding to the curvature. These influence measures provide the information about jointly influence measures provide the information about jointly influential observations as well as individ-ually influential observations.

Accuracy of Multiple Outlier Tests in Nonlinear Regression

  • Kahng, Myung-Wook
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.1
    • /
    • pp.131-136
    • /
    • 2011
  • The original Bates-Watts framework applies only to the complete parameter vector. Thus, guidelines developed in that framework can be misleading when the adequacy of the linear approximation is very different for different subsets. The subset curvature measures appear to be reliable indicators of the adequacy of linear approximation for an arbitrary subset of parameters in nonlinear models. Given the specific mean shift outlier model, the standard approaches to obtaining test statistics for outliers are discussed. The accuracy of outlier tests is investigated using subset curvatures.

Speaker Change Detection Based on a Graph-Partitioning Criterion

  • Seo, Jin-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.2
    • /
    • pp.80-85
    • /
    • 2011
  • Speaker change detection involves the identification of time indices of an audio stream, where the identity of the speaker changes. In this paper, we propose novel measures for the speaker change detection based on a graph-partitioning criterion over the pairwise distance matrix of feature-vector stream. Experiments on both synthetic and real-world data were performed and showed that the proposed approach yield promising results compared with the conventional statistical measures.

Real-Time Detection of Moving Objects from Shaking Camera Based on the Multiple Background Model and Temporal Median Background Model (다중 배경모델과 순시적 중앙값 배경모델을 이용한 불안정 상태 카메라로부터의 실시간 이동물체 검출)

  • Kim, Tae-Ho;Jo, Kang-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.3
    • /
    • pp.269-276
    • /
    • 2010
  • In this paper, we present the detection method of moving objects based on two background models. These background models support to understand multi layered environment belonged in images taken by shaking camera and each model is MBM(Multiple Background Model) and TMBM (Temporal Median Background Model). Because two background models are Pixel-based model, it must have noise by camera movement. Therefore correlation coefficient calculates the similarity between consecutive images and measures camera motion vector which indicates camera movement. For the calculation of correlation coefficient, we choose the selected region and searching area in the current and previous image respectively then we have a displacement vector by the correlation process. Every selected region must have its own displacement vector therefore the global maximum of a histogram of displacement vectors is the camera motion vector between consecutive images. The MBM classifies the intensity distribution of each pixel continuously related by camera motion vector to the multi clusters. However, MBM has weak sensitivity for temporal intensity variation thus we use TMBM to support the weakness of system. In the video-based experiment, we verify the presented algorithm needs around 49(ms) to generate two background models and detect moving objects.

Karhunen - Loeve Transform -Classified Vector Quantization for Efficient Image Coding (Karhunen-loeve 변환과 분류 벡터 양자화에 의한 효율적인 영상 부호화)

  • 김태용;최흥문
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.11
    • /
    • pp.44-52
    • /
    • 1996
  • This paper proposes a KLT-CVQ scheme using PCNN to improbe the quality of the reconstructed images at a given bit rate. By using the PCNN and classified vector quantization, we exploit the high energy compaction and compelte decorrelation capbilities of the KLT, and the pdf (probability density function) shape and space-filling advantages of the vQ to improve the performance of the proposed hybrid coding technique. In order to preserve the preceptual fetures such as the edge components in the reconstructed images, we classified the input image blocks according to the texture energy measures of the local statistics and vector-coded them adaptively, and thereby reduces the possible edge degradation in the reconstructed images. The results of the computer simulations show that the performance of the proposed KLT-CVQ is higher than that of the KLT-CSQ or the DCT-CVQ in the quality of the reconstructed images at a given bit rate.

  • PDF

Modified distance measures for PCA-based face recognition

  • Song Young-Jun;Kim Young-Gil;Kim Nam
    • International Journal of Contents
    • /
    • v.1 no.2
    • /
    • pp.1-4
    • /
    • 2005
  • In this paper, we compare 5 weighted distance measures between feature vectors with respect to the recognition performance of the principal component analysis(PCA)-based face recognition method, and propose modified weighted distance. The proposed method was modification of z, the weighted vector. The simulation was performed using the ORL face database, showed the best result for some weighted distances such as weighted manhattan, weighted angle-based, weighted modified manhattan, and weighted modified SSE. We also showed that using some various values of z(weighted values) we can achieve better recognition results that using the existing weighted value.

  • PDF

SVM-based Utterance Verification Using Various Confidence Measures (다양한 신뢰도 척도를 이용한 SVM 기반 발화검증 연구)

  • Kwon, Suk-Bong;Kim, Hoi-Rin;Kang, Jeom-Ja;Koo, Myong-Wan;Ryu, Chang-Sun
    • MALSORI
    • /
    • no.60
    • /
    • pp.165-180
    • /
    • 2006
  • In this paper, we present several confidence measures (CM) for speech recognition systems to evaluate the reliability of recognition results. We propose heuristic CMs such as mean log-likelihood score, N-best word log-likelihood ratio, likelihood sequence fluctuation and likelihood ratio testing(LRT)-based CMs using several types of anti-models. Furthermore, we propose new algorithms to add weighting terms on phone-level log-likelihood ratio to merge word-level log-likelihood ratios. These weighting terms are computed from the distance between acoustic models and knowledge-based phoneme classifications. LRT-based CMs show better performance than heuristic CMs excessively, and LRT-based CMs using phonetic information show that the relative reduction in equal error rate ranges between $8{\sim}13%$ compared to the baseline LRT-based CMs. We use the support vector machine to fuse several CMs and improve the performance of utterance verification. From our experiments, we know that selection of CMs with low correlation is more effective than CMs with high correlation.

  • PDF