• Title/Summary/Keyword: 검출키

Search Result 152, Processing Time 0.028 seconds

Digital Watermarking based on Wavelet Transform and Singular Value Decomposition(SVD) (웨이블릿 변환과 특이치 분해에 기반한 디지털 워터마킹)

  • 김철기;차의영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6A
    • /
    • pp.602-609
    • /
    • 2002
  • In this paper, we propose an robust invisible watermarking method using wavelet transform and singular value decomposition for the ownership protection. of images. For this method, after we decompose the original image in three level using wavelet transform, we use singular value decomposition based key depended watermark insertion method in the lowest band $LL_3.$ And we also watermark using DCT for extraction of watermark and verification of robustness. In the experiments, we found that it had a good quality and robustness in attack such as compression, image processing, geometric transformation and noises. Especially, we know that this method have very high extraction ratio against nose and JPEG compression. And Digimarc's method can not extract watermark in 80 percent compression ratio of JPEG, but the proposed method can extract well.

Real-time Low-Resolution Face Recognition Algorithm for Surveillance Systems (보안시스템을 위한 실시간 저해상도 얼굴 인식 알고리즘)

  • Kwon, Oh-Seol
    • Journal of Broadcast Engineering
    • /
    • v.25 no.1
    • /
    • pp.105-108
    • /
    • 2020
  • This paper presents a real-time low-resolution face recognition method that uses a super-resolution technique. Conventional face recognition methods are limited by low accuracy resulting from the distance between the camera and objects. Although super-resolution methods have been developed to resolve this issue, they are not suitable for integrated face recognition systems. The proposed method recognizes faces with low resolution using key frame selection, super resolution, face detection, and recognition on real-time processing. Experiments involving several databases indicated that the proposed algorithm is superior to conventional methods in terms of face recognition accuracy.

Optical Encryption using a Random Phase Image and Shift Position in Joint Transform Correlation Plane (결합 변환 상관 평면의 이동 변위와 무작위 위상 영상을 이용한 광 암호화 시스템)

  • Shin, Chang-Mok;Lee, Woo-Hyuk;Cho, Kyu-Bo;Kim, Soo-Joong;Seo, Dong-Hoan;Lee, Sung-Geun
    • Korean Journal of Optics and Photonics
    • /
    • v.17 no.3
    • /
    • pp.248-255
    • /
    • 2006
  • Most optical security systems use a 4-f correlator, Mach-Zehnder interferometer, or a joint transform correlator(JTC). Of them, the JTC does not require an accurate optical alignment and has a good potential for real-time processing. In this paper, we propose an image encryption system using a position shift property of the JTC in the Fourier domain and a random phase image. Our encryption system uses two keys: one key is a random phase mask and the other key is a position shift factor. By using two keys, the proposed method can increase the security level of the encryption system. An encrypted image is produced by the Fourier transform for the multiplication image, which resulted from adding position shift functions to an original image, with a random phase mask. The random phase mask and position shift value are used as keys in decryption, simultaneously. For the decryption, both the encrypted image and the key image should be correctly located on the JTC. If the incorrect position shift value or the incorrect key image is used in decryption, the original information can not be obtained. To demonstrate the efficiency of the proposed system, computer simulation is performed. By analyzing the simulation results in the case of blocking of the encrypted image and affecting of the phase noise, we confirmed that the proposed method has a good tolerance to data loss. These results show that our system is very useful for the optical certification system.

Studies on Sensory Evaluation -[Part I] New Modified $Scheff{\grave{e}}'s$ Method I- (관능검사(官能檢査)에 관(關)한 연구(硏究) -제1보[第1報] Scheffe's method의 제1신법(第1新法)에 대(對)하여-)

  • Hong, Jin
    • Applied Biological Chemistry
    • /
    • v.20 no.2
    • /
    • pp.210-220
    • /
    • 1977
  • Modified Scheff's Method by Ura is an efficient method used very often in studying quality at a laboratory but, when panels are not well controlled and quality differences among samples are very small, it has sometimes been identified that it is impossible to detect quality differences by this method. Therefore in order to enhance efficiency to rank quality among samples, 'New Modified Scheffe's Method 1' is designed. Experimental results presented in this paper lead to the conclusion that detection is carried out more efficiently by 'New Modified Scheffe's Method 1' than by Modified Scheffe's Method by Ura, and also this title method can be utilized for the aim to train and control panels.

  • PDF

DNA Information Hiding Method for DNA Data Storage (DNA 데이터 저장을 위한 DNA 정보 은닉 기법)

  • Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.10
    • /
    • pp.118-127
    • /
    • 2014
  • DNA data storage refers to any technique for storing massive digital data in base sequence of DNA and has been recognized as the future storage medium recently. This paper presents an information hiding method for DNA data storage that the massive data is hidden in non-coding strand based on DNA steganography. Our method maps the encrypted data to the data base sequence using the numerical mapping table and then hides it in the non-coding strand using the key that consists of the seed and sector length. Therefore, our method can preserve the protein, extract the hidden data without the knowledge of host DNA sequence, and detect the position of mutation error. Experimental results verify that our method has more high data capacity than conventional methods and also detects the positions of mutation errors by the parity bases.

A Recognition Framework for Facial Expression by Expression HMM and Posterior Probability (표정 HMM과 사후 확률을 이용한 얼굴 표정 인식 프레임워크)

  • Kim, Jin-Ok
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.3
    • /
    • pp.284-291
    • /
    • 2005
  • I propose a framework for detecting, recognizing and classifying facial features based on learned expression patterns. The framework recognizes facial expressions by using PCA and expression HMM(EHMM) which is Hidden Markov Model (HMM) approach to represent the spatial information and the temporal dynamics of the time varying visual expression patterns. Because the low level spatial feature extraction is fused with the temporal analysis, a unified spatio-temporal approach of HMM to common detection, tracking and classification problems is effective. The proposed recognition framework is accomplished by applying posterior probability between current visual observations and previous visual evidences. Consequently, the framework shows accurate and robust results of recognition on as well simple expressions as basic 6 facial feature patterns. The method allows us to perform a set of important tasks such as facial-expression recognition, HCI and key-frame extraction.

Analysis of the Dead Layer Thickness effect and HPGe Detector by Penelope Simulation (Penelope Simulation에 의한 불감층 두께 효과 및 HPGe 검출기 분석)

  • Jang, Eun-Sung;Lee, Hyo-Yeong
    • Journal of the Korean Society of Radiology
    • /
    • v.12 no.7
    • /
    • pp.801-806
    • /
    • 2018
  • Germanium crystals have a dead layer that causes efficiency deterioration because the layer is not useful for detection but strongly weakens the photons. Thus, when the data provided by the manufacturer is used in the detector simulation model, there is a slight difference between the calculated efficiency and the measured efficiency.The shape and dimensions of the high purity germanium (HPGe) detector were determined by CT scans to accurately characterize the shape for the Monte Carlo roll simulation. It is found that the adjustment of the dead layer is a good match with the relative deviation of ${\pm}3%$ between the measurement efficiency and the simulation efficiency at the energy range of 50 - 1500 keV. Simulation data were compared by varying the thickness of the dead layer. The new Monte Carlo simulations were compared with the experimental results to obtain new blank layer thicknesses. The difference in dead layer results for the 1.5 mm thick end cap simulation model in 1.4 and 1.6 mm thick End Cap simulation models was a systematic error due to the accuracy of the end cap dimensions. After considering all errors including statistical errors and systematic errors, the thickness of the detector was calculated as $1.02{\pm}0.14mm$. Therefore, it was confirmed that the increase in the thickness of the dead layer causes the effect to be effected on the efficiency reduction.

FEC design with low complexity and efficient structure for DAB system (DAB 시스템에서 낮은 복잡도와 효율적인 구조를 갖는 FEC 설계)

  • 김주병;임영진;이문호;이광재
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.8A
    • /
    • pp.1348-1357
    • /
    • 2001
  • 본 논문에서는 DAB 시스템에서 사용하는 FEC(Forward Error Correction) 블록을 하드웨어 크기를 고려하여 효율적인 구조를 갖도록 설계하였다. DAB 시스템의 FEC 블록은 크게 스크램블러(에너지분산), 리드-솔로몬 코더, 길쌈 인터리버로 구성된다. RS 디코더 블록 중 키 방정식을 계산해 내는 블록과 길쌈 인터리버가 차지하는 하드웨어 비중은 굉장히 크다. 본 논문에서는 스크램블러 부분에서 데이터의 시작을 알려주는 신호의 효율적인 검출기법을 제안하고, 리드-솔로몬 디코더 블록의 수정 유클리드 알고리즘을 효율적인 하드웨어로 구현하기 위한 새로운 구조와 길쌈 인터리버에서 최적의 메모리 구조를 효과적인 구조를 제안한다. 제안한 구조에서는 단지 8개의 GF 곱셈기와 4개의 덧셈기만을 가지고 RS 디코더의 수정 유클리드 알고리즘을 구현하였으며, 2 RAM(128)과 4 RAM(256)을 가지고 컨벌루셔널 인터리버를 구현하였다. 제안한 구조로 설계했을 경우 디코더 블록이 Altera-FPGA 칩(FLEX10K)에 모두 들어갈 수 있었다.

  • PDF

Implementation of PDF417 2-dimensional Barcode Decoder (PDF417 이차원 바코드 디코딩 알고리즘의 구현)

  • 정정구;한희일
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.289-292
    • /
    • 2001
  • 종래에 사용되어 왔던 1차원 바코드가 정보를 포함하고 있는 데이터베이스에 접근하는 데이터 키 역할을 주로 해온 것에 비해, 2차원 바코드는 다량의 데이터를 포함할 수 있고 고밀도의 데이터 표현이 가능하여, 호스트 컴퓨터의 데이터 베이스에 온라인 연결할 필요없이 확인하고자 하는 사람이나 대상물에 대한 정보를 얻을 수 있다. 본 논문에서는 가장 널리 사용되는 2차원 바코드 체계인 PDF417 을 중심으로 디지털 카메라를 통하여 입력한 영상을 이진화하여 시작 심볼 또는 정지 심볼을 검색함으로써 2차원 바코드 영역을 추출한 다음, 추출된 영역으로부터 바코드의 행과 열의 수, 오류수정 정도 등의 헤더정보를 검출하고 이를 바탕으로 코드워드를 추출하는 알고리즘을 제안한다. 얻어진 코드워드는 데이터를 효율적으로 저장하기위해 정보가 숫자인지, ASCII코드인지 혹은 바이트 정보인지에 따라 다른 방식으로 인코딩 되어 있는데, 그에 따른 디코딩 알고리즘을 제안한다.

  • PDF

GPS와 VLBI 관측소의 해수하중에 의한 수직방향 지각변위 평가를 위한 기초 연구

  • 박관동
    • Bulletin of the Korean Space Science Society
    • /
    • 2003.10a
    • /
    • pp.30-30
    • /
    • 2003
  • GPS와 VLBI와 같은 우주측지 기술을 이용한 정밀 측위는 수 mn 정밀도의 관측소 좌표결정과 1 mm/year 정도의 고정밀 속도결정에 이용된다. 이를 위해서는 여러 가지 오차 요인들과 다양한 물리적 현상에 대한 모델링이 이루어져야 한다. 그 중의 하나가 해수 하중(ocean loading)에 의한 수직방향의 지각변위이다. 특히 한반도의 서해안은 복잡한 리아스식 해안으로 이루어져 있고, 조수간만의 차이가 크기 때문에 현존하는 모델의 정확도가 떨어진다. KVN(Korean VLBI Network)사업에서 추진하는 3기의 VLBI 중 2기가 서울과 제주도에 설치될 계획이므로, 해수하중에 의한 지각변위에 관한 연구가 선행되어야 한다. 또한 국내 GPS상시관측소의 많은 수가 서해안 지역에 설치되어 있다. 본 연구에서는 서해안 지역의 해수하중에 의한 수직방향의 지각변위를 GPS로 관측하고 이를 서해안 해수조류 모델의 정밀도를 향상시키는데 필요한 기초연구를 수행하였다. 서해안의 4개 GPS 관측소 위치에서의 해수하중에 의한 지각변위를 계산해본 결과 인천 지역에는 3 cm에 육박하는 지각변위가 수직으로 발생함을 알 수 있었다. 같은 크기와 위상의 지각변위 진폭을 GPS로 검출하기 위한 여러 가지 오차 보정과 GIPSY를 이용한 고정밀 키네마틱 GPS 자료처리에 대하여 상세히 소개한다.

  • PDF