• 한국컴퓨터정보학회논문지
• /
• 제21권12호
• /
• pp.35-41
• /
• 2016

In this paper, we propose a new real-time dead pixel detection method based on spatial compare filtering, which are usually used in the small target detection. Actually, the soft dead and the small target are cast in the same mold. Our proposed method detect and remove the dead pixels as applying the spatial compare filtering, into the pixel outputs of a detector after the non-uniformity correction. Therefore, we proposed method can effectively detect and replace the dead pixels regardless of the non-uniformity correction performance. In infrared camera, there are usually many dead detector pixels which produce abnormal output caused by manufactural process or operational environment. There are two kind of dead pixel. one is hard dead pixel which electronically generate abnormal outputs and other is soft dead pixel which changed and generated abnormal outputs by the planning process. Infrared camera have to perform non-uniformity correction because of structural and material properties of infrared detector. The hard dead pixels whose offset values obtained by non-uniformity correction are much larger or smaller than the average can be detected easily as dead pixels. However, some dead pixels(soft dead pixel) can remain, because of the difficulty of uncleared decision whether normal pixel or abnormal pixel.

• 비파괴검사학회지
• /
• 제29권6호
• /
• pp.557-562
• /
• 2009

Abrupt change of cross-section in mechanical parts is one of significant causes of structural fracture. In this paper, a hybrid method is employed to analyze the stress distribution of a discontinuous plate. The plate with an inclined crack is utilized in our experiment and the stress field in the vicinity of crack tip is calculated through isochromatic fringe order of given points. This calculation can be made handy through least-squares method integrated with complex power series representation(Laurent series) implemented on a computer program for high-speed processing. In order to accurately compare calculated results with experimental ones, both of actual and regenerated photoelastic fringe patterns are doubled and sharpened by digital image processing. The experiment results show that regenerated patterns obtained by hybrid method are quite comparable to actual patterns.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2007년도 동계학술대회
• /
• pp.127-133
• /
• 2007

We propose new reversible watermarking method for images. Being reversibility, original image and watermarked message should be recovered exactly. We propose different technique for hiding data to pairs. We use new type of histogram (pair histogram), which shows frequencies of each pair in image. We use histogram shift method for data embedding to pairs. We also propose improved version of method which allow hiding data with good performance for high capacities. This algorithm has better result compare to Tian's difference expansion method based on the Haar wavelet decomposition. For proposed algorithm capacity is higher under same PSNR.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제6권2호
• /
• pp.9-24
• /
• 2002

Total Variation(TV) regularization method is effective for reconstructing "blocky", discontinuous images from contaminated image with noise. But TV is represented by highly nonlinear integro-differential equation that is hard to solve. There have been much effort to obtain stable and fast methods. C. Vogel introduced "the Fixed Point Lagged Diffusivity Iteration", which solves the nonlinear equation by linearizing. In this paper, we apply multigrid(MG) method for cell centered finite difference (CCFD) to solve system arise at each step of this fixed point iteration. In numerical simulation, we test various images varying noises and regularization parameter $\alpha$ and smoothness $\beta$ which appear in TV method. Numerical tests show that the parameter ${\beta}$ does not affect the solution if it is sufficiently small. We compute optimal $\alpha$ that minimizes the error with respect to $L^2$ norm and $H^1$ norm and compare reconstructed images.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1999년도 KOBA 방송기술 워크샵 KOBA Broadcasting Technology Workshop
• /
• pp.171-176
• /
• 1999

Template matching is one of the most often used techniques for machine vision applications to find a template of size M$\times$M or subimage in a scene image of size N$\times$N. Most template matching methods, however, require pixel operations between the template and the image under analysis resulting in high computational cost of O(M2N2). So in this thesis, we present a two stage template matching method. In the first stage, we use a novel low cost feature whose complexity is approaching O(N2) to select matching candidates. In the second stage, we use conventional template matching method to find out the exact matching point. We compare the result with other methods in terms of complexity, efficiency and performance. Proposed method was proved to have constant time complexity and to be quite invariant to noise.

• Journal of Information Processing Systems
• /
• 제14권3호
• /
• pp.590-599
• /
• 2018

Multivariate finite mixture model is becoming more and more popular in image processing. Performing image denoising from image patches to the whole image has been widely studied and applied. However, there remains a problem that the structure information is always ignored when transforming the patch into the vector form. In this paper, we study the operator which extracts patches from image and then transforms them to the vector form. Then, we find that some pixels which should be continuous in the image patches are discontinuous in the vector. Due to the poor anti-noise and the loss of structure information, we propose a new operator which may keep more information when extracting image patches. We compare the new operator with the old one by performing image denoising in Expected Patch Log Likelihood (EPLL) method, and we obtain better results in both visual effect and the value of PSNR.

• 한국컴퓨터정보학회논문지
• /
• 제10권6호
• /
• pp.177-186
• /
• 2005

본 논문에서는 DEM(Digital Elevation Model)과 산 영상을 매핑하여 3차원 정보를 생성하고 이를 이용한 비전기반 카메라 위치인식방법을 제안한다. 일반적으로 인식에 사용된 영상의 특징들은 카메라뷰에 따라 내용이 변해 정보양이 증가하는 단점이 있다. 본 논문에서는 카메라뷰에 무관한 기하학의 불변특징을 추출하고 제안하는 유사도 평가함수와 Graham 탐색방법을 사용한 정확한 대응점을 산출하여 카메라 외부인수를 계산하였다. 또한 그래픽이론과 시각적 단서를 이용한 3차원 정보생성 방법을 제안하였다. 제안하는 방법은 불변 점 특징 추출단계, 3차원 정보 생성단계, 외부인수 산출단계의 3단계로 구성된다. 실험에서는 제안한 방법과 기존방법을 비교, 분석함으로써 제안한 방법의 우월성을 입증하였다.

• 한국조경학회지
• /
• 제29권5호
• /
• pp.20-27
• /
• 2001

The purpose of this study is to investigate and compare the validity and the reliability of the visual simulation method using the internet. For this. the evaluation of the artificial and natural landscape through the medium of color slides are compared with the internet survey. Data is analysed through the comparison of t-test between the two media by landscape type, and spatial image is analysed by factor analysis algorithm. Principle component analysis using Varimax Method is applied for extraction and factor rotation respectively. The results of this study can be summarized as follows; There are no statistical differences between the two methods with artificial and natural landscape in the total data that included second tests. Factors covering the spatial image are found to be \`aesthetic\`, \`spatial shape\`, and \`familiarity\`. Total variance is obtained as 66.4%. There are no statistical differences between the two methods in 2/3 of the cases. In the case of far view of artificial landscape, the results of the t-test show that the two methods are exactly the same. Especially in the case of the artificial far landscape shows no difference of all factors between two methods. There are no differences between first and second tests of the same media and the same landscape type. And it shows the reliability of this method. These results suggest that the probability that the internet can be used as a medium of landscape evaluation and gathering information on anyone\`s landscape image. Simulation techniques with the internet survey method should be further developed for practical application.

• 디지털콘텐츠학회 논문지
• /
• 제19권1호
• /
• pp.205-212
• /
• 2018

본 논문에서는 CNN 기반 서명인식에서 시간 정보를 이용하여 위조판별을 보다 정확하게 하는 방법을 제안한다. 시간정보를 쉽게 이용하고 서명 작성속도에 영향을 받지 않기 위해 서명을 동영상으로 획득하고 서명 전체 시간을 동일한 개수의 등 간격으로 나누어 각 이미지를 얻은 후 이를 합성하여 서명 데이터를 만든다. 본 논문에서 제안한 합성 서명이미지를 이용한 방법과 기존에 마지막 서명 이미지만을 이용하는 방법을 비교하기 위하여 CNN 기반의 다양한 서명인식 방법을 실험하였다. 25명의 서명데이터로 실험한 결과 시간 정보를 이용하는 방법이 기존 방법에 비하여 모든 위조판별 실험에서 성능이 향상됨을 보았다.

• 한국정보처리학회논문지
• /
• 제7권2호
• /
• pp.529-535
• /
• 2000

본 논문에서는 웨이브렛 변환을 이용한 영상 부호화에서 입력 영상의 통계적 성질에 영향을 받지 않고 부호화 결과에 범용성을 갖는 새로운 벡터 양자화기 설계법을 제안한다. 기존의 벡터 양자화기의 가장 큰 문제점은 양자화대상 영상과 대표 벡터를 생성하기 위한 학습계열간의 통계적 성질의 불일치에 의한 부호화 성능의 열화이다. 그리하여, 본 논문에서는 벡터 양자화기의 대표벡터를 생성하기 위한 학습계열로 독립 난수에 영상의 상관과 에지 성분을 첨가한 모사 영상을 사용하여 종래 방식의 문제점을 해결하는 방법에 대하여 검토하였다. 제안방식에 의해 설계된 벡터양자화기와 대표 벡터 생성에 이용하는 학습계열에 부호화 대상이 되는 영상과 같은 실제의 영상을 사용한 종래 방식에 의해 설계된 벡터 양자화기와 부호화 성능을 컴퓨터 시뮬레이션을 통하여 비교하여 종래 방식의 문제점을 명확하게 밝힘과 동시에 제안 방식으로 설계된 벡터 양자화기가 부호화 성능이 뛰어남을 보인다.