• Title/Summary/Keyword: invariant factors

Search Result 39, Processing Time 0.018 seconds

On Resistance of Bit Permutation Based Block Cipher against Nonlinear Invariant Attack (비트 순열 기반 블록암호의 비선형 불변 공격 저항성 연구)

  • Jeong, Keonsang;Kim, Seonggyeom;Hong, Deukjo;Sung, Jaechul;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.3
    • /
    • pp.325-336
    • /
    • 2020
  • Nonlinear Invariant Attack is an attack that should be considered when constructing lightweight block ciphers with relatively simple key schedule. A shortcut to prove a block cipher's resistance against nonlinear invariant attack is checking the smallest dimension of linear layer-invariant linear subspace which contains all known differences between round keys is equal to the block size. In this paper, we presents the following results. We identify the structure and number of optimal bit-permutations which require only one known difference between round keys for a designer to show that the corresponding block cipher is resistant against nonlinear invariant attack. Moreover, we show that PRESENT-like block ciphers need at least two known differences between round keys by checking all PRESENT-like bit-permutations. Additionally, we verify that the variants of PRESENT-like bit-permutations requiring the only two known differences between round keys do not conflict with the resistance against differential attack by comparing the best differential trails. Finally, through the distribution of the invariant factors of all bit-permutations that maintain BOGI logic with GIFT S-box, GIFT-variant block ciphers require at least 8 known differences between round keys for the resistance.

Integrated Automatic Pre-Processing for Change Detection Based on SURF Algorithm and Mask Filter (변화탐지를 위한 SURF 알고리즘과 마스크필터 기반 통합 자동 전처리)

  • Kim, Taeheon;Lee, Won Hee;Yeom, Junho;Han, Youkyung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.3
    • /
    • pp.209-219
    • /
    • 2019
  • Satellite imagery occurs geometric and radiometric errors due to external environmental factors at the acquired time, which in turn causes false-alarm in change detection. These errors should be eliminated by geometric and radiometric corrections. In this study, we propose a methodology that automatically and simultaneously performs geometric and radiometric corrections by using the SURF (Speeded-Up Robust Feature) algorithm and the mask filter. The MPs (Matching Points), which show invariant properties between multi-temporal imagery, extracted through the SURF algorithm are used for automatic geometric correction. Using the properties of the extracted MPs, PIFs (Pseudo Invariant Features) used for relative radiometric correction are selected. Subsequently, secondary PIFs are extracted by generated mask filters around the selected PIFs. After performing automatic using the extracted MPs, we could confirm that geometric and radiometric errors are eliminated as the result of performing the relative radiometric correction using PIFs in geo-rectified images.

A Study on the Optimum Convergence Factor for Adaptive Filters (적응필터를 위한 최적수렴일자에 관한 연구)

  • 부인형;강철호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.49-57
    • /
    • 1994
  • An efficient approach for the computationtion of the optimum convergence factor is proposed for the LMS algorithm applied to a transversal FIR structure in this study. The approach automatically leads to an optimum step size algorithm at each weight in every iteration that results in a dramatic reduction in terms of convergence time. The algorithm is evaluated in system identification application where two alternative computer simulations are considered for time-invariant and time-varying system cases. The results show that the proposed algorithm needs not appropriate convergence factor and has better performance than AGC(Automatic Gain Control) algorithm and Karni algorithm, which require the convergence factors controlled arbitrarily in computer simulation for time-invariant system and time-varying systems. Also, itis shown that the proposed algorithm has the excellent adaptability campared with NLMS(Normalized LMS) algorithm and RLS (Recursive least Square) algorithm for time-varying circumstances.

  • PDF

REMARKS ON THE LIECHTI-STRENNER'S EXAMPLES HAVING SMALL DILATATIONS

  • Ham, Ji-Young;Lee, Joongul
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.4
    • /
    • pp.1299-1307
    • /
    • 2020
  • We show that the Liechti-Strenner's example for the closed nonorientable surface in [13] minimizes the dilatation within the class of pseudo-Anosov homeomorphisms with an orientable invariant foliation and all but the first coefficient of the characteristic polynomial of the action induced on the first cohomology nonpositive. We also show that the Liechti-Strenner's example of orientation-reversing homeomorphism for the closed orientable surface in [13] minimizes the dilatation within the class of pseudo-Anosov homeomorphisms with an orientable invariant foliation and all but the first coefficient of the characteristic polynomial p(x) of the action induced on the first cohomology nonpositive or all but the first coefficient of p(x)(x ± 1)2, p(x)(x2 ± 1), or p(x)(x2 ± x + 1) nonpositive.

Environment-Adaptive Image Segmentation Using Color Invariants (칼라 불변량을 이용한 환경 적응적인 영상 분할)

  • Jang, Seok-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.10
    • /
    • pp.71-78
    • /
    • 2010
  • Even though various types of image segmentation methods have been extensively introduced, robustly segmenting images to environmental conditions such as illumination changes, shading, highlight, etc, has been known to be a very difficult task. To resolve the problem in some degree, we propose in this paper an environment-adaptive image segmentation approach using color invariants. The suggested method first introduces several color invariants like W, C, U, N, and H, and automatically measures environmental conditions in which images are captured. It then chooses the most adequate color invariant to environmental factors, and effectively extracts edges using the selected invariant. Experimental results show that the proposed method can robustly perform edge-based segmentation rather than existing methods. We expect that our method will be useful in many real applications which require edge-based image segmentation.

Traffic Sign Detection Using The HSI Eigen-color model and Invariant Moments (HSI 고유칼라 모델과 불변 모멘트를 이용한 교통 표지판 검출 방법)

  • Kim, Jong-Bae;Park, Jung-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.1
    • /
    • pp.41-51
    • /
    • 2010
  • In the research for driver assistance systems, traffic sign information to the driver must be a very important information. Therefore, the detection system of traffic signs located on the road should be able to handel real-time. To detect the traffic signs, color and shape of traffic signs is to use the information after images obtained using the CCD camera. In the road environment, however, using color information to detect traffic sings will cause many problems due to changes of weather and environmental factors. In this paper, to solve it, the candidate traffic sign regions are detected from road images obtained in a variety of the illumination changes using the HSI eign-color model. And then, using the invariant moment-based SVM classifier to detect traffic signs are proposed. Experimental results show that, traffic sign detection rate is 91%, and the processing time per frame is 0.38sec. Proposed method is useful for real-time intelligent traffic guidance systems can be applied.

The Universal Property of Inverse Semigroup Equivariant KK-theory

  • Burgstaller, Bernhard
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.1
    • /
    • pp.111-137
    • /
    • 2021
  • Higson proved that every homotopy invariant, stable and split exact functor from the category of C⁎-algebras to an additive category factors through Kasparov's KK-theory. By adapting a group equivariant generalization of this result by Thomsen, we generalize Higson's result to the inverse semigroup and locally compact, not necessarily Hausdorff groupoid equivariant setting.

Statistical comparison of morphological dilation with its equivalent linear shift-invariant system:case of memoryless uniform soruces (무기억 균일 신호원에 대한 수리 형태론적인 불림과 등가 시스템의 통계적 비교)

  • 김주명;최상신;최태영
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.79-93
    • /
    • 1997
  • This paper presents a linear shift-invariant system euqivalent to morphological dilation for a memoryless uniform source in the sense of the power spectral density function, and comares it with dialtion. This equivalent LSI system is found through spectral decomposition and, for dilation and with windwo size L, it is shown to be a finite impulse response filter composed of L-1 delays, L multipliers and three adders. Th ecoefficients of the equivalent systems are tabulated. The comparisons of dilation and its equivalent LSI system show that probability density functions of the output sequences of the two systems are quite different. In particular, the probability density functon from dilation of an independent and identically distributed uniform source over the unit interval (0, 1) shows heavy probability in around 1, while that from the equivalent LSI system shows probability concentration around themean vlaue and symmetricity about it. This difference is due to the fact that dilation is a non-linear process while the equivalent system is linear and shift-ivariant. In the case that dikation is fabored over LSI filters in subjective perforance tests, one of the factors can be traced to this difference in the probability distribution.

  • PDF

Atmospheric Correction Problems with Multi-Temporal High Spatial Resolution Images from Different Satellite Sensors

  • Lee, Hwa-Seon;Lee, Kyu-Sung
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.4
    • /
    • pp.321-330
    • /
    • 2015
  • Atmospheric correction is an essential part in time-series analysis on biophysical parameters of surface features. In this study, we tried to examine possible problems in atmospheric correction of multitemporal High Spatial Resolution (HSR) images obtained from two different sensor systems. Three KOMPSAT-2 and two IKONOS-2 multispectral images were used. Three atmospheric correction methods were applied to derive surface reflectance: (1) Radiative Transfer (RT) - based absolute atmospheric correction method, (2) the Dark Object Subtraction (DOS) method, and (3) the Cosine Of the Uun zeniTh angle (COST) method. Atmospheric correction results were evaluated by comparing spectral reflectance values extracted from invariant targets and vegetation cover types. In overall, multi-temporal reflectance from five images obtained from January to December did not show consistent pattern in invariant targets and did not follow a typical profile of vegetation growth in forests and rice field. The multi-temporal reflectance values were different by sensor type and atmospheric correction methods. The inconsistent atmospheric correction results from these multi-temporal HSR images may be explained by several factors including unstable radiometric calibration coefficients for each sensor and wide range of sun and sensor geometry with the off-nadir viewing HSR images.