• Title/Summary/Keyword: Block variance

Search Result 143, Processing Time 0.021 seconds

Fractal Image Compression Using Adaptive Selection of Block Approximation Formula (블록 근사화식의 적응적 선택을 이용한 프랙탈 영상 부호화)

  • Park, Yong-Ki;Park, Chul-Woo;Kim, Doo-Young
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.12
    • /
    • pp.3185-3199
    • /
    • 1997
  • This paper suggests techniques to reduce coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, we choose new approximation coefficients using a non-linear approximation of luminance term. This boosts the fidelity. Our experiment employing the above methods shows enhancement in the coding time more than two times over traditional coding methods and shows improvement in PSNR value by about 1-3dB at the same com- pression rate.

  • PDF

A block-based real-time people counting system (블록 기반 실시간 계수 시스템)

  • Park Hyun-Hee;Lee Hyung-Gu;Kim Jai-Hie
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.5 s.311
    • /
    • pp.22-29
    • /
    • 2006
  • In this paper, we propose a block-based real-time people counting system that can be used in various environments including showing mall entrances, elevators and escalators. The main contributions of this paper are robust background subtraction, the block-based decision method and real-time processing. For robust background subtraction obtained from a number of image sequences, we used a mixture of K Gaussian. The block-based decision method was used to determine the size of the given objects (moving people) in each block. We divided the images into $6{\times}12$ blocks and trained the mean and variance values of the specific objects in each block. This was done in order to provide real-time processing for up to 4 channels. Finally, we analyzed various actions that can occur with moving people in real world environments.

Improvement of code acquisition time in DS/SS systems using a hybrid scheme (복합방식을 이용한 직접대역확산통신시스템의 코드획득 성능개선)

  • 조권도;김선영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.684-691
    • /
    • 1996
  • Since the period of a spreading code in DS/SS communication systems is generally long, it is necessary to make the code acquisition as fast as possible. The code acquisition time can be sued as a measure to evaluate the performance of code acquisition systems. The search rate of serial search codee acquisition system used in the coventional CDMA cellular system is lower than that of the matched filter technique. In order to reduce the code acquisition time, this paper proposes hybrid code acquisition system composed filters combined with serial search blocks. In the proposed system, the matched filter sweeps possible code phases fast and the acquired phase information is verified by the serial search block. The mean and the variance of its acquisition time are calculated and compared with those of double dwell serial search system. The results indicate better performance of the proposed system by yielding its small vaues of the mean and the variance of code acquisition time.

  • PDF

Point Cloud Measurement Using Improved Variance Focus Measure Operator

  • Yeni Li;Liang Hou;Yun Chen;Shaoqi Huang
    • Current Optics and Photonics
    • /
    • v.8 no.2
    • /
    • pp.170-182
    • /
    • 2024
  • The dimensional accuracy and consistency of a dual oil circuit centrifugal fuel nozzle are important for fuel distribution and combustion efficiency in an engine combustion chamber. A point cloud measurement method was proposed to solve the geometric accuracy detection problem for the fuel nozzle. An improved variance focus measure operator was used to extract the depth point cloud. Compared with other traditional sharpness evaluation functions, the improved operator can generate the best evaluation curve, and has the least noise and the shortest calculation time. The experimental results of point cloud slicing measurement show that the best window size is 24 × 24 pixels. In the height measurement experiment of the standard sample block, the relative error is 2.32%, and in the fuel nozzle cone angle measurement experiment, the relative error is 2.46%, which can meet the high precision requirements of a dual oil circuit centrifugal fuel nozzle.

Test for reliability of MS Excel statistical analysis output and modification of macros (Focused on an Analysis of Variance menu) (MS 엑셀 프로그램의 통계분석결과 신뢰성 검증 및 매크로 보완 (분산분석 메뉴를 중심으로))

  • Kim, Sook-Young
    • Journal of the Korea Computer Industry Society
    • /
    • v.9 no.5
    • /
    • pp.207-216
    • /
    • 2008
  • Statistical analysis menus of MS Excel software, with powerful spreadsheet functions has not been modified since Excel 2000 Edition and its utilization is very low. To improve utilization of Excel menu for statistical analysis, this research compared outputs of Excel statistical menus and computed test statistics, and developed high-level macros. Outputs of Excel menus, both oneway layout and twoway layout, on real data are exactly same as the computed test statistics, and therefore, Excel menus for statistical analysis are reliable. Macros to provide results for Analysis of Variance with a block and multiple comparison of means are developed using Excel functions.

  • PDF

Unconstrained Object Segmentation Using GrabCut Based on Automatic Generation of Initial Boundary

  • Na, In-Seop;Oh, Kang-Han;Kim, Soo-Hyung
    • International Journal of Contents
    • /
    • v.9 no.1
    • /
    • pp.6-10
    • /
    • 2013
  • Foreground estimation in object segmentation has been an important issue for last few decades. In this paper we propose a GrabCut based automatic foreground estimation method using block clustering. GrabCut is one of popular algorithms for image segmentation in 2D image. However GrabCut is semi-automatic algorithm. So it requires the user input a rough boundary for foreground and background. Typically, the user draws a rectangle around the object of interest manually. The goal of proposed method is to generate an initial rectangle automatically. In order to create initial rectangle, we use Gabor filter and Saliency map and then we use 4 features (amount of area, variance, amount of class with boundary area, amount of class with saliency map) to categorize foreground and background. From the experimental results, our proposed algorithm can achieve satisfactory accuracy in object segmentation without any prior information by the user.

A Decomposition Method for Two stage Stochstic Programming with Block Diagonal Structure (블록 대각 구조를 지닌 2단계 확률계획법의 분해원리)

  • 김태호;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.10 no.1
    • /
    • pp.9-13
    • /
    • 1985
  • This paper develops a decomposition method for stochastic programming with a block diagonal structure. Here we assume that the right-hand side random vector of each subproblem is differente each other. We first, transform this problem into a master problem, and subproblems in a similar way to Dantizig-Wolfe's Decomposition Princeple, and then solve this master problem by solving subproblems. When we solve a subproblem, we first transform this subproblem to a Deterministic Equivalent Programming (DEF). The form of DEF depends on the type of the random vector of the subproblem. We found the subproblem with finite discrete random vector can be transformed into alinear programming, that with continuous random vector into a convex quadratic programming, and that with random vector of unknown distribution and known mean and variance into a convex nonlinear programming, but the master problem is always a linear programming.

  • PDF

Vibration Analysis of Structure with Nonlinear Joint Using Describing Function (기술함수를 이용한 비선형 결합부를 가진 구조물의 진동해석)

  • 박해성;지태한;박영필
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.2
    • /
    • pp.372-379
    • /
    • 1994
  • In this study, the describing function is adopted to represent nonlinearity in the system equations. The compliance can be obtained by solving nonlinear simultaneous algebraic quations for multi-degrees-of-freedom system with multinonlinearities. When the technique is applied, the nonlinearity of the system can be identified from the compliance which is obtained from the sinusoidal excitation of the system. By employing the describing function in the Building Block Analysis, we can extensively develop the BBA into investigation of the continuous systems with nonlinearities. The evaluated compliance can quantitatively show the effects of nonlinearity such as the transfer of the natural frequency, the variance of the compliance at the natural frequency, and the jump phenomena which occur during sweeping of the excitation frequency.

Heritability and Genetic Gains for Height Growth in 20-year-Old Korean White Pine in Korea

  • Shin, Man-Yong;Park, Hyung-Soon;Cho, Yoon-Jin;Chung, Dong-Jun
    • Korean Journal of Plant Resources
    • /
    • v.19 no.6
    • /
    • pp.677-679
    • /
    • 2006
  • The objectives of this study were to examine the genetic variation of 20-year-old tree height and to estimate heritabilities and genetic gains of Korean white pine. Analysis of variance showed that families and family x block interaction had the significant (p=0.01) effects on tree height. However, family variation appears to be much greater than the variation due to family x block interaction. Individual tree heritability was higher ($h_I^2=0.73$) than family heritability, ($h_F^2=0.83$) therefore, combined selection showed the largest genetic gain (17.76%) in a given equal intensity of selection.

Digital Image Watermarking Scheme using Adaptive Block Division

  • Cho, Soo-Hyung;Jung, Tae-Yeon;Joung, Young-Hoon;Lee, Kyeong-Hwan;Kim, Duk-Gyoo
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1228-1231
    • /
    • 2002
  • Digital image watermarking scheme using adaptive block division is proposed. To increase the perceptual invisibility, the image is divided into blocks by local properties and the human visual system (HVS), then the significant blocks are selected in the divided blocks. The significant coefficient is determined by Weber's law in these blocks. To increase the robustness, low frequency domains of the discrete cosine transform (DCT) and the discrete wavelet transform (DWT) are used. The watermark is embedded into the selected significant blocks of the DCT's and DWT's low frequency domains with adaptive watermark strengths. The watermark strength is determined by the variance and the local properties of the significant block. The experimental results prove that the proposed scheme has a good robustness against several image processing operations (e.g. median filtering, cropping, scaling, JPEG, JPEG2000, etc.) without significant degradation of the watermarked image.

  • PDF