• 로봇학회논문지
• /
• 제11권3호
• /
• pp.115-126
• /
• 2016

This paper suggests the method of the spherical signature description of 3D point clouds taken from the laser range scanner on the ground vehicle. Based on the spherical signature description of each point, the extractor of significant environmental features is learned by the Deep Belief Nets for the urban structure classification. Arbitrary point among the 3D point cloud can represents its signature in its sky surface by using several neighborhood points. The unit spherical surface centered on that point can be considered to accumulate the evidence of each angular tessellation. According to a kind of point area such as wall, ground, tree, car, and so on, the results of spherical signature description look so different each other. These data can be applied into the Deep Belief Nets, which is one of the Deep Neural Networks, for learning the environmental feature extractor. With this learned feature extractor, 3D points can be classified due to its urban structures well. Experimental results prove that the proposed method based on the spherical signature description and the Deep Belief Nets is suitable for the mobile robots in terms of the classification accuracy.

• 한국해양공학회지
• /
• 제28권3호
• /
• pp.254-259
• /
• 2014

The infrared signature of a ship is largely influenced by the ocean environment of the operating area, which has been known to cause large changes in the signature. As a result, the weather condition has to be clearly set for an analysis of the infrared signatures. It is necessary to analyze meteorological data for all the oceans where the ship is supposed to be operated. This is impossibly costly and time consuming because of the huge size of the data. Therefore, the creation of a standard environmental variable for an infrared signature research is necessary. In this study, we compared and analyzed sampling methods to represent ocean data close to the Korean peninsula. In order to perform this research, we collected ocean meteorological records from KMA (Korea Meteorological Administration), and sampled these in numerous ways considering five variables that are known to affect the infrared signature. Specifically, a simple random sampling method for all the data and 1-D, 2-D, and 3-D stratified sampling methods were compared and analyzed by considering the mean square errors for each method.

• 한국통신학회논문지
• /
• 제22권4호
• /
• pp.870-879
• /
• 1997

D.Chaum은 단순한 서명의 사본만으로는 서명의 정당성을 확인할 수 없고 서명의 확인을 위해서는 반드시 서명자의 도움을 받아야 하는 undeniable signatures를 제안하였으며, 지금까지 많은 undeniable형 디지틀 서명방식들이 서명의 남용으로부터 서명자나 수신자를 보호하기 위하여 제안되었다. 본 논문에서는 기존의 undeniable형 특수 디지틀 서명방식들과 일반적인 서명방식을 하나로 통합한 일반화된 undeniable 디지틀 서명을 제안한다. 또한 기존의 undeniable signatrues 들이 제 3의 도청자로 인하여 응용이 제한적인 경우가 있음을 지적하고. 이를 해결하기 위하여 새로운 개념의 result-indistinguishable undeniable signatures를 제안한다.

• 정보처리학회논문지D
• /
• 제14D권4호
• /
• pp.373-380
• /
• 2007

유비쿼터스 전자거래를 통하여 사용자는 언제 어디서나 네트워크에 접근하여 편리한 정보를 개인과 그룹, 그룹과 그룹 사이에서 교환할 수 있다. 사용자가 이러한 유비쿼터스 전자거래를 안전하게 사용하기 위해서는, 전자 정보의 무결성과 인증의 특성을 가지는 디지털 서명이 필수 조건이다. 유비쿼터스 네트워크에서의 디지털 서명은 언제 어디서나 필요에 따라 그룹을 만들기도 하고 해체하기도 하므로, 유비쿼터스 전자거래는 신뢰된 그룹 관리자와 셋업 프로시져 철회 프로시져 등이 필요 없는 디지털 서명이 요구된다. 따라서 본 논문에서는 안전한 유비쿼터스 전자거래를 위한 디지털 서명으로서 쓰레시홀드 링 서명을 제안한다. 제안된 디지털 서명은 위조의 위험이 없는(무결성) 링 서명과 메시지가 다른 서명자에 의해 서명되는 것을 증명할 수 없는 문제를 해결하는(인증) (n,t)링 서명을 사용한다. 그러므로 제안된 쓰레시홀드 링 서명은 무결성과 인증을 만족하는 차세대 유비쿼터스 그룹 서명이다.

• 전기학회논문지
• /
• 제63권6호
• /
• pp.797-803
• /
• 2014

In this paper, 3D face recognition system is designed by using polynomial based on RBFNNs. In case of 2D face recognition, the recognition performance reduced by the external environmental factors such as illumination and facial pose. In order to compensate for these shortcomings of 2D face recognition, 3D face recognition. In the preprocessing part, according to the change of each position angle the obtained 3D face image shapes are changed into front image shapes through pose compensation. the depth data of face image shape by using Multiple Point Signature is extracted. Overall face depth information is obtained by using two or more reference points. The direct use of the extracted data an high-dimensional data leads to the deterioration of learning speed as well as recognition performance. We exploit principle component analysis(PCA) algorithm to conduct the dimension reduction of high-dimensional data. Parameter optimization is carried out with the aid of PSO for effective training and recognition. The proposed pattern classifier is experimented with and evaluated by using dataset obtained in IC & CI Lab.

• 전기학회논문지
• /
• 제64권6호
• /
• pp.900-911
• /
• 2015

In this paper, 3D face recognition model is designed by using Polynomial based RBFNN(Radial Basis Function Neural Network) and PNN(Polynomial Neural Network). Also recognition rate is performed by this model. In existing 2D face recognition model, the degradation of recognition rate may occur in external environments such as face features using a brightness of the video. So 3D face recognition is performed by using 3D scanner for improving disadvantage of 2D face recognition. In the preprocessing part, obtained 3D face images for the variation of each pose are changed as front image by using pose compensation. The depth data of face image shape is extracted by using Multiple point signature. And whole area of face depth information is obtained by using the tip of a nose as a reference point. Parameter optimization is carried out with the aid of both ABC(Artificial Bee Colony) and PSO(Particle Swarm Optimization) for effective training and recognition. Experimental data for face recognition is built up by the face images of students and researchers in IC&CI Lab of Suwon University. By using the images of 3D face extracted in IC&CI Lab. the performance of 3D face recognition is evaluated and compared according to two types of models as well as point signature method based on two kinds of depth data information.

• 한국통신학회논문지
• /
• 제41권10호
• /
• pp.1301-1308
• /
• 2016

인터넷 속도의 증가와 다양한 응용의 개발로 인해 인터넷 사용자와 이들이 발생시키는 인터넷 트래픽의 양이 급격히 증가하고 있다. 트래픽 분석에 있어서 트래픽 응용 식별 방법은 페이로드 시그니쳐에 의존적이기 때문에 시그니쳐의 구성이나 개수에 따라 높은 부하와 처리 속도가 느린 단점을 갖는다. 따라서 본 논문에서는 응용 식별을 위한 페이로드 시그니쳐의 중요도를 평가하는 방법과 이를 바탕으로 높은 효율의 시그니쳐를 탐색하는 방법을 제안한다. 각 시그니쳐 별로 3가지 기준을 바탕으로 가중치를 계산하고 계산된 가중치와 시그니쳐 맵을 통해 고효율의 시그니쳐 세트를 탐색한다. 제안하는 방법을 실제 트래픽에 적용했을 때 기존 대비 약 4배의 응용 식별 능력을 가진 높은 효율의 시그니쳐들을 정의할 수 있었다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권3호
• /
• pp.118-123
• /
• 2021

Recently, digital crime is becoming more intelligent, and efficient digital forensic techniques are required to collect evidence for this. In the case of important files related to crime, a specific person may intentionally delete the file. In such a situation, data recovery is a very important procedure that can prove criminal charges. Although there are various methods to recover deleted files, we focuses on the recovery technique using HxD editor. When recovering a deleted file using the HxD editor, check the file structure and access the file data area through calculation. However, there is a possibility that errors such as arithmetic errors may occur when a file approach through calculation is used. Therefore, in this paper, we propose an algorithm that automatically calculates the header and footer of a file after checking the file signature in the root directory for efficient file recovery. If the algorithm proposed in this paper is used, it is expected that the error rate of arithmetic errors in the file recovery process can be reduced.

• 전자공학회논문지S
• /
• 제34S권12호
• /
• pp.90-97
• /
• 1997

This paper presents a new algorithm for surface segmentation and feature description. The algorithm extracts the signature of an edge image based on the signature technqique[12] in the first stage. If there exists a range in the angle axis where more than two signatures form a closed curve, we can conclude there is a surface inside the range. Using this feature of the signature, surfaces can be segmented. The surface features such as number of vertices, number of edges, and type of surfaces can also be extracted by finding the signatures of individual surfaces. This algorithm has distinguished advantages: it can easily recover the lost part occuring in the edge iage using the curve fitting method and it can extract surface features even when surfaces are rotated in 3-D space.

• Journal of Communications and Networks
• /
• 제12권3호
• /
• pp.201-208
• /
• 2010

We propose a new notion of metered signatures. Metered signature is an extension of k-times signatures in which a signer can generate only k signatures. However, the restriction of metered signatures can be more elaborate: It can be used k-times every day or to preserve the order of signed messages in some applications. Any violation of this regulation reveals a secret key or the signature on a predetermined message. The applications includes proxy signatures, limited free downloads, and the rating web site. We give two instances of metered signatures: One is based on the computational Diffie-Hellman problem (CDHP) using a bilinear map and the other is based on the RSA problem. In both schemes, the signature and certificate size and the verification cost are constant with respect to k. Further, we show that the proposed metered signatures admit batch verification of many signatures almost at one verification cost with small security loss.