• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권3호
• /
• pp.1051-1077
• /
• 2021

The secure communication of information is a major concern over the internet. The information must be protected before transmitting over a communication channel to avoid security violations. In this paper, a new hybrid method called compressed encrypted data embedding (CEDE) is proposed. In CEDE, the secret information is first compressed with Lempel Ziv Welch (LZW) compression algorithm. Then, the compressed secret information is encrypted using the Advanced Encryption Standard (AES) symmetric block cipher. In the last step, the encrypted information is embedded into an image of size 512 × 512 pixels by using image steganography. In the steganographic technique, the compressed and encrypted secret data bits are divided into pairs of two bits and pixels of the cover image are also arranged in four pairs. The four pairs of secret data are compared with the respective four pairs of each cover pixel which leads to sixteen possibilities of matching in between secret data pairs and pairs of cover pixels. The least significant bits (LSBs) of current and imminent pixels are modified according to the matching case number. The proposed technique provides double-folded security and the results show that stego image carries a high capacity of secret data with adequate peak signal to noise ratio (PSNR) and lower mean square error (MSE) when compared with existing methods in the literature.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 춘계학술대회 논문집
• /
• pp.1099-1102
• /
• 2005

In this paper, a new visual servo method, which uses 5 axis picomotor to compensate the misalignment generated between a SLM and a CCD in a holographic storage device, was proposed and the effectiveness of it was proved by the experiment. In a holographic storage device, the data processing is done by the SLM and the CCD, and the shape of data is 2 dimensional binary patterns. Therefore, the exact image matching between the SLM and the CCD is very important, and the mismatching of it causes the errors in the data reconstruction. First, the brief introduction of a holographic data storage is given, then, BER concept which is errors caused by pixel mismatch between the SLM and the CCD is defined. Second, the geometric relation between 5 axis picomotor and the CCD movement is studied. Finally, the visual servo method using 5 axis picomotor to reduce the BER in a holographic storage device is proposed and experimented. From the experiment, we find that about 3% BER improvement is obtained by the proposed method.

• 노동경제논집
• /
• 제38권1호
• /
• pp.1-30
• /
• 2015

한국의 구인 구직 매칭함수를 추정하였다. "사업체노동력조사"와 워크넷의 빈 일자리 수 과소 측정 문제를 극복하기 위해 채용동학모형을 통해 빈 일자리 잠재변수를 도출하고 이를 위한 도구변수를 매칭함수 추정에 활용하였다. 매칭 효율에 영향을 주는 구직자 속성과 공공고용서비스의 효과도 검증하였다. 구인 구직 매칭함수의 규모에 대한 수익불변(constant returns to scale)을 확인하였고, 매칭 효율은 구직자 중 전문대졸 학력자 비중과 정(+)의 상관관계를, 실업급여 수혜 비율과는 부(-)의 관계를 보였다.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2005년도 춘계학술대회
• /
• pp.135-144
• /
• 2005

In this paper, we develop the noninformative priors for the exponential models when the parameter of interest is the difference of two means. We develop the first and second order matching priors. We reveal that the second order matching priors do not exist. It turns out that Jeffreys' prior does not satisfy a first order matching criterion. The Bayesian credible intervals based on the first order matching meet the frequentist target coverage probabilities much better than the frequentist intervals of Jeffreys' prior.

• Communications for Statistical Applications and Methods
• /
• 제14권2호
• /
• pp.431-442
• /
• 2007

In this paper, we develop the noninformative priors when the parameter of interest is the difference between quantiles of two exponential distributions. We want to develop the first and second order probability matching priors. But we prove that the second order probability matching prior does not exist. It turns out that Jeffreys' prior does not satisfy the first order matching criterion. The Bayesian credible intervals based on the first order probability matching prior meet the frequentist target coverage probabilities much better than the frequentist intervals of Jeffreys' prior. Some simulation and real example will be given.

• 한국소음진동공학회논문집
• /
• 제24권4호
• /
• pp.310-316
• /
• 2014

The location template matching(LTM) method is a technique of identifying an impact location on a structure, and requires a certain measure of similarity between two time signals. In general, the correlation coefficient is widely used as the measure of similarity, while the group delay based method is recently proposed to improve the accuracy of the impact localization. Another possible measure is the frequency response assurance criterion(FRAC), though this has not been applied yet. In this paper, these three different measures of similarity are examined comparatively by using experimental data in order to understand the properties of these measures of similarity. The comparative study shows that the correlation coefficient and the FRAC give almost the same information while the group delay based method gives the shape oriented information that is best suitable for the location template matching method.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2014년도 춘계학술대회 논문집
• /
• pp.506-511
• /
• 2014

The location template matching (LTM) method is a technique of identifying an impact location on a structure, and requires a certain measure of similarity between two time signals. In general, the correlation coefficient is widely used as the measure of similarity, while the group delay based method is recently proposed to improve the accuracy of the impact localization. Another possible measure is the frequency response assurance criterion (FRAC), though this has not been applied yet. In this paper, these three different measures of similarity are examined comparatively by using experimental data in order to understand the properties of these measures of similarity. The comparative study shows that the correlation coefficient and the FRAC give almost the same information while the group delay based method gives the shape oriented information that is best suitable for the location template matching method.

• ETRI Journal
• /
• 제42권3호
• /
• pp.411-419
• /
• 2020

In real-world intelligent transportation systems, accuracy in vehicle license plate detection and recognition is considered quite critical. Many algorithms have been proposed for still images, but their accuracy on actual videos is not satisfactory. This stems from several problematic conditions in videos, such as vehicle motion blur, variety in viewpoints, outliers, and the lack of publicly available video datasets. In this study, we focus on these challenges and propose a license plate detection and recognition scheme for videos based on a temporal matching prior network. Specifically, to improve the robustness of detection and recognition accuracy in the presence of motion blur and outliers, forward and bidirectional matching priors between consecutive frames are properly combined with layer structures specifically designed for plate detection. We also built our own video dataset for the deep training of the proposed network. During network training, we perform data augmentation based on image rotation to increase robustness regarding the various viewpoints in videos.

• 한국컴퓨터정보학회논문지
• /
• 제24권5호
• /
• pp.35-40
• /
• 2019

In this paper, we design and implement a partial denoising boundary matching system using indexing techniques. Converting boundary images to time-series makes it feasible to perform a fast search using indexes even on a very large image database. Thus, using this converting method we develop a client-server system based on the previous partial denoising research in the GUI(graphical user interface) environment. The client first converts a query image given by a user to a time-series and sends denoising parameters and the tolerance with this time-series to the server. The server identifies similar images from the index by evaluating a range query, which is constructed using inputs given from the client and sends the resulting images to the client. Experimental results show that our system provides many intuitive and accurate matching results.

• Spatial Information Research
• /
• 제14권4호
• /
• pp.403-419
• /
• 2006

현재 주소정합(address matching) 기술 중 가장 잘 알려진 방법은 미국 센서스국에서 개발된 것으로서 거리이름을 기반으로 한 주소체계에 그 적용이 가능하다 그러나 한국, 일본과 같은 많은 국가들의 주소체계는 장소의 계층적 구조에 기초한 계층적 주소체계로 인하여 현재의 주소정합 기술을 적용하기가 불가능한 상황이다. 따라서 본 연구는 인간활동에서 생성되는 2차원적 3차원적 주소정보를 주소좌표변환(geocoding) 하기위한 지역적 주소정합방법, 특히 한국의 주소체계에 적합한 주소정합방법을 이론적으로 개발하는데 그 목적을 둔다. 이에 이 논문은 2차원 및 3차원 주소정합기술로 구성된 3차원 주소위치확인에 적용할 수 있는 새로운 접근방법을 설명한다.