• 제목/요약/키워드: random vectors

검색결과 151건 처리시간 0.03초

IMAGE COMPRESSION USING VECTOR QUANTIZATION

  • Pantsaena, Nopprat;Sangworasil, M.;Nantajiwakornchai, C.;Phanprasit, T.
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -2
    • /
    • 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)

  • 이홍우
    • 한국공간구조학회논문집
    • /
    • 제8권3호
    • /
    • pp.75-82
    • /
    • 2008
  • 본 연구에서는 방향벡터(direction vector)를 이용한 지역 탐색법과 유전자 알고리즘을 결합한 새로운 알고리즘인 D-GA를 제안한다. 새로운 개체(individual)를 찾기 위한 방향벡터로는 진화과정 중에 습득되는 정보를 활용하기 위한 학습방향벡터(Loaming direction vector)와 진화와는 무관하게 한 개체의 주변을 탐색하는 랜덤방향벡터(random direction vector) 등 두 가지를 구성하였다. 그리고, 10 부재 트러스 설계 문제에 단순 유전자 알고리즘과 D-GA를 적용하여 최적화를 수행하였고, 그 결과를 비교 검토함으로써 단순 GA에 비하여 D-GA의 정확성 및 효율성이 향상되었음을 확인하였다.

  • PDF

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

  • Anh, Vu Thi Ngoc;Hien, Nguyen Thi Thanh
    • 대한수학회보
    • /
    • 제59권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
    • /
    • 제25권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
    • 호남수학학술지
    • /
    • 제27권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
    • 대한수학회논문집
    • /
    • 제12권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
    • 호남수학학술지
    • /
    • 제28권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)

  • 김동욱;김호준
    • 한국정보통신학회논문지
    • /
    • 제10권8호
    • /
    • pp.1373-1379
    • /
    • 2006
  • 움직임 객체의 추출은 비디오 서비스 등에서 주요한 연구목적 중의 하나이다. 본 논문은 블록 움직임 벡터를 이용하여 움직임 객체를 추출하는 새로운 기법을 제시한다. 이를 위하여, 1) 사후 확률 밀도와 Gibbs 랜덤필드의 이용하여 블록 움직임 벡터를 결정하고, 2) 2-D 히스토그램을 바탕으로 전역 움직임을 구하고, 3) 경계 블록 분할 단계를 통해 객체 추출을 달성한다. 제안된 알고리듬은 특히 압축된 비디오 신호의 움직임 객체에 특히 유용하게 이용될 수 있다. 제안된 알고리듬을 여러 가지 영상에 적용한 결과 양호한 결과를 얻을 수 있었다.

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

  • Singh, Mangal;Patra, Sarat Kumar
    • ETRI Journal
    • /
    • 제39권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.