• Title/Summary/Keyword: invariant

Search Result 2,153, Processing Time 0.026 seconds

Development of Runoff Hydrograph Model for the Derivation of Optimal Design Flood of Agricultural Hydraulic Structures(1) (농업수리구조물의 적정설계홍수량 유도를 위한 유출수문곡선모형의 개발(I))

  • 이순혁;박명근;맹승진
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.37 no.3_4
    • /
    • pp.34-47
    • /
    • 1995
  • It is experienced fact as a regular annual event that the structure to he designed on unreasonable flood for the agricultural structures including reservoirs have been brought not only loss of lives, but also enormous property damage. For the solution of this problem at issue, this study was conducted to develop an optimal runoff hydrograph model by comparison of the peak flows and time to peak between observed and simulated flows derived by linear time-invariant and linear time-variant models under the condition of having a short duration of heavy rainfall with uniform rainfall intensity at nine small watersheds which are within the range of 55.9 to 140.7 square kilometers in area in Han, Geum, Nagdong and Yeongsan Rivers. The results obtained through this study can be summarized as follows. 1. Storage constants and Gamma function arguments were calculated within the range of 1.2 to 6.42 and of 1.28 to 8.05 respectively by the moment method as the parameters for the analysis of runoff hydrograph based on linear time-invariant model. 2. Parameters for both linear time-invariant and linear time-variant models were calibrated with nine gaged watershed data, using a trial and error method. The resulting parameters including Gamma function argument, N and storage constant, K for linear time-invariant model were related statistically to watershed characteristic variables such as area, slope, length of main stream and the centroid length of the basin. 3. Average relative errors of the simulated peak discharge of calibrated runoff hydrographs by using linear time-variant and linear time-invariant models were shown to be 0.75 and 5.42 percent respectively to the peak of observed runoff hydrographs. Correlation coefficients for the statistical analysis in the same condition were shown to be 0.999 and 0.978 with a high significance respectively. Therefore, it can be concluded that the accuracy of a linear time-variant model is approaching more closely to the observed runoff hydrograph than that of a linear time-invariant model in the applied watersheds. 4. Average relative errors of the time to peak of calibrated runoff hydrographs by using linear time-variant and linear time-invariant models were shown to be 16.44 and 19.89 percent respectively to the time to peak of observed runoff hydrographs. Correlation coefficients in the same condition were also shown to be 0.999 and 0.886 with a high significance respectively. 5. It can be seen that the shape of simulated hydrograph based on a linear time- variant model is getting closer to the observed runoff hydrograph than that of a linear time-invariant model in the applied watersheds. 6. Two different models were verified with different rainfall-runoff events from data for the calibration by relative error and correlation analysis. Consequently, it can be generally concluded that verification results for the peak discharge and time to peak of simulated runoff hydrographs were in good agreement with those of calibrated runoff hydrographs.

  • PDF

Image Mosaicking Using Feature Points Based on Color-invariant (칼라 불변 기반의 특징점을 이용한 영상 모자이킹)

  • Kwon, Oh-Seol;Lee, Dong-Chang;Lee, Cheol-Hee;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.89-98
    • /
    • 2009
  • In the field of computer vision, image mosaicking is a common method for effectively increasing restricted the field of view of a camera by combining a set of separate images into a single seamless image. Image mosaicking based on feature points has recently been a focus of research because of simple estimation for geometric transformation regardless distortions and differences of intensity generating by motion of a camera in consecutive images. Yet, since most feature-point matching algorithms extract feature points using gray values, identifying corresponding points becomes difficult in the case of changing illumination and images with a similar intensity. Accordingly, to solve these problems, this paper proposes a method of image mosaicking based on feature points using color information of images. Essentially, the digital values acquired from a digital color camera are converted to values of a virtual camera with distinct narrow bands. Values based on the surface reflectance and invariant to the chromaticity of various illuminations are then derived from the virtual camera values and defined as color-invariant values invariant to changing illuminations. The validity of these color-invariant values is verified in a test using a Macbeth Color-Checker under simulated illuminations. The test also compares the proposed method using the color-invariant values with the conventional SIFT algorithm. The accuracy of the matching between the feature points extracted using the proposed method is increased, while image mosaicking using color information is also achieved.

ON T-FUZZY GROUPS

  • Chon, Inheung
    • Korean Journal of Mathematics
    • /
    • v.9 no.2
    • /
    • pp.149-156
    • /
    • 2001
  • We characterize some properties of $t$-fuzzy groups and $t$-fuzzy invariant groups and represent every subgroup S of a group X using the level set of $t$-fuzzy group constructed from S.

  • PDF

ON THE CLASS OF κTH ROOTS OF PARANORMAL OPERATORS

  • YANG, YOUNG OH
    • Honam Mathematical Journal
    • /
    • v.26 no.2
    • /
    • pp.137-145
    • /
    • 2004
  • we shall study some properties of a new class ($\sqrt[\kappa]{P}$) (defined below). Also we show that T may not be normaloid when $T{\in}(\sqrt[\kappa]{P})$, and that the class ($\sqrt{H}$) may not have the translation-invariant propety.

  • PDF

The Methods Of Synthesis And Matched Processing The Normal System Of Orthogonal Circle M-Invariant Signal

  • Inh Tran Due
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.897-899
    • /
    • 2004
  • There is scientific work containing the recurrence method of synthesis the new class of orthogonal circle m-invariant signals: designed effective algorithms of fast-direct computing m-convolution in time domain: engineer methods of design economic scheme of decoders for optimal receiving in aggregate of suggested signal.

  • PDF

ISOMETRY GOUP SO(1,2)

  • Kim, Sung-Sook;Shin, Joon-Kook
    • Communications of the Korean Mathematical Society
    • /
    • v.11 no.4
    • /
    • pp.1055-1059
    • /
    • 1996
  • We characterize the left invariant Riemannian metrics on SO(1,2) which give rise to 3- or 4-dimensional isometry groups.

  • PDF

Estimates of invariant metrics on some pseudoconvex domains in $C^N$

  • Cho, Sang-Hyun
    • Journal of the Korean Mathematical Society
    • /
    • v.32 no.4
    • /
    • pp.661-678
    • /
    • 1995
  • In this paper we will estimate from above and below the values of the Bergman, Caratheodory and Kobayashi metrics for a vector X at z, where z is any point near a given point $z_0$ in the boundary of pseudoconvex domains in $C^n$.

  • PDF

LINEARLY INVARIANT FUNCTIONS

  • Song, Tai-Sung
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.4
    • /
    • pp.867-874
    • /
    • 1995
  • Linear invariance is closely related to the concept of uniform local univalence. We give a geometric proof that a holomorphic locally univalent function defined on the open unit disk is linearly invariant if and only if it is uniformly locally univalent.

  • PDF