• 제목/요약/키워드: truncation point

검색결과 41건 처리시간 0.024초

이동기준점을 이용한 AMBTC 알고리즘 개발 (Development of Absolute Moment Block Truncation Coding Algorithm using Flexible Base Point(Mean of Block))

  • 최용수
    • 정보통신설비학회논문지
    • /
    • 제10권2호
    • /
    • pp.80-85
    • /
    • 2011
  • In this paper, I propose flexible base point used for a BTC(Block Truncation Coding). Halftoning images are used for printer by reducing the number of pixel depth. During over 20 years, many researches have been studied to apply this techniques to image compression. BTC algorithms are the compression methods using digital halftoning technique about images. In the BTC algorithm, an image block is divided into higher and lower domain compared with the mean of block. then the MAX and MIN representative values are evaluated by calculating the mean of higher and lower domain respectively. At a result, an image block(for example 88 size) is compressed into 64bits pixel representation and 16 bits of the MAX and MIN. And they also have been tried to sustain the image quality high after compression. In this paper, I found that there is some marginal possibility to enhance the image quality by adjusting the base point(generally mean of block) of existing algorithms.

  • PDF

FACTORS AFFECTING AGE STRUCTURES AND GENETIC RESPONSES TO TRUNCATION SELECTION SCHEMES IN A POPULATION WITH OVERLAPPING GENERATIONS

  • Ghaffar, A.;Shimizu, H.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • 제6권4호
    • /
    • pp.497-507
    • /
    • 1993
  • Four truncation selection schemes (SSs) were framed to predict and compare the age structures and genetic responses under the influence of various factor employing the scheme-specific algorithms. Two paths of selection, sires (bulls' sires) and dams (bulls' dams) to breed young bulls were considered. Among variable factors, four levels (0.3, 0.5, 0.7, 0.9) of precision of evaluation, five levels (0.0, 0.05, 0.10, 0.15, 0.20 genetic standard deviation) of genetic differences among age classes and 4 levels of proportions selected (for bulls' sire, 0.05, 0.10, 0.125, 0.25, and for bulls' dams 0.02, 0.04, 0.05, and 0.10) contemplated on both paths of selection. The number of age classes for bulls' dams and bulls' sires were 4 or 8 and 2 or 4, respectively. The stayability across age classes for bulls' dams was assumed to be 0.80 or 0.60. The candidates for selection for bulls' sires were equally distributed (0.5 or 0.25) across the age classes. The SS1 (selection on same proportions as candidates' distribution) revealed longest generation lengths and lowest yearly genetic responses. The average ages were youngest and yearly genetic responses were highest in SS4 (selection at each age-specific truncation point with the same average genetic superiority of selected parents across the ages) and followed by SS3 (selection at each agespecific truncation point with same predicted genetic values) and SS2 (selection at common truncation point on phenotypic values) in a population with overlapping generations. The results revealed the importance of choosing suitable selection scheme to acquire maximum yearly genetic responses especially when the genetic differences among age classes are large and the precision of evaluation is relatively low.

안정상태 시뮬레이션 출력 데이터의 온라인 제거 시점 결정 방법 (Methods for On-Line Determination of Truncation Point in Steady-State Simulation Outputs)

  • 이영해
    • 한국시뮬레이션학회논문지
    • /
    • 제7권1호
    • /
    • pp.27-37
    • /
    • 1998
  • Simulation output is generally stochastic and autocorrelated, and includes the initial condition bias. To exclude the bias, the determination of truncation point has been one of important issues for the steady-state simulation output analysis. In this paper, two methods are presented for detection of truncation point in order to estimate efficiently the steady-state measure of simulation output. They are based on the Euclidean distance equation, and the backpropagation algorithm in Neural Networks. The experimental results obtained by M/M/1 and M/M/2 show that the proposed methods are very promising with respect to coverage and relative bias. The methods could be used for the on-line analysis of simulation outputs.

  • PDF

선자름 방법을 이용한 JPEG2000에서의 부호차 시간 단축 알고리즘 (Compression-time Shortening Algorithm on JPEG2000 using Pre-Truncation Method)

  • 양낙민;정재호
    • 한국통신학회논문지
    • /
    • 제28권1C호
    • /
    • pp.64-71
    • /
    • 2003
  • 본 논문에서는 정지 영상의 압축 방식인 JPEG2000에서 영상의 질을 일정하게 유지하면서 부호화 시간을 단축시키는 알고리즘을 제안하였다. 전체 이미지의 주파수 분포를 추정하여 출력 비트스트림을 위한 최적의 자름점(Truncation Point)을 찾아 선택된 비트플레인만 부호화하는 방법이다. 다해상도의 특징을 갖는 웨이블렛은 각각의 해상도마다 수직, 수평 및 대각선 주파수 성분을 얻을 수 있다. 이 주파수 상관관계는 전체 레벨에서 유지되며 입력영상에 따라 고유한 주파수 특징을 나타낸다. 따라서, 최상위 레벨의 주파수 관계로 각각의 코드블럭에서 부호화할 비트를 예측하여 적절한 자름점을 선택할 수 있어 부호화 시간을 단축시켰다. 또한 명도 성분보다는 에너지가 작은 컬러 성분에서 부호화 되지 않는 하위 레벨은 단순한 다운 샘플링만으로 저주파 통과 필터를 대신함으로써 부호화 시간을 줄이는 성과를 보였다. 이러한 제안된 알고리즘으로 부호화 시간을 약 15~36% 줄였으며 PSNR을 30$\pm$0.5㏈로 유지하였다.

자유표면문제해석(자유표면문제해석)을 위한 Rankine용출점(湧出點) 분포법(分布法) -방사조건(放射條件)과 유한분포(有限分布)의 영향- (On the Method of Rankine Source Distribution for Free Surface Flow Problem: Radiation Condition and Influence of Finite Distribution)

  • 이창섭;양승일;강창구
    • 대한조선학회지
    • /
    • 제19권2호
    • /
    • pp.13-18
    • /
    • 1982
  • The method of Rankine source distribution is emerging as a powerful yet simple alternative for the solution of complicated free surface problems. But it has been uncertain whether the radiation condition could be satisfied exactly by distributing the simple sources on the free surface only. In this paper, it is proved rigorously that the Rankine sources, whose intensities are varying sinusoidally along the axis satisfying the free surface boundary condition, generate the radiation waves both in the infinite and finite-depth flows. A formula is derived to give the upper and lower bounds of the errors in the induced velocity computation that will be introduced by truncating the extent of source distribution on the free surface. Since the truncation is inevitable in the numerical analysis, this formula may be used as a criterion to limit the position of the field points, where velocity computation is made, away from the truncation boundary. A typical analysis shows that the maximum error will be 3.4 percent of the exact induced velocity when the field point is on the free surface two wave lengths away from the truncation boundary.

  • PDF

Simulation of Voltage and Current Distributions in Transmission Lines Using State Variables and Exponential Approximation

  • Dan-Klang, Panuwat;Leelarasmee, Ekachai
    • ETRI Journal
    • /
    • 제31권1호
    • /
    • pp.42-50
    • /
    • 2009
  • A new method for simulating voltage and current distributions in transmission lines is described. It gives the time domain solution of the terminal voltage and current as well as their line distributions. This is achieved by treating voltage and current distributions as distributed state variables (DSVs) and turning the transmission line equation into an ordinary differential equation. Thus the transmission line is treated like other lumped dynamic components, such as capacitors. Using backward differentiation formulae for time discretization, the DSV transmission line component is converted to a simple time domain companion model, from which its local truncation error can be derived. As the voltage and current distributions get more complicated with time, a new piecewise exponential with controllable accuracy is invented. A segmentation algorithm is also devised so that the line is dynamically bisected to guarantee that the total piecewise exponential error is a small fraction of the local truncation error. Using this approach, the user can see the line voltage and current at any point and time freely without explicitly segmenting the line before starting the simulation.

  • PDF

고정 소수점 연산에 의한 고속 DCT 알고리듬의 오차해석 (A Fixed-Point Error Analysis of fast DCT Algorithms)

  • 연일동;이상욱
    • 대한전기학회논문지
    • /
    • 제40권4호
    • /
    • pp.331-341
    • /
    • 1991
  • The discrete cosine transform (DCT) is widely used in many signal processing areas, including image and speech data compression. In this paper, we investigate a fixed-point error analysis for fast DCT algorithms, namely, Lee [6], Hou [7] and Vetterli [8]. A statistical model for fixed-point error is analyzed to predict the output noise due to the fixed-point implementation. This paper deals with two's complement fixed-point data representation with truncation and rounding. For a comparison purpose, we also investigate the direct form DCT algorithm. We also propose a suitable scaling model for the fixed-point implementation to avoid an overflow occurring in the addition operation. Computer simulation results reveal that there is a close agreement between the theoretical and the experimental results. The result shows that Vetterli's algorithm is better than the other algorithms in terms of SNR.

  • PDF

카오스 이론의 Lyapunov 지수를 응용한 안정상태 시뮬레이션의 출력분석 (Output Analysis for Steady-State Simulation Using Lyapunov Exponent in Chaos Theory)

  • 이영해;오형술
    • 대한산업공학회지
    • /
    • 제22권1호
    • /
    • pp.65-82
    • /
    • 1996
  • This paper proposes a sequential procedure which can be used to determine a truncation point and run length to reduce or remove bias owing to artificial startup conditions in simulations aimed at estimating steady-state behavior. It is based on the idea of Lyapunov exponent in chaos theory. The performance measures considered are relative bias, coverage, estimated relative half-width of the confidence interval, and mean amount of deleted data.

  • PDF

Simplicial Regression Depth with Censored and Truncated Data

  • Park, Jinho
    • Communications for Statistical Applications and Methods
    • /
    • 제10권1호
    • /
    • pp.167-175
    • /
    • 2003
  • In this paper we develop a robust procedure to estimate regression coefficients for a linear model with censored and truncated data based on simplicial regression depth. Simplicial depth of a point is defined as the proportion of data simplices containing it. This simplicial depth can be extended to regression problem with censored and truncated data. Any line can be given a depth and the deepest regression line is the line with the maximum simplicial regression depth. We show how the proposed regression performs through analyzing AIDS incubation data.