• 한국정보통신학회논문지
• /
• 제15권6호
• /
• pp.1363-1368
• /
• 2011

본 논문은 화소 대 화소 매핑 기반 컴퓨터 집적 영상에서 발생하는 그래눌라 잡음에 대한 해석을 제시한다. 화소 매핑 기반 집적 영상 복원 방식은 고해상도의 영상을 제공할 뿐 아니라 이전의 역투사 방식보다 연산량이 작다. 본 논문에서는 화소 매핑 방식에 대한 신호 모델이 소개되고, 이를 통하여 그래눌라 잡음을 정의하고 해석한다. 제시된 신호 모델을 기반으로 잡음에 대한 특성을 분석한 컴퓨터 실험이 제공된다. 실험 결과는 기존의 역투사 방식의 그래눌라 잡음 발생 형태와 상이함을 보여주며 이는 또한 화소 매핑 방식에서 활용될 수 있음을 보여준다.

• Current Optics and Photonics
• /
• 제6권5호
• /
• pp.463-472
• /
• 2022

At certain wavelengths, single-pixel imaging is considered to be a solution that can achieve high quality imaging and also reduce costs. However, achieving imaging of complex scenes is an overhead-intensive process for single-pixel imaging systems, so low efficiency and high consumption are the biggest obstacles to their practical application. Improving efficiency to reduce overhead is the solution to this problem. Salient object detection is usually used as a pre-processing step in computer vision tasks, mimicking human functions in complex natural scenes, to reduce overhead and improve efficiency by focusing on regions with a large amount of information. Therefore, in this paper, we explore the implementation of salient object detection based on single-pixel imaging after a single pixel, and propose a scheme to reconstruct images based on Fourier bases and use U²Net models for salient object detection.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 춘계학술대회
• /
• pp.359-360
• /
• 2021

영상의 픽셀기반처리는 한 픽셀의 값을 변환하는데 다른 픽셀의 값에 관계없이 단지 현재의 픽셀의 값에만 의존하여 변환하는 처리를 의미한다. 픽셀기반 처리는 영상 변환, 영상 개선, 영상 합성 등의 많은 분야에서 가장 기초적인 연산으로 사용된다. 산술연산, 히스토그램 평활화, 명암대비 스트레칭 등의 처리 방법들이 있다. 본 논문에서는 드론으로 촬영된 서해안 갯벌 영상에서 갯벌 영역을 명확하게 구분하기 위하여 전처리 과정 중 경계검출부분에서 픽셀기반처리를 이용하여 효율적인 윤곽선을 찾기 위한 방법을 모색한다.

• 한국컴퓨터정보학회논문지
• /
• 제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.

• 한국가시화정보학회:학술대회논문집
• /
• 한국가시화정보학회 2001년도 Proceedings of 2001 Korea-Japan Joint Seminar on Particle Image Velocimetry
• /
• pp.14-22
• /
• 2001

The frequency responses on the sub-pixel evaluation technique were investigated using the Monte-calro Simulation technique. The frequency response by the FFT based cross-correlation gives very good results, however, the gain loss does exist for the small displacement, (less than 0.5 pixel). While, the no gain loss is observed in the Direct Cross-correlation, however, the sub-pixel accuracy was limited to be about 0.1 pixel, i.e., it could not detect the small displacement. To detect the higher accurate sub-pixel displacement, the gradient based technique is the best. For the small interrogation area (e.g., 4x4), only the gradient technique can detect the small displacement correctly.

• 정보처리학회논문지B
• /
• 제12B권2호
• /
• pp.131-136
• /
• 2005

동영상 데이터를 실시간으로 전송하기 위해서는 데이터의 압축이 필수적인데, 이때 움직임 추정 기법을 사용하여 동영상내에 존재하는 중복된 데이터를 제거함으로써 데이터를 압축한다. 일반적으로, 움직임 추정 기법은 정 화소 움직임 벡터 추정과 반 화소 움직임 벡터 추정으로 이루어져 있는데, 블록 정합 기법을 사용하는 정 화소 움직임 벡터 추정을 위하여 많은 기법들이 제안되어 정 화소 움직임 추정에 소요되는 계산량을 줄였지만, 반 화소 보간과 블록 정합 기법을 사용하는 반 화소 움직임 벡터 추정을 위해서 그렇지 않다. 본 논문에서는 많은 계산량을 필요로 하는 반 화소 움직임 추정을 위한 기법을 제안하였는데, 제안된 기법은 정 화소와 반 화소 사이에 존재하는 움직임 벡터들의 상관성을 이용하였다. 실험을 통하여, 제안된 기법과 일반적으로 반 화소 움직임 추정에 사용되는 기법을 비교하였을 경우, 제안된 기법은 움직임 보상 예측된 화질면에 있어서 약 $0.07\~0.69(dB)$정도 저하되었지만, 탄 화소 움직임 벡터 추정의 속도면에 있어서 약 $2.5\~80$배 이상 높은 성능 향상을 보였다.

• 한국멀티미디어학회논문지
• /
• 제17권12호
• /
• pp.1393-1401
• /
• 2014

This paper presents an adaptive image interpolation method using a pixel-based neighbor embedding which is modified from the patch-based neighbor embedding of contemporary super resolution algorithms. Conventional interpolation methods for high resolution detect at least 16-directional edges in order to remove zig-zaging effects and selectively choose the interpolation strategy according to the direction and value of edge. Thus, they require much computation and high complexity. In order to develop a simple interpolation method preserving edge's directional shape, the proposed algorithm adopts the simplest Haar wavelet and suggests a new pixel-based embedding scheme. First, the low-quality image but high resolution, magnified into 1 octave above, is acquired using an adaptive 8-directional interpolation based on the high frequency coefficients of the wavelet transform. Thereafter, the pixel embedding process updates a high resolution pixel of the magnified image with the weighted sum of the best matched pixel value, which is searched at its low resolution image. As the results, the proposed scheme is simple and removes zig-zaging effects without any additional process.

• 센서학회지
• /
• 제23권2호
• /
• pp.87-93
• /
• 2014

In this paper, we propose a block-based low-power complementary metal oxide semiconductor (CMOS) image sensor (CIS) with a simple pixel structure for power efficiency. This method, which uses an additional computation circuit, makes it possible to reduce the power consumption of the pixel array. In addition, the computation circuit for a block-based CIS is very flexible for various types of pixel structures. The proposed CIS was designed and fabricated using a standard CMOS 0.18 ${\mu}m$ process, and the performance of the fabricated chip was evaluated. From a resultant image, the proposed block-based CIS can calculate a differing contrast in the block and control the operating voltage of the unit blocks. Finally, we confirmed that the power consumption in the proposed CIS with a simple pixel structure can be reduced.

• 전기전자학회논문지
• /
• 제18권3호
• /
• pp.403-408
• /
• 2014

본 논문은 Varying Interpolator를 개선하여 다수의 Pixel을 한 번에 처리할 수 있는 Rasterizer 구조를 제안한다. 설계한 Rasterizer의 Varying Interpolator는 한 번에 16 Pixel을 처리 할 수 있으며 최대 64개의 색상을 출력으로 가진다. 또한 Rasterizer의 연산을 행렬연산 및 행렬변환으로 구성하여 연산의 중복성을 줄이고 재사용성을 높여 Rasterizer의 처리 속도를 높였다. 제안하는 구조의 Rasterizer 는 기존의 연구와 비교하여 색상 보간은 11%, Rasterizer 전체 처리 속도는 17% 향상된 성능을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2351-2369
• /
• 2012

This paper describes interpolation method of motion field in the Wyner-Ziv video coding (WZVC) based on Expectation-Maximization (EM) algorithm. In the EM algorithm, the estimated motion field distribution is calculated on a block-by-block basis. Each pixel in the block shares similar probability distribution, producing an undesired blocking artefact on the pixel-based motion field. The proposed interpolation techniques are Bicubic and Lanczos which successively use 16 and 32 neighborhood probability distributions of block-based motion field for one pixel in k-by-k block on pixel-based motion field. EM-based WZVC codec updates the estimated probability distribution on block-based motion field, and interpolates it to pixel resolution. This is required to generate higher-quality soft side information (SI) such that the decoding algorithm is able to make syndrome estimation more quickly. Our experiments showed that the proposed interpolation methods have the capability to reduce EM-based WZVC decoding complexity with small increment of bit rate.