• Steel and Composite Structures
• /
• 제19권3호
• /
• pp.569-583
• /
• 2015

Recent years, explosive welding structures have been widely used in many engineering fields. The bonding state detection of explosive welding structures is significant to prevent unscheduled failures and even catastrophic accidents. However, this task still faces challenges due to the complexity of the bonding interface. In this paper, a new method called dual-tree complex wavelet transform based permutation entropy (DTCWT-PE) is proposed to detect bonding state of such structures. Benefiting from the complex analytical wavelet function, the dual-tree complex wavelet transform (DTCWT) has better shift invariance and reduced spectral aliasing compared with the traditional wavelet transform. All those characters are good for characterizing the vibration response signals. Furthermore, as a statistical measure, permutation entropy (PE) quantifies the complexity of non-stationary signals through phase space reconstruction, and thus it can be used as a viable tool to detect the change of bonding state. In order to more accurate identification and detection of bonding state, PE values derived from DTCWT coefficients are proposed to extract the state information from the vibration response signal of explosive welding structure, and then the extracted PE values serve as input vectors of support vector machine (SVM) to identify the bonding state of the structure. The experiments on bonding state detection of explosive welding pipes are presented to illustrate the feasibility and effectiveness of the proposed method.

• 한국컴퓨터정보학회논문지
• /
• 제26권12호
• /
• pp.133-142
• /
• 2021

이동 패턴 인식은 사용자 궤적 질의, 사용자 행동 예측, 사용자 위치에 기초한 흥미요소 추천, 사용자 개인 정보 보호 및 지자체 교통 계획과 같은 여러 측면에서 널리 사용된다. 현재 인식 정확도는 응용 요건을 충족할 수 없기 때문에 이동 패턴 인식 연구는 궤적 데이터 연구의 초점이라 할 수 있다. GPS 내비게이션 기술과 지능형 모바일 기기의 대중화로 많은 사용자 모바일 데이터 정보를 얻을 수 있고, 이를 바탕으로 많은 의미 있는 연구가 이루어질 수 있다. 현재의 이동 패턴 연구 방법에서 궤적의 특징 추출은 궤도의 기본 속성(속도, 각도, 가속도 등)으로 제한된다. 본 논문에서 순열 엔트로피는 궤적 분류 연구에 참여하기 위한 궤적의 고유값으로 사용되었으며 시계열의 복잡성을 측정하기 위한 속성으로도 사용되었다. 속도 순열 엔트로피와 각도 순열 엔트로피가 이동 패턴 분류에 참여하기 위한 궤적의 특성으로 사용되었으며, 본 논문에서 사용된 순열 엔트로피를 기반으로 한 속성 분류의 정확도는 81.47%에 달했다.

• Journal of applied mathematics & informatics
• /
• 제39권5_6호
• /
• pp.751-760
• /
• 2021

We study in this paper the right Rényi mean for a quantum divergence induced from the α - z Rényi relative entropy. Many properties including homogeneity, invariance under permutation, repetition and unitary congruence transformation, and determinantal inequality have been presented. Moreover, we give the identity of two right Rényi means with respect to tensor product.

• 융합보안논문지
• /
• 제24권3호
• /
• pp.67-79
• /
• 2024

에너지 발전소 등을 포함한 주요 기반시설을 공격 대상으로 하는 공격자들은 지능적이고 정교화된 공격을 수행하는 동시에, 목표에 달성할 때까지 공격 흔적을 은닉한다. 특히 실제 물리적 환경과 연결되어 있는 사이버 물리 시스템의 운영 데이터를 조작하는 것은 사람의 안전에 직접적으로 영향을 줄 수 있다. 사이버 물리 시스템의 특성에 따라 일반적인 정보 기술 환경에서의 이상 식별 및 탐지 방법과는 차별적인 접근법이 필요하다. 이에 본 연구에서는 사이버 물리 시스템의 특성을 고려하기 위하여 재귀적 필터링을 수행하고, 악의적으로 조작된 운영 데이터를 식별하기 위한 엔트로피 기반의 접근법이 통합된 방법론을 제안한다. 공개된 산업제어시스템 보안 데이터셋을 기반으로 합성한 데이터에 제안하는 방법론을 적용한 결과, 조작된 운영 데이터를 효과적으로 식별할 수 있음을 검증하였다.

• Computers and Concrete
• /
• 제34권1호
• /
• pp.79-91
• /
• 2024

In symmetric cryptography, a cryptographically secure Substitution-Box (S-Box) is a key component of a block cipher. S-Box adds a confusion layer in block ciphers that provide resistance against well-known attacks. The generation of a cryptographically secure S-Box depends upon its generation mechanism. In this paper, we propose a novel framework for the construction of cryptographically secure S-Boxes. This framework uses a combination of linear fractional transformation and permutation functions. S-Boxes security is analyzed against well-known security criteria that include nonlinearity, bijectiveness, strict avalanche and bits independence criteria, linear and differential approximation probability. The S-Boxes can be used in the encryption of any grayscale digital images. The encrypted images are analyzed against well-known image analysis criteria that include pixel changing rates, correlation, entropy, and average change of intensity. The analysis of the encrypted image shows that our image encryption scheme is secure.

• International Journal of Contents
• /
• 제11권4호
• /
• pp.56-69
• /
• 2015

This paper proposes an efficient image encryption scheme based on quintuple encryption using two chaotic maps. The encryption process is realized with quintuple encryption by calling the encrypt(E) and decrypt(D) functions five times with five different keys in the form EDEEE. The decryption process is accomplished in the reverse direction by invoking the encrypt and decrypt functions in the form DDDED. The keys for the quintuple encryption/decryption processes are generated by using a Tent map. The chaotic values for the encrypt/decrypt operations are generated by using a Gumowski-Mira map. The encrypt function E is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage scrambles all the rows and columns to chaotically generated positions. This stage reduces the correlation radically among the neighboring pixels. The pixel value rotation stage circularly rotates all the pixels either left or right, and the amount of rotation is based on chaotic values. The last stage performs the diffusion four times by scanning the image in four different directions: Horizontally, Vertically, Principal diagonally and Secondary diagonally. Each of the four diffusion steps performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. This stage ensures the resistance against the differential attacks. The security and performance of the proposed method is investigated thoroughly by using key space, statistical, differential, entropy and performance analysis. The experimental results confirm that the proposed scheme is computationally fast with security intact.

• Journal of Multimedia Information System
• /
• 제2권2호
• /
• pp.193-206
• /
• 2015

In this paper a new approach for image encryption based on quadruple encryption with dual chaotic maps is proposed. The encryption process is performed with quadruple encryption by invoking the encrypt and decrypt routines with different keys in the sequence EDEE. The decryption process is performed in the reverse direction DDED. The key generation for the quadruple encryption is achieved with a 1D Circle map. The chaotic values for the encrypt and decrypt routines are generated by using a 2D Henon map. The Encrypt routine E is composed of three stages i.e. permutation, pixel value rotation and diffusion. The permutation is achieved by: row and column scrambling with chaotic values, exchanging the lower and the upper principal and secondary diagonal elements based on the chaotic values. The second stage circularly rotates all the pixel values based on the chaotic values. The last stage performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. The security and performance of the proposed scheme are assessed thoroughly by using the key space, statistical, differential, entropy and performance analysis. The proposed scheme is computationally fast with security intact.

• Journal of Computing Science and Engineering
• /
• 제8권4호
• /
• pp.187-198
• /
• 2014

In this paper an efficient image encryption scheme based on cyclic rotations and multiple blockwise diffusions with two chaotic maps is proposed. A Sin map is used to generate round keys for the encryption/decryption process. A Pomeau-Manneville map is used to generate chaotic values for permutation, pixel value rotation and diffusion operations. The encryption scheme is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage performs four operations on the image: row shuffling, column shuffling, cyclic rotation of all the rows and cyclic rotation of all the columns. This stage reduces the correlation significantly among neighboring pixels. The second stage performs circular rotation of pixel values twice by scanning the image horizontally and vertically. The amount of rotation is based on $M{\times}N$ chaotic values. The last stage performs the diffusion four times by scanning the image in four different ways: block of $8{\times}8$ pixels, block of $16{\times}16$ pixels, principal diagonally, and secondary diagonally. Each of the above four diffusions performs the diffusion in two directions (forwards and backwards) with two previously diffused pixels and two chaotic values. This stage makes the scheme resistant to differential attacks. The security and performance of the proposed method is analyzed systematically by using the key space, entropy, statistical, differential and performance analysis. The experimental results confirm that the proposed method is computationally efficient with high security.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2317-2337
• /
• 2015

Cryptography provides an effective solution to secure the communication over public networks. The communication over public networks that includes electronic commerce, business and military services, necessitates the requirement of simple and robust encryption techniques. In this paper, a novel image encryption method which employs calligraphy based hybrid scan and random number is presented. The original image is scrambled by pixel position permutation with calligraphy based diagonal and novel calligraphy based scan patterns. The cipher image is obtained by XORing the scrambled image with random numbers. The suggested method resists statistical, differential, entropy, and noise attacks which have been demonstrated with a set of standard images.

• 한국음향학회지
• /
• 제42권6호
• /
• pp.536-543
• /
• 2023

다수의 화자가 존재하는 음성에서 "누가 언제 발화했는가?"에 대해 레이블링하는 화자 분할은 발화 중첩 구간에 대한 레이블링과 화자 분할 모델의 최적화를 위해 심층 신경망 기반의 종단 간 방법에 대해 연구되었다. 대부분 심층 신경망 기반의 종단 간 화자 분할 시스템은 음성의 각 프레임에서 발화한 모든 화자의 레이블들을 추정하는 다중 레이블 분류 문제로 분할을 수행한다. 다중 레이블 기반의 화자 분할 시스템은 임계값을 어떤 값으로 설정하는지에 따라 모델의 성능이 많이 달라진다. 본 논문에서는 임계값 없이 화자 분할을 수행할 수 있도록 단일 레이블 분류를 이용한 화자 분할 시스템에 대해 연구하였다. 제안하는 화자 분할 시스템은 기존의 화자 레이블을 단일 레이블 형태로 변환하여 모델의 출력으로부터 레이블을 바로 추정한다. 훈련에서는 화자 레이블 순열을 고려하기 위해 Permutation Invariant Training(PIT) 손실함수와 교차 엔트로피 손실함수를 조합하여 사용하였다. 또한 심층 구조를 갖는 모델의 효과적인 학습을 위해 화자 분할 모델에 잔차 연결 구조를 추가하였다. 실험은 Librispeech 데이터베이스를 이용해 화자 2명에 대한 시뮬레이션 잡음 데이터를 생성하여 사용하였다. Diarization Error Rate(DER) 성능 평가 지수를 이용해 제안한 방법과 베이스라인 모델을 비교 평가했을 때, 제안한 방법이 임계값 없이 분할이 가능하며, 약 20.7 %만큼 향상된 성능을 보였다.