• Title/Summary/Keyword: iterative mean algorithm

Search Result 77, Processing Time 0.028 seconds

Weighted Carlson Mean of Positive Definite Matrices

  • Lee, Hosoo
    • Kyungpook Mathematical Journal
    • /
    • v.53 no.3
    • /
    • pp.479-495
    • /
    • 2013
  • Taking the weighted geometric mean [11] on the cone of positive definite matrix, we propose an iterative mean algorithm involving weighted arithmetic and geometric means of $n$-positive definite matrices which is a weighted version of Carlson mean presented by Lee and Lim [13]. We show that each sequence of the weigthed Carlson iterative mean algorithm has a common limit and the common limit of satisfies weighted multidimensional versions of all properties like permutation symmetry, concavity, monotonicity, homogeneity, congruence invariancy, duality, mean inequalities.

An Iterative Normalization Algorithm for cDNA Microarray Medical Data Analysis

  • Kim, Yoonhee;Park, Woong-Yang;Kim, Ho
    • Genomics & Informatics
    • /
    • v.2 no.2
    • /
    • pp.92-98
    • /
    • 2004
  • A cDNA microarray experiment is one of the most useful high-throughput experiments in medical informatics for monitoring gene expression levels. Statistical analysis with a cDNA microarray medical data requires a normalization procedure to reduce the systematic errors that are impossible to control by the experimental conditions. Despite the variety of normalization methods, this. paper suggests a more general and synthetic normalization algorithm with a control gene set based on previous studies of normalization. Iterative normalization method was used to select and include a new control gene set among the whole genes iteratively at every step of the normalization calculation initiated with the housekeeping genes. The objective of this iterative normalization was to maintain the pattern of the original data and to keep the gene expression levels stable. Spatial plots, M&A (ratio and average values of the intensity) plots and box plots showed a convergence to zero of the mean across all genes graphically after applying our iterative normalization. The practicability of the algorithm was demonstrated by applying our method to the data for the human photo aging study.

The Lambert W Function in the Design of Minimum Mean Square-Error Quantizers for a Laplacian Source (램버트 W 함수를 사용한 라플라스 신호의 최소 평균제곱오차 양자화)

  • 송현정;나상신
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.333-336
    • /
    • 2001
  • This paper reports that the Lambert W function applies to a non-iterative design of minimum mean square-error scalar quantizers for a Laplacian source. The contribution of the paper is in the reduction of the time needed for the design and the increased accuracy in resulting quantization points and thresholds, because the algorithm is non-iterative and the Lambert W function can be evaluated as accurately as desired.

  • PDF

The Lambert W Function in the Design of Minimum Mean Square-Error Quantizers for a Laplacian Source (램버트 W 함수를 사용한 라플라스 신호의 최소 평균제곱오차 양자화)

  • 송현정;나상신
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6A
    • /
    • pp.524-532
    • /
    • 2002
  • This paper reports that the Lambert W function applies to a non-iterative design of minimum mean square-error scalar quantizers for a Laplacian source. Specifically, it considers a non-iterative design algorithm for optimum quantizers for a Laplacian source; it finds that the solution of the recursive nonlinear equation in the non-iterative design is elegantly expressed in term of the principal branch of the Lambert W function in a closed form; and it proves that the non-iterative algorithm applies only to exponential or Laplacian sources. The contribution of the paper is in the reduction of the time needed for the design and the increased accuracy in resulting quantization points and thresholds, because the algorithm is non-iterative and the Lambert W function can be evaluated as accurately as desired. Also, numerical results show how optimal quantization distortion converges monotonically to the Panter-Dite constant and help derive an approximation formula for the key parameters of optimum quantizers.

Replication of Automotive Vibration Target Signal Using Iterative Learning Control and Stewart Platform with Halbach Magnet Array (반복학습제어와 할바흐 자석 배열 스튜어트 플랫폼을 이용한 차량 진동 신호 재현)

  • Ko, Byeongsik;Kang, SooYoung
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.23 no.5
    • /
    • pp.438-444
    • /
    • 2013
  • This paper presents the replication of a desired vibration response by iterative learning control (ILC) system for a vibration motion replication actuator. The vibration motion replication actuator has parameter uncertainties including system nonlinearity and joint nonlinearity. Vehicle manufacturers worldwide are increasingly relying on road simulation facilities that put simulated loads and stresses on vehicles and subassemblies in order to reduce development time. Road simulation algorithm is the key point of developing road simulation system. With the rapid progress of digital signal processing technology, more complex control algorithms including iterative learning control can be utilized. In this paper, ILC algorithm was utilized to produce simultaneously the six channels of desired responses using the Stewart platform composed of six linear electro-magnetic actuators with Halbach magnet array. The convergence rate and accuracy showed reasonable results to meet the requirement. It shows that the algorithm is acceptable to replicate multi-channel vibration responses.

Iterative Adaptive Hybrid Image Restoration for Fast Convergence (하이브리드 고속 영상 복원 방식)

  • Ko, Kyel;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9C
    • /
    • pp.743-747
    • /
    • 2010
  • This paper presents an iterative adaptive hybrid image restoration algorithm for fast convergence. The local variance, mean, and maximum value are used to constrain the solution space. These parameters are computed at each iteration step using partially restored image at each iteration, and they are used to impose the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed and better performance than typical regularized constrained least squares (RCLS) approach.

MEAN ORBITAL ELEMENTS FOR GEOSYNCHRONOUS ORBIT -II -Orbital inclination, longitude of ascending node, mean longitude- (정지위성 궤도의 평균 궤도 요소 - II -궤도 경사각, 승교점 경도, 위성 경도-)

  • 최규홍;박종옥;문인상;배성구
    • Journal of Astronomy and Space Sciences
    • /
    • v.7 no.1
    • /
    • pp.11-21
    • /
    • 1990
  • The osculating orbital elements include the mean, secular, long period, and short period terms. The iterative algorithm used for conversion of osculating orbital elements to mean orbital elements is described. The mean orbital elements of $W_c,\;W_s$, and L are obtained.

  • PDF

A Low-Complexity CLSIC-LMMSE-Based Multi-User Detection Algorithm for Coded MIMO Systems with High Order Modulation

  • Xu, Jin;Zhang, Kai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1954-1971
    • /
    • 2017
  • In this work, first, a multiuser detection (MUD) algorithm based on component-level soft interference cancellation and linear minimum mean square error (CLSIC-LMMSE) is proposed, which can enhance the bit error ratio (BER) performance of the traditional SIC-LMMSE-based MUD by mitigating error propagation. Second, for non-binary low density parity check (NB-LDPC) coded high-order modulation systems, when the proposed algorithm is integrated with partial mapping, the receiver with iterative detection and decoding (IDD) achieves not only better BER performance but also significantly computational complexity reduction over the traditional SIC-LMMSE-based IDD scheme. Extrinsic information transfer chart (EXIT) analysis and numerical simulations are both used to support the conclusions.

Iterative Phase estimation based on Turbo code (터보부호를 이용한 반복 위상 추정기법)

  • Ryu, Joong-Gon;Heo, Jun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.12 s.354
    • /
    • pp.1-8
    • /
    • 2006
  • In this paper, we propose carrier phase synchronization algorithm which are base on turbo coded system for DVB-RCS. There have been two categories of phase estimator, single estimator outside turbo code decoder and multiple estimators inside turbo code decoder. In single estimator, we use the estimation algorithm that ML(Maximum Likelihood) and LMS(Least Mean Square), also three different soft decision methods are proposed. Multiple estimator apply PSP(Per Survivor Processing) algorithm additionally. We compared performance between single estimator and Multiple estimator in AWGN channel. We presented the two methods of PSP algorithm for performance elevation. First is the Bi-directional channel estimation and second is binding method.

Object Tracking with Radical Change of Color Distribution Using EM algorithm

  • Whoang In-Teck;Choi Kwang-Nam
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06b
    • /
    • pp.388-390
    • /
    • 2006
  • This paper presents an object tracking with radical change of color. Conventional Mean Shift do not provide appropriate result when major color distribution disappear. Our tracking approach is based on Mean Shift as basic tracking method. However we propose tracking algorithm that shows good results for an object of radical variation. The key idea is iterative update previous color information of an object that shows different color by using EM algorithm. As experiment results, we show that our proposed algorithm is an effective approach in tracking for a real object include an object having radical change of color.

  • PDF