• Title/Summary/Keyword: random vectors

Search Result 150, Processing Time 0.023 seconds

IMAGE COMPRESSION USING VECTOR QUANTIZATION

  • Pantsaena, Nopprat;Sangworasil, M.;Nantajiwakornchai, C.;Phanprasit, T.
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.979-982
    • /
    • 2002
  • Compressing image data by using Vector Quantization (VQ)[1]-[3]will compare Training Vectors with Codebook. The result is an index of position with minimum distortion. The implementing Random Codebook will reduce the image quality. This research presents the Splitting solution [4],[5]to implement the Codebook, which improves the image quality[6]by the average Training Vectors, then splits the average result to Codebook that has minimum distortion. The result from this presentation will give the better quality of the image than using Random Codebook.

  • PDF

Direction Vector for Efficient Structural Optimization with Genetic Algorithm (효율적 구조최적화를 위한 유전자 알고리즘의 방향벡터)

  • Lee, Hong-Woo
    • Journal of Korean Association for Spatial Structures
    • /
    • v.8 no.3
    • /
    • pp.75-82
    • /
    • 2008
  • In this study, the modified genetic algorithm, D-GA, is proposed. D-GA is a hybrid genetic algorithm combined a simple genetic algorithm and the local search algorithm using direction vectors. Also, two types of direction vectors, learning direction vector and random direction vector, are defined without the sensitivity analysis. The accuracy of D-GA is compared with that of simple genetic algorithm. It is demonstrated that the proposed approach can be an effective optimization technique through a minimum weight structural optimization of ten bar truss.

  • PDF

ON COMPLETE CONVERGENCE FOR WEIGHTED SUMS OF COORDINATEWISE NEGATIVELY ASSOCIATED RANDOM VECTORS IN HILBERT SPACES

  • Anh, Vu Thi Ngoc;Hien, Nguyen Thi Thanh
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.4
    • /
    • pp.879-895
    • /
    • 2022
  • This paper establishes the Baum-Katz type theorem and the Marcinkiewicz-Zymund type strong law of large numbers for sequences of coordinatewise negatively associated and identically distributed random vectors {X, Xn, n ≥ 1} taking values in a Hilbert space H with general normalizing constants $b_n=n^{\alpha}{\tilde{L}}(n^{\alpha})$, where ${\tilde{L}}({\cdot})$ is the de Bruijn conjugate of a slowly varying function L(·). The main result extends and unifies many results in the literature. The sharpness of the result is illustrated by two examples.

Independence and maximal volume of d-dimensional random convex hull

  • Son, Won;Park, Seongoh;Lim, Johan
    • Communications for Statistical Applications and Methods
    • /
    • v.25 no.1
    • /
    • pp.79-89
    • /
    • 2018
  • In this paper, we study the maximal property of the volume of the convex hull of d-dimensional independent random vectors. We show that the volume of the random convex hull from a multivariate location-scale family indexed by ${\Sigma}$ is stochastically maximized in simple stochastic order when ${\Sigma}$ is diagonal. The claim can be applied to a broad class of multivariate distributions that include skewed/unskewed multivariate t-distributions. We numerically investigate the proven stochastic relationship between the dependent and independent random convex hulls with the Gaussian random convex hull. The numerical results confirm our theoretical findings and the maximal property of the volume of the independent random convex hull.

A FUNCTIONAL CENTRAL LIMIT THEOREM FOR MULTIVARIATE LINEAR PROCESS WITH POSITIVELY DEPENDENT RANDOM VECTORS

  • KO, MI-HWA;KIM, TAE-SUNG;KIM, HYUN-CHULL
    • Honam Mathematical Journal
    • /
    • v.27 no.2
    • /
    • pp.301-315
    • /
    • 2005
  • Let $\{A_u,\;u=0,\;1,\;2,\;{\cdots}\}$ be a sequence of coefficient matrices such that ${\sum}_{u=0}^{\infty}{\parallel}A_u{\parallel}<{\infty}$ and ${\sum}_{u=0}^{\infty}\;A_u{\neq}O_{m{\times}m}$, where for any $m{\times}m(m{\geq}1)$, matrix $A=(a_{ij})$, ${\parallel}A{\parallel}={\sum}_{i=1}^m{\sum}_{j=1}^m{\mid}a_{ij}{\mid}$ and $O_{m{\times}m}$ denotes the $m{\times}m$ zero matrix. In this paper, a functional central limit theorem is derived for a stationary m-dimensional linear process ${\mathbb{X}}_t$ of the form ${\mathbb{X}_t}={\sum}_{u=0}^{\infty}A_u{\mathbb{Z}_{t-u}}$, where $\{\mathbb{Z}_t,\;t=0,\;{\pm}1,\;{\pm}2,\;{\cdots}\}$ is a stationary sequence of linearly positive quadrant dependent m-dimensional random vectors with $E({\mathbb{Z}_t})={{\mathbb{O}}$ and $E{\parallel}{\mathbb{Z}_t}{\parallel}^2<{\infty}$.

  • PDF

A WEAKLY DEPENDENCE CONCEPT IN MOVING AVERAGE MODELS

  • Baek, Jong-Il;Lim, Ho-Un;Youn, Eun-Ho
    • Communications of the Korean Mathematical Society
    • /
    • v.12 no.3
    • /
    • pp.743-754
    • /
    • 1997
  • We introduce a class of finite and infinite moving average (MA) sequences of multivariate random vectors exponential marginals. The theory of dependence is used to show that in various cases the class of MA sequences consists of associated random variables. We utilize positive dependence properties to obtain some probability bounds for the multivariate processes.

  • PDF

THE ORDERING OF CONDITIONALLY WEAK POSITIVE QUADRANT DEPENDENCE

  • BARK, JONG-IL;LEE, SEUNG-WOO;KIM, SO-YOUN;LEE, GIL-HWAN
    • Honam Mathematical Journal
    • /
    • v.28 no.2
    • /
    • pp.279-290
    • /
    • 2006
  • In this paper, we introduced a new notion of conditionally weakly positive quadrant dependence(CWPQD) between two random variables and the partial ordering of CWPQD is developed to compare pairs of CWPQD random vectors. Some properties and closure under certain statistical operations are derived.

  • PDF

Moving Object Extraction Based on Block Motion Vectors (블록 움직임벡터 기반의 움직임 객체 추출)

  • Kim Dong-Wook;Kim Ho-Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1373-1379
    • /
    • 2006
  • Moving object extraction is one of key research topics for various video services. In this study, a new moving object extraction algorithm is introduced to extract objects using block motion vectors in video data. To do this, 1) a maximum a posteriori probability and Gibbs random field are used to obtain real block motion vectors,2) a 2-D histogram technique is used to determine a global motion, 3) additionally, a block segmentation is fellowed. In the computer simulation results, the proposed technique shows a good performance.

Partial Transmit Sequence Optimization Using Improved Harmony Search Algorithm for PAPR Reduction in OFDM

  • Singh, Mangal;Patra, Sarat Kumar
    • ETRI Journal
    • /
    • v.39 no.6
    • /
    • pp.782-793
    • /
    • 2017
  • This paper considers the use of the Partial Transmit Sequence (PTS) technique to reduce the Peak-to-Average Power Ratio (PAPR) of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS) is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search-based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms.