• 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.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1994.06a
• /
• pp.367-370
• /
• 1994

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.232-234
• /
• 2003

차량 번호판 인식 시스템은 차량 보급의 대중화와 그에 따라 발생되는 여러문제의 해결차원에서 활발하게 연구 개발되고 있는 분야이다. 본 논문에서는 휴대용 입력 장치로부터 획득한 차량 번호판 영상에서 차량 번호판이 가지는 특성을 이용하여 번호판을 추출한 후, 차량 번호판의 특성을 이용하여 개별 문자 영역들의 MBR(Minimum Boundary Rectangle)을 추출한다. 그리고. 불변 모멘트의 특징을 이용하여 기존의 템플릿 매칭 방식 보다 연산시간이 매우 빠르고 입력 영상내의 번호판 크기에 제약이 적온 장점을 가진 보다 향상된 차량 번호판 인식 시스템을 제안한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.566-570
• /
• 1986

본 논문의 목적은 대규모 선형 시불변 계통에 대한 합성 제어기의 설계에 관한 새로운 방법을 제시하기 위한 것이다. 주어진 계통을 행렬 부호 함수를 이용하여 그 고유치의 크기에 따라 블럭 대각 분해하고 각부 계통에 대한 최적 제어기 및 전체계통에 대한 준최적 합성 제어기를 설계한다. 이 방법은 주어진 계통의 고유치를 미리 알 필요가 없으며 계통의 블력 분해 과정에서 Riccati 방정식및 Lyapunov 방정식의 해를 구할 필요가 없고 특이섭등 기법이나 Two time scale seperation 방법에서의 제약조건에 관계없이 광범위하게 적용되는 장점이 있다.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.927-934
• /
• 2014

In this paper, we propose an effective method for recognizing daily human activities from a stream of three dimensional body poses, which can be obtained by using Kinect-like RGB-D sensors. The body pose data provided by Kinect SDK or OpenNI may suffer from both the view variance problem and the scale variance problem, since they are represented in the 3D Cartesian coordinate system, the origin of which is located on the center of Kinect. In order to resolve the problem and get the view-invariant and scale-invariant features, we transform the pose data into the spherical coordinate system of which the origin is placed on the center of the subject's hip, and then perform on them the scale normalization using the length of the subject's arm. In order to represent effectively complex internal structures of high-level daily activities, we utilize Hidden state Conditional Random Field (HCRF), which is one of probabilistic graphical models. Through various experiments using two different datasets, KAD-70 and CAD-60, we showed the high performance of our method and the implementation system.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.212-218
• /
• 2003

State invariant is a property that holds in every reachable state. It can be used not only in understanding and analyzing complex software systems, but it can also be used for system verifications such as checking safety, liveness, and consistency. For these reasons, there are many vital researches for deriving state invariant from finite state machine models. In previous works every reachable state is to be considered to generate state invariant. Thus it is likely to be too complex for the user to understand. This paper seeks to answer the question `how to simplify state invariant\ulcorner`. Since the complexity of state invariant is strongly dependent upon the size of states to be considered, so the smaller the set of states to be considered is, the shorter the length of state invariant is. For doing so, we let the user focus on some interested scopes rather than a whole state space in a model. Computation Tree Logic(CTL) is used to specify scopes in which he/she is interested. Given a scope in CTL, mixed reachability analysis is used to find out a set of states inside it. Obviously, a set of states calculated in this way is a subset of every reachable state. Therefore, we give a weaker, but comprehensible, state invariant.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.2
• /
• pp.81-88
• /
• 2004

For scale and rotation invariant pattern recognition of images with noise, an optical wavelet CHF-fSDF filter is proposed. Wavelet CHF-fSDF filter is synthesized by each single CHF extracted from scale-changed and wavelet transformed images for a referene image as training images. The proposed optical wavelet CHF-fSDF filter is the type of the matched filter so that it can use the structure of 4f optical correlation system. The results of computer simulation show that the proposed filter has the rotation and scale-invariant correlation output and it is useful in the noisy input.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.221-224
• /
• 2001

In this paper we propose a shift-invariant uHMT estimation for wavelet-based image denoising. The proposed estimation have just nine meta-parameter (independent of the size of the image and the number of wavelet scales) and requires no kinds of training. Also it solve visual artifacts resulted in the lack of shift-invariance in the DWT. The experimental results show that the proposed estimation is more effective than the other wavelet-based denoising by 0.5-ldB (PSNR) and allows an Ο(nlog n) in terms of performance speed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.6
• /
• pp.1214-1218
• /
• 2006

This paper presents method to speed up processing time in construction of panoramic images. The method based on invariant feature uses image down-scaling and image edge information. Reducing image size and applying feature descriptor to image portions superimposed with edge causes to reduce the number of features and to improve processing speed. In the experiments, it was shown that the proposed method was 3.26$\sim$13.87% shorter in processing time than the exiting method fer 24-bit color images of 640$\times$480 size.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.864-867
• /
• 2000

영상과 같은 다양하고 복잡한 데이터 검색은 기존의 키워드를 이용한 검색이 아닌 내용 기반 검색 방법이 요구된다. 본 논문에서는 입력된 사용자 질의를 객체의 위치이동이나 회전, 크기변화에 민감하지 않은 불변모멘트(Invariant Moments)값을 이용하여 효율적으로 검색할 수 있는 시스템을 구현하였다. 영상내의 단일 객체 뿐만 아니라 다중 객체들도 효과적으로 검출하기 위해 레이블링(Labeling) 알고리즘을 적용해 각각의 객체를 따로 분리하여 불변모멘트를 적용하는 방법을 이용했다. 또한, 검색 시간 단축 및 영상의 효율적인 인덱싱(Indexing)을 위해 해싱을 응용한 기법을 적용하였다. 이로써, 기존의 전체 영상의 특징을 가지고 정확히 표현할 수 없는 객체들을 정확히 표현해 줌으로서 좀더 정확한 검색 결과를 얻을 수 있었다.