• Title/Summary/Keyword: Pixel value

Search Result 701, Processing Time 0.03 seconds

An Efficient Pixel Value Prediction Algorithm using the Similarity and Edge Characteristics Existing in Neighboring Pixels Scanned in Inverse s-order (역 s-순으로 스캔된 주변 픽셀들에 존재하는 유사성과 에지 특성을 이용한 효율적인 픽셀 값 예측 기법)

  • Jung, Soo-Mok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.1
    • /
    • pp.95-99
    • /
    • 2018
  • In this paper, we propose an efficient pixel value prediction algorithm that can accurately predict pixel value using neighboring pixel values scanned in reverse s-order in the image. Generally, image has similarity with similar values between adjacent pixel values, and may have directional edge characteristics. In this paper, we proposed a method to improve pixel value prediction accuracy by improving GAP(Gradient Adjacent Pixel) algorithm for predicting pixel value by using similarity between adjacent pixels and edge characteristics. The proposed method increases the accuracy of the predicted pixel value by precisely predicting the pixel value using the positional weights of the neighboring pixels. Experiments on real images confirmed the superiority of the proposed algorithm. The proposed algorithm is useful for applications such as reversible data hiding, reversible watermarking, and data compression applications.

Advanced Pixel Value Prediction Algorithm using Edge Characteristics in Image

  • Jung, Soo-Mok
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.111-115
    • /
    • 2020
  • In this paper, I proposed an effective technique for accurately predicting pixel values using edge components. Adjacent pixel values are similar to each other. That is, generally, similarity exists between adjacent pixels in an image. In the proposed algorithm, edge components are detected using the surrounding pixels in the first step, and pixel values are estimated using the edge components in the second step. Therefore, the prediction accuracy of the pixel value is improved and the prediction error is reduced. Pixel value prediction is a necessary technique for various applications such as image magnification and confidential data concealment. Experimental results show that the proposed method has higher prediction accuracy and fewer prediction error. Therefore, the proposed technique can be effectively used for applications such as image magnification and confidential data concealment.

Pixel value prediction algorithm using three directional edge characteristics and similarity between neighboring pixels

  • Jung, Soo-Mok
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.61-64
    • /
    • 2018
  • In this paper, a pixel value prediction algorithm using edge components in three directions is proposed. There are various directional edges and similarity between adjacent pixels in natural images. After detecting the edge components in the x-axis direction, the y-axis direction, and the diagonal axis direction, the pixel value is predicted by applying the detected edge components and similarity between neighboring pixels. In particular, the predicted pixel value is calculated according to the intensity of the edge component in the diagonal axis direction. Experimental results show that the proposed algorithm can effectively predict pixel values. The proposed algorithm can be used for applications such as reversible data hiding, reversible watermarking to increase the number of embedded data.

A Fast Search Algorithm for Sub-Pixel Motion Estimation (부화소 움직임 추정을 위한 고속 탐색 기법)

  • Park, Dong-Kyun;Jo, Seong-Hyeon;Cho, Hyo-Moon;Lee, Jong-Hwa
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.26-28
    • /
    • 2007
  • The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

  • PDF

Detection of LSB Matching Revisited Using Pixel Difference Feature

  • Li, Wenxiang;Zhang, Tao;Zhu, Zhenhao;Zhang, Yan;Ping, Xin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.10
    • /
    • pp.2514-2526
    • /
    • 2013
  • This paper presents a detection method for least significant bit matching revisited (LSBMR) steganography. Previous research shows that the adjacent pixels of natural images are highly correlated and the value 0 appears most frequently in pixel difference. Considering that the message embedding process of LSBMR steganography has a weighted-smoothing effect on the distribution of pixel difference, the frequency of the occurrence of value 0 in pixel difference changes most significantly whereas other values approximately remain unchanged during message embedding. By analyzing the effect of LSBMR steganography on pixel difference distribution, an equation is deduced to estimate the frequency of difference value 0 using the frequencies of difference values 1 and 2. The sum of the ratio of the estimated value to the actual value as well as the ratio of the frequency of difference value 1 to difference value 0 is used as the steganalytic detector. Experimental results show that the proposed method can effectively detect LSBMR steganography and can outperform previous proposed methods.

A Method for Estimating Local Intelligibility for Adaptive Digital Image Decimation (적응형 디지털 영상 축소를 위한 국부 가해성 추정 기법)

  • 곽노윤
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.4 no.4
    • /
    • pp.391-397
    • /
    • 2003
  • This paper is about the digital image decimation algorithm which generates a value of decimated element by an average of a target pixel value and a value of neighbor intelligible element to adaptively reflect the merits of ZOD method and FOD method on the decimated image. First, a target pixel located at the center of sliding window is selected, then the gradient amplitudes of its right neighbor pixel and its lower neighbor pixel are calculated using first order derivative operator respectively. Secondly, each gradient amplitude is divided by the summation result of two gradient amplitudes to generate each intelligible weight. Next, a value of neighbor intelligible element is obtained by adding a value of the right neighbor pixel times its intelligible weight to a value of the lower neighbor pixel times its intelligible weight. The decimated image can be acquired by applying the process repetitively to all pixels in input image which generates the value of decimated element by calculating the average of the target pixel value and the value of neighbor intelligible element.

  • PDF

The Method to Estimate Saliency Values using Gauss Weight (가우스 가중치를 이용한 돌출 값 추정을 위한 방법)

  • Yu, Young-Jung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.4
    • /
    • pp.965-970
    • /
    • 2013
  • It is important work to extract saliency regions from an image as preprocessing for various image processing methods. In this paper, we introduce an improved method to estimate saliency value of each pixel from an image. The proposed method is an improved work of the previously studied method using color and statistical framework to estimate saliency values. At first, saliency value of each pixel is calculated using the local contrast of an image region at various scales and the most significant saliency pixel is determined using saliency value of each pixel. Then, saliency value of each pixel is again estimated using gauss weight with respect to the most significant saliency pixel and the saliency of each pixel is determined to calculate initial probability. At last, the saliency value of each pixel is calculated by Bayes' rule. The experiments show that our approach outperforms the current statistical based method.

Automatic Determination of Matching Window Size Using Histogram of Gradient (그레디언트 히스토그램을 이용한 정합 창틀 크기의 자동적인 결정)

  • Ye, Chul-Soo;Moon, Chang-Gi
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.2
    • /
    • pp.113-117
    • /
    • 2007
  • In this paper, we propose a new method for determining automatically the size of the matching window using histogram of the gradient in order to improve the performance of stereo matching using one-meter resolution satellite imagery. For each pixel, we generate Flatness Index Image by calculating the mean value of the vertical or horizontal intensity gradients of the 4-neighbors of every pixel in the entire image. The edge pixel has high flatness index value, while the non-edge pixel has low flatness index value. By using the histogram of the Flatness Index Image, we find a flatness threshold value to determine whether a pixel is edge pixel or non-edge pixel. If a pixel has higher flatness index value than the flatness threshold value, we classify the pixel into edge pixel, otherwise we classify the pixel into non-edge pixel. If the ratio of the number of non-edge pixels in initial matching window is low, then we consider the pixel to be in homogeneous region and enlarge the size of the matching window We repeat this process until the size of matching window reaches to a maximum size. In the experiment, we used IKONOS satellite stereo imagery and obtained more improved matching results than the matching method using fixed matching window size.

An Advanced Watermarking Algorithm with Reversibility (개선된 가역 워터마킹 알고리즘)

  • Jung, Soo-Mok
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.2
    • /
    • pp.151-156
    • /
    • 2018
  • In this paper, an efficient reversible watermarking algorithm is proposed. By using the proposed algorithm, it is possible to increase the amount of copyright-related information to be embedded in cover image. Depending on the spatial locality and surface characteristics, it is possible to precisely predict the pixel value using neighboring pixels. If the predicted pixel value almost the same as the pixel value of the cover image, the differential value between the predicted pixel value and the pixel value of cover image is very small. So, the frequency is increased greatly at the peak point of histogram of difference sequence. Thus, it is possible to increase greatly the amount of secret data to be embedded in cover image. The experimental results show that the proposed watermarking algorithm is superior to the previous algorithms.

Realtime Face Animation using High-Speed Texture Mapping Algorithm (고속 텍스처 매핑 알고리즘을 이용한 실시간 얼굴 애니메이션)

  • 최창석;김지성;최운영;전준현
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.544-547
    • /
    • 1999
  • This paper proposes a high-speed texture mapping algorithm and apply it for the realtime face animation. The mapping process devide into pixel correspondences, Z-buffering, and pixel value interpolation. Pixel correspondences and Z-buffering are calculated exactly through the algorithm. However, pixel values interpolation is approximated without additional calculations. The algorithm dramatically reduces the operations needed for texture mapping. Only three additions are needed in calculation of a pixel value. We simulate the 256$\times$240 pixel facial image with about 100 pixel face width. Simulation results shows that frame generation speed are about 60, 44, 21 frames/second in pentium PC 550MHz, 400MHz, 200MHz, respectively,

  • PDF