• 한국가시화정보학회:학술대회논문집
• /
• 2001.12a
• /
• 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.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.91-98
• /
• 1997

In this paper, a new pixel decimation algorithm for the estimation of motion vector is proposed. In traditional methods, the computational cost can be reduced since only part of the pixels are used for motion vector calculation. But these methods limits the accuracy ofmotion vector because of the same reason. We derive a selection criteria of subsampled pixels that can reduce the probablity of false motion vector detection based on stochastic point of view. By using this criteria, a new pixel decimation algorithm that can reduce the prediction error with similar computational cost is presented. The simulation results applied to standard images haveshown that the proposed algorithm has less mean absolute prediction error than conventional pixel decimation algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.514-519
• /
• 1992

To make an accurate retrieval of the proportion of each category among mixed pixels (Mixel's) of a remotely sensed imagery, a maximum likelihood estimation method of category proportion is proposed. In this method, the observed multispectral vector is considered as probability variables along with the approximation that the supervised data of each category can be characterized by normal distribution. The results show that this method can retrieve accurate proportion of each category among Mixel's. And a index that can estimate the degree of error in each category is proposed. AS one of the application of the proportion estimation, a method for image classification based on category proportion estimation is proposed. In this method all pixel in a remotely sensed imagery are assumed to be Mixel's, and are classified to most dominant category. Among the Mixel's, there exists unconfidential pixels which should be categorized as unclassified pixels. In order to discriminate them, two types of criteria, Chi square and AIC, are proposed for fitness test on pure pixel hypothesis. Experimental result with a simulated dataset show an usefulness of proposed classification criterion compared to the conventional maximum likelihood criterion and applicability of the fitness tests based on Chi square and AIC,

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.9
• /
• pp.2483-2504
• /
• 2023

Most existing low-light enhancement algorithms either use a large number of training parameters or lack generalization to real-world scenarios. This paper presents a novel lightweight and robust pixel-wise polynomial approximation-based deep network for low-light image enhancement. For mapping the low-light image to the enhanced image, pixel-wise higher-order polynomials are employed. A deep convolution network is used to estimate the coefficients of these higher-order polynomials. The proposed network uses multiple branches to estimate pixel values based on different receptive fields. With a smaller receptive field, the first branch enhanced local features, the second and third branches focused on medium-level features, and the last branch enhanced global features. The low-light image is downsampled by the factor of 2b-1 (b is the branch number) and fed as input to each branch. After combining the outputs of each branch, the final enhanced image is obtained. A comprehensive evaluation of our proposed network on six publicly available no-reference test datasets shows that it outperforms state-of-the-art methods on both quantitative and qualitative measures.

• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.138-146
• /
• 2018

In this paper, we describe an algorithm for extracting depth information from a single image based on CNN. When acquiring three-dimensional information from a single two-dimensional image using a deep-learning technique, it is difficult to accurately predict the edge portion of the depth image because it is a part where the depth changes abruptly. in this paper, we introduce the concept of pixel-wise confidence to take advantage of these characteristics. We propose an algorithm that estimates depth information from a highly reliable flat part and propagates it to the edge part to improve the accuracy of depth estimation.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.689-691
• /
• 2008

We present a novel power estimation technique for LCD panels. Our method considers the power consumed by each pixel as well as the inter-pixel power effect of the neighboring pixels. We implemented our method based on the table lookup model and its accuracy is about 98% compared to the actual measurements.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.807-808
• /
• 2008

In H.264, sub-pel motion estimation (ME) has strong effect when coding video sequences. 1/4-pel performs better at low bitrate while 1/8-pel gives better results at high bitrate. In this paper, a variable sub-pixel motion vector resolution based on block mode motion estimation method is proposed. Experiment results show that the proposed method can take the advantage of 1/4-pel at low bitrate and 1/8-pel at high bitrate. In addition to that, time is reduced from 14% to 53% compared to KTA1.3 with 1/8-pel motion vector (MV) resolution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.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.

• Journal of Broadcast Engineering
• /
• v.22 no.3
• /
• pp.321-326
• /
• 2017

High Efficiency Video Coding (HEVC) adopted the Discrete Cosine Transform-II (DCT-II) based interpolation filter to improve coding efficiency in motion compensation and estimation. In HEVC, the interpolation filters based on the DCT-II are composed of 8-point for half-pixel and 7-point for 1/4-pixel and 3/4-pixel. In this paper, a DST-VII based interpolation filter is used improve motion compensation and estimation. The experimental results which applied the DST-VII interpolation filter are presented. They show the 0.45% of average bitrate reduction in Random Access configuration and 0.5% of average bitrate reduction in Low Delay B configuration, respectively.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.249-254
• /
• 2011

This paper describes an efficient design of the interpolation circuit to generate the luma and chroma sub-pixels for H.264 motion estimation. The circuit based on the proposed architecture does not require any input data buffering and processes the horizontal, vertical and diagonal sub-pixel interpolations in parallel. The performance of the circuit is further improved by simultaneously processing the 1/2-pixel and 1/4-pixel interpolations for luma components and the 1/8-pixel interpolations for chroma components. In order to reduce the circuit size, we store the intermediate data required to process all the interpolations in parallel in the internal SRAM's instead of registers. We described the proposed circuit at register transfer level and verified its operation on FPGA board. We also synthesized the gate-level circuit using 130nm CMOS standard cell library. It consists of 20,674 gates and has the maximum operating frequency of 244MHz. The total number of SPSRAM bits used in our circuit is 3,232. The size of our circuit (including logic gates and SRAM's) is smaller than others and the performance is still comparable to them.