• Title/Summary/Keyword: Discrete information

Search Result 1,922, Processing Time 0.025 seconds

The Three Directional Separable Processing Method for Double-Density Wavelet Transformation Improvement (이중 밀도 웨이브렛 변환의 성능 향상을 위한 3방향 분리 처리 기법)

  • Shin, Jong Hong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.2
    • /
    • pp.131-143
    • /
    • 2012
  • This paper introduces the double-density discrete wavelet transform using 3 direction separable processing method, which is a discrete wavelet transform that combines the double-density discrete wavelet transform and quincunx sampling method, each of which has its own characteristics and advantages. The double-density discrete wavelet transform is nearly shift-invariant. But there is room for improvement because not all of the wavelets are directional. That is, although the double-density DWT utilizes more wavelets, some lack a dominant spatial orientation, which prevents them from being able to isolate those directions. The dual-tree discrete wavelet transform has a more computationally efficient approach to shift invariance. Also, the dual-tree discrete wavelet transform gives much better directional selectivity when filtering multidimensional signals. But this transformation has more cost complexity Because it needs eight digital filters. Therefor, we need to hybrid transform which has the more directional selection and the lower cost complexity. A solution to this problem is a the double-density discrete wavelet transform using 3 direction separable processing method. The proposed wavelet transformation services good performance in image and video processing fields.

Digital Image Processing Using Non-separable High Density Discrete Wavelet Transformation (비분리 고밀도 이산 웨이브렛 변환을 이용한 디지털 영상처리)

  • Shin, Jong Hong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.1
    • /
    • pp.165-176
    • /
    • 2013
  • This paper introduces the high density discrete wavelet transform using quincunx sampling, which is a discrete wavelet transformation that combines the high density discrete transformation and non-separable processing method, each of which has its own characteristics and advantages. The high density discrete wavelet transformation is one that expands an N point signal to M transform coefficients with M > N. The high density discrete wavelet transformation is a new set of dyadic wavelet transformation with two generators. The construction provides a higher sampling in both time and frequency. This new transform is approximately shift-invariant and has intermediate scales. In two dimensions, this transform outperforms the standard discrete wavelet transformation in terms of shift-invariant. Although the transformation utilizes more wavelets, sampling rates are high costs and some lack a dominant spatial orientation, which prevents them from being able to isolate those directions. A solution to this problem is a non separable method. The quincunx lattice is a non-separable sampling method in image processing. It treats the different directions more homogeneously than the separable two dimensional schemes. Proposed wavelet transformation can generate sub-images of multiple degrees rotated versions. Therefore, This method services good performance in image processing fields.

Age of Information for Discrete Time Queueing Model (이산 시각 대기 행렬 모형의 정보 신선도)

  • Yutae, Lee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.27 no.1
    • /
    • pp.131-134
    • /
    • 2023
  • The age of information (AoI) was proposed to quantify the freshness of information about the status of a remote source system, which is defined as the amount of time that has elapsed since a packet was created at its source. This paper analyzes the age of information of a discrete time Geo/D/1/1 status update system. For this purpose, the system is modeled as a discrete-time two-state Markov chain. The stationary probability distributions for peak AoI and AoI are obtained. The average peak AoI, the average AoI, and the freshness ratio of information are also derived. Some numerical results of the analysis are presented.

Toward the Application of a Critical-Chain-Project-Management-based Framework on Max-plus Linear Systems

  • Takahashi, Hirotaka;Goto, Hiroyuki;Kasahara, Munenori
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.3
    • /
    • pp.155-161
    • /
    • 2009
  • We focus on discrete event systems with a structure of parallel processing, synchronization, and no-concurrency. We use max-plus algebra, which is an effective approach for controller design for this type of system, for modeling and formulation. Since a typical feature of this type of system is that the initial schedule is frequently changed due to unpredictable disturbances, we use a simple model and numerical examples to examine the possibility of applying the concepts of the feeding buffer and the project buffer of critical chain project management (CCPM) on max-plus linear discrete event systems in order to control the occurrence of an undesirable state change. The application of a CCPM-based framework on a max-plus linear discrete event system was proven to be effective.

An Implementation of Discrete Mathematical Model for ECG waveform

  • Yimman, Surapun;Deeudom, Mongkon;Ittisariyanon, Jirawat;Junnapiya, Somyot;Dejhan, Kobchai
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.852-856
    • /
    • 2005
  • This paper proposes a new design of the ECG simulator with high resolution by using small amount of memories based on discrete least square estimation equations instead of reading the stored data inside the look-up table. The experimental results have shown that the ECG simulator using discrete least square estimation equations can display the bipolar limb leads ECG signals with low PRD (percent root-mean-square difference) while taking the less amount of memories than the previous method which used the look-up table to store ECG data for ECG simulation.

  • PDF

Discrete bacterial foraging optimization for resource allocation in macrocell-femtocell networks

  • Lalin, Heng;Mustika, I Wayan;Setiawan, Noor Akhmad
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.726-735
    • /
    • 2018
  • Femtocells are good examples of the ultimate networking technology, offering enhanced indoor coverage and higher data rate. However, the dense deployment of femto base stations (FBSs) and the exploitation of subcarrier reuse between macrocell base stations and FBSs result in significant co-tier and cross-tier interference, thus degrading system performance. Therefore, appropriate resource allocations are required to mitigate the interference. This paper proposes a discrete bacterial foraging optimization (DBFO) algorithm to find the optimal resource allocation in two-tier networks. The simulation results showed that DBFO outperforms the random-resource allocation and discrete particle swarm optimization (DPSO) considering the small number of steps taken by particles and bacteria.

Derivations of moments for discrete probability distributions using backward difference operators (후진 미분 연산자를 이용한 이산확률분포의 적률 유도)

  • Cho, Kil-Ho
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.3
    • /
    • pp.505-513
    • /
    • 2011
  • In this paper, we obtain the derivations of moments of discrete probability distributions by using the backward difference operators. Also, we presents such derivations for several well-known distributions; they are the binomial, Poisson, geometric, hypergeometric and negative hypergeometric distributions.

TERNARY UNIVARIATE CURVATURE-PRESERVING SUBDIVISION

  • JEON MYUNGJIN;HAN DONGSOONG;PARK KYEONGSU;CHOI GUNDON
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.235-246
    • /
    • 2005
  • We present an interpolating, univariate subdivision scheme which preserves the discrete curvature and tangent direction at each step of subdivision. Since the polygon have a geometric information of some original(in some sense) curve as a discrete curvature, we can expect that the limit curve has the same curvature at each vertex as the control polygon. We estimate the curvature bound of odd vertices and give an error estimate for restoring a curve from sampled vertices on curves.

Generalized singular perturbation approximation preserving positive real property of discrete system (이산시스템의 positive real 특성을 유지하는 일반화된 특이 섭동 근사화)

  • 오도창;김재권;방경호;박홍배
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.9
    • /
    • pp.50-59
    • /
    • 1997
  • This paper is on the generalized singular perturbation approximation (GSPA) preserving the discrete positive real property. We transform the discrete positive real(PR) system into a stochastically banlanced system and get the reduced order discrete system from the GSPA of the full order stochastically balanced system. eSPECIALLY, WHEN THE FREE PARAMETER OF THE gspa IS .+-.1, we show that the reduced order discrete system retains stability, minimality, and positive real and stochstically balancing properties. And we derived the .inf.-norm error bound with the reduced order discrete strictly positive real(SPR) system by the proposed method. Finally, we give an example to ascertain the properties of the proposed reduced order discrete system and to compare with the conventional methods.

  • PDF