• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.993-994
• /
• 2008

There are nine modes of the intra prediction for $4{\times}4$ luma blocks in H.264/AVC, each of which is identified by the prediction direction and reference pixels. Especially, mode 8 is modified to enhance coding efficiency, considering that the mode does not use left-bottom pixels although they are available. That is, we propose a modified intra prediction method of mode 8 which uses left-bottom pixels if available.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.23-26
• /
• 2003

In this work. we propose an algorithm for detecting and compensating dynamic false contours in plasma display panels (PDPs). First, we detect the candidate pixels, which are likely to be corrupted by false contours, and merge those pixels into several regions. Second, we estimate the motion vectors of the selected regions. Finally, based on the motion information. we modify the luminance values of the pixels in the regions to alleviate the effects of false contours. Simulation results demonstrate that the proposed algorithm efficiently reduces dynamic false contours at low computational complexity.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.1-7
• /
• 2016

In existing Convolutional Neural Network (CNNs) for object recognition task, there are only few efforts known to reduce the noises from the images. Both convolution and pooling layers perform the features extraction without considering the noises of the input image, treating all pixels equally important. In computer vision field, there has been a study to weight a pixel importance. Seam carving resizes an image by sacrificing the least important pixels, leaving only the most important ones. We propose a new way to combine seam carving approach with current existing CNN model for object recognition task. We attempt to remove the noises or the "unimportant" pixels in the image before doing convolution and pooling, in order to get better feature representatives. Our model shows promising result with CIFAR-10 dataset.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.951-956
• /
• 1990

The present paper describes a new technique for associating images employing a set of local constraints among pixels on an image. The technique describes the association problem in terms of consistent labeling which is an abstraction of various kinds of network constraints problems. In this particular research, a pixel and its gray value correspond to a unit and a label, respectively. Since constraints among units on an image are defined with respect to each n-tuple of pixels, performance of the present association technique largely depends on how to choose the n-tuples on an image plane. The main part of this paper is devoted to discussing this selection scheme and giving a solution to it as well as showing the algorithm of association. Also given are some results of the simulation performed on synthetic binary images to examine the performance of proposed technique, followed by the argument on further studies.

• 한국컴퓨터산업교육학회:학술대회논문집
• /
• 2003.11a
• /
• pp.39-44
• /
• 2003

This paper presents an algorithm for acquisition of linear segments of building from edge pixels using Kalman filtering. We can obtain the accurate position of building corners from the linear segments of building. The corner points are used to calculate the position of building corners in world coordinate using stereo vision technique. The algorithm has been applied to pairs of stereo aerial images and the result showed accurate linear segment detection from edge pixels of roof boundaries.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.723-726
• /
• 2009

This paper describes a non-causal interpolative prediction method for B-picture encoding. Interpolative prediction uses correlations between neighboring pixels, including non-causal pixels, for high prediction performance, in contrast to the conventional prediction, using only the causal pixels. For the interpolative prediction, the optimal quantizing scheme has been investigated for preventing conding error power from expanding in the decoding process. In this paper, we extend the optimal quantization sceme to inter-frame prediction in video coding. Unlike H.264 scheme, our method uses non-causal frames adjacent to the prediction frame.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.8
• /
• pp.16-22
• /
• 1999

In this paper, an efficient algorithm for estimating real edge locations to subpixel values is described. Digital images are acquired by projection into image plane and sampling process. However, most of real edge locations are lost in this process, which causes low measurement accuracy. For accurate measurement, we propose an algorithm which estimates the real boundary between two adjacent pixels in digital imagery, with subpixel accuracy. We first define 1D edge operator based on the moment invariant. To extend it to 2D data, the edge orientation of each pixel is estimated by the LSE(Least Squares Error)line/circle fitting of a set of pixels around edge boundary. Then, using the pixels along the line perpendicular to the estimated edge orientation the real boundary is calculated with subpixel accuracy. Experimental results using real images show that the proposed method is robust in local noise, while maintaining low measurement error.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.55-58
• /
• 2011

In this paper we introduce an improved method to measure saliency values of pixels from an image. The proposed saliency measure is formulated using local features of color and a statistical framework. In the preprocessing step, rough salient pixels are determined as the local contrast of an image region with respect to its neighborhood at various scales. Then, the saliency value of each pixel is calculated by Bayes' rule using rough salient pixels. The experiments show that our approach outperforms the current Bayes' rule based method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.823-825
• /
• 2005

컴퓨터 비전 연구에서의 주요 관심은 객체의 특징을 이용하여 객체를 분간하거나 또는 계수하는데 있어 왔다. 최근 대단위의 사람들이 운집하는 공공장소에서의 사고에 대비한 대책의 기준으로 혼잡도라는 점보의 중요성이 대두되고 있다. 본 실험에서는 객체들이 존재하는 전경(Foreground) 영역을 객체들이 없는 배경 영역(back ground)으로부터 분리한 후 전경 영역에서의 edge pixel 들의 수를 계수하여 혼잡도의 정도를 구한다. 전경 영역과 배경 영역은 소 영역별로 RGB에 대한 표준편차와 평균을 비교 분석해서 구분하고 배경 영역을 삭제한다. 전경 영역에서 edge detection 방법을 이용하여 환경에 알맞은 edge pixels수를 계수하고 pixels수와 혼잡도 사이의 관계를 구한다. 이러한 측정 방법의 장점은 다양한 환경에서도 혼잡도라는 기본 특징정보를 추출할 수 있다는 것이다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.601-607
• /
• 2018

Median filtering is a nonlinear method which is known to be effective in removing impulse noise while preserving local image structure relatively well. However, it could still suffer the smearing phenomena of edges and fine details into neighbors due to undesirable influence from the pixels whose values are far off from the true value of the pixel at hand. This drawback mainly comes from the fact that median filters typically employ a regular shape window for collecting the pixels used in the filtering operation. In this paper, we propose a median filtering method which employs an irregular shape filter window in collecting neighboring pixels around the pixel to be denoised. By employing an irregular shape window, we can achieve good noise suppression while preserving image details. Experimental results have shown that our approach is superior to regular window-based methods.