• Title/Summary/Keyword: generalized c-distance

Search Result 14, Processing Time 0.031 seconds

GENERALIZATIONS OF ALESANDROV PROBLEM AND MAZUR-ULAM THEOREM FOR TWO-ISOMETRIES AND TWO-EXPANSIVE MAPPINGS

  • Khodaei, Hamid;Mohammadi, Abdulqader
    • Communications of the Korean Mathematical Society
    • /
    • v.34 no.3
    • /
    • pp.771-782
    • /
    • 2019
  • We show that mappings preserving unit distance are close to two-isometries. We also prove that a mapping f is a linear isometry up to translation when f is a two-expansive surjective mapping preserving unit distance. Then we apply these results to consider two-isometries between normed spaces, strictly convex normed spaces and unital $C^*$-algebras. Finally, we propose some remarks and problems about generalized two-isometries on Banach spaces.

Empirical Comparisons of Disparity Measures for Three Dimensional Log-Linear Models

  • Park, Y.S.;Hong, C.S.;Jeong, D.B.
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.543-557
    • /
    • 2006
  • This paper is concerned with the applicability of the chi-square approximation to the six disparity statistics: the Pearson chi-square, the generalized likelihood ratio, the power divergence, the blended weight chi-square, the blended weight Hellinger distance, and the negative exponential disparity statistic. Three dimensional contingency tables of small and moderate sample sizes are generated to be fitted to all possible hierarchical log-linear models: the completely independent model, the conditionally independent model, the partial association models, and the model with one variable independent of the other two. For models with direct solutions of expected cell counts, point estimates and confidence intervals of the 90 and 95 percentage points of six statistics are explored. For model without direct solutions, the empirical significant levels and the empirical powers of six statistics to test the significance of the three factor interaction are computed and compared.

  • PDF

Minimum Disparity Estimation for Normal Models: Small Sample Efficiency

  • Cho M. J.;Hong C. S.;Jeong D. B.
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.1
    • /
    • pp.149-167
    • /
    • 2005
  • The minimum disparity estimators introduced by Lindsay and Basu (1994) are studied empirically. An extensive simulation in this paper provides a location estimate of the small sample and supplies empirical evidence of the estimator performance for the univariate contaminated normal model. Empirical results show that the minimum generalized negative exponential disparity estimator (MGNEDE) obtains high efficiency for small sample sizes and dominates the maximum likelihood estimator (MLE) and the minimum blended weight Hellinger distance estimator (MBWHDE) with respect to efficiency at the contaminated model.

PSO-optimized Pareto and Nash equilibrium gaming-based power allocation technique for multistatic radar network

  • Harikala, Thoka;Narayana, Ravinutala Satya
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.17-30
    • /
    • 2021
  • At present, multiple input multiple output radars offer accurate target detection and better target parameter estimation with higher resolution in high-speed wireless communication systems. This study focuses primarily on power allocation to improve the performance of radars owing to the sparsity of targets in the spatial velocity domain. First, the radars are clustered using the kernel fuzzy C-means algorithm. Next, cooperative and noncooperative clusters are extracted based on the distance measured using the kernel fuzzy C-means algorithm. The power is allocated to cooperative clusters using the Pareto optimality particle swarm optimization algorithm. In addition, the Nash equilibrium particle swarm optimization algorithm is used for allocating power in the noncooperative clusters. The process of allocating power to cooperative and noncooperative clusters reduces the overall transmission power of the radars. In the experimental section, the proposed method obtained the power consumption of 0.014 to 0.0119 at K = 2, M = 3 and K = 2, M = 3, which is better compared to the existing methodologies-generalized Nash game and cooperative and noncooperative game theory.

Implementation and Performance Analysis of a Speaker Verification System (화자 확인 시스템의 설계 제작 및 성능 분석)

  • 권석규;이병기
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.3
    • /
    • pp.1-9
    • /
    • 1993
  • This paper discusses issues on the disign and implementation of real-time automatic speaker verification system, as well as the performance analysis of the implemented system. The system employs TI's TMS320C25 digital signal processor TMS320C25 and high speed SRAMs. The system is designed to be used stand-alone as well as via hand-shaking with IBM-PC. The speech parameters used for speaker verification are PARCOR and LPC-cepstrum coefficients, and the employed decision logics are those based on the generalized weighted distance comcept. The implemented system showed the performance of 5.3% error rate for the PARCOR coefficient, and 4.7% error rate for the LPG-cepstrum coefficient.

  • PDF

Blind Equalization based on Maximum Cross-Correntropy Criterion using a Set of Randomly Generated Symbol (랜덤 심볼을 사용한 최대 코렌트로피 기준의 블라인드 등화)

  • Kim, Nam-Yong;Kang, Sung-Jin;Hong, Dae-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1C
    • /
    • pp.33-39
    • /
    • 2010
  • Correntropy is a generalized correlation function that contains higher order moments of the probability density function (PDF) than the conventional moment expansions. The criterion maximizing cross-correntropy (MCC) of two different random variables has yielded superior performance particularly in nonlinear, non-Gaussian signal processing comparing to mean squared error criterion. In this paper we propose a new blind equalization algorithm based on cross-correntropy criterion which uses, as two variables, equalizer output PDF and Parzen PDF estimate of a set of randomly generated symbols that complies with the transmitted symbol PDF. The performance of the proposed algorithm based on MCC is compared with the Euclidian distance minimization.

Adaptation Mode Controller for Adaptive Microphone Array System (마이크로폰 어레이를 위한 적응 모드 컨트롤러)

  • Jung Yang-Won;Kang Hong-Goo;Lee Chungyong;Hwang Youngsoo;Youn Dae Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11C
    • /
    • pp.1573-1580
    • /
    • 2004
  • In this paper, an adaptation mode controller for adaptive microphone array system is proposed for high-quality speech acquisition in real environments. To ensure proper adaptation of the adaptive array algorithm, the proposed adaptation mode controller uses not only temporal information, but also spatial information. The proposed adaptation mode controller is constructed with two processing stages: an initialization stage and a running stage. In the initialization stage, a sound source localization technique is adopted, and a signal correlation characteristic is used in the running stage. For the adaptive may algorithm, a generalized sidelobe canceller with an adaptive blocking matrix is used. The proposed adaptation mode controller can be used even when the adaptive blocking matrix is not adapted, and is much stable than the power ratio method. The proposed algorithm is evaluated in real environment, and simulation results show 13dB SINR improvement with the speaker sitting 2m distance from the may.

Clock Skew Optimization Using Link-Edge Insertion (연결-에지 추가 기법을 이용한 클락 스큐 최적화)

  • 정공옥;류광기신현철정정화
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.1009-1012
    • /
    • 1998
  • An efficient algorithm for clock skew optimization is proposed in this paper. It construct a new clock routing topology which is the generalized graph model while previous methods uses tree-structured routing topology. Edge-insertion technique is used in order to reduce the clock skew. A link-edge is inserted repeatedly between two sinks whose delay difference is large and the distance is small. As a result, the delay of a sink which has the longer delay is decreased and the clock skew is reduced. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the total wire length minimization under the given skew bound.

  • PDF

An Adaptive Control of Symmetry Contribution Based Generalized Symmetry Transform (적응적 대칭기여도 제어 기반 일반화 대칭변환)

  • Jeon, Joon-Hyung;Lee, Seung-Hee;Park, Kil-Houm
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.2
    • /
    • pp.208-217
    • /
    • 2014
  • This paper propose an adaptive control of symmetry contribution based generalized symmetry transform. which can be controlled symmetry contribution according to the intensity orientation of two pixels. In the proposed method, we define the C-D(convergent and divergent)plane which represents convergence and divergence region of gradient pairs. and used the gaussian phase wight function, with respect to the distance from the gradient pair to an extreme point, in calculating the symmetry contribution. The proposed method can be detect the object more efficiently by adaptive controlling the cut-off frequency of the gaussian phase wight function. To evaluate a performance of the proposed method, we compare the proposed method and conventional GST method in various images including IR image. we prove that the proposed method have better performance in object detection.