• Title/Summary/Keyword: neighboring pixels

Search Result 152, Processing Time 0.024 seconds

A de-noising method based on connectivity strength between two adjacent pixels

  • Ye, Chul-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.1
    • /
    • pp.21-28
    • /
    • 2015
  • The essential idea of de-noising is referring to neighboring pixels of a center pixel to be updated. Conventional adaptive de-noising filters use local statistics, i.e., mean and variance, of neighboring pixels including the center pixel. The drawback of adaptive de-noising filters is that their performance becomes low when edges are contained in neighboring pixels, while anisotropic diffusion de-noising filters remove adaptively noises and preserve edges considering intensity difference between neighboring pixel and the center pixel. The anisotropic diffusion de-noising filters, however, use only intensity difference between neighboring pixels and the center pixel, i.e., local statistics of neighboring pixels and the center pixel are not considered. We propose a new connectivity function of two adjacent pixels using statistics of neighboring pixels and apply connectivity function to diffusion coefficient. Experimental results using an aerial image corrupted by uniform and Gaussian noises showed that the proposed algorithm removed more efficiently noises than conventional diffusion filter and median filter.

Novel deinterlacing algorithm using neighboring interlaced pixels directions statistics

  • Wang, An;Chen, Xiangdong;Yang, Yang;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.204-208
    • /
    • 2011
  • This paper proposes a novel deinterlacing algorithm using neighboring deinterlacing pixels directions weight, which can obtain the true deinterlacing direction of the interpolated pixel. The proposed algorithm determines the direction of the current interpolated pixel using MELA direction determination method. To obtain more accurate deinterlacing direction and increase interpolation direction correlation, the directions of neighboring pixels around the current interpolated pixel are considered. The current direction and the neighboring majority direction are compared to decide an interpolated method. But it cost slightly CPU time increasing since neighboring pixels directions determination and statistics. Experimental results demonstrate that the proposed algorithm outperforms the conventional deinterlacing methods.

  • PDF

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.

Speckle Noise Removal by Rank-ordered Differences Diffusion Filter (순위 차 확산 필터를 이용한 스페클 잡음 제거)

  • Ye, Chul-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.25 no.1
    • /
    • pp.21-30
    • /
    • 2009
  • The purposes of this paper are to present a selection method of neighboring pixels whose local statistics are similar to the center pixel and combine the selection result with mean curvature diffusion filter to reduce noises in remote sensed imagery. The order of selection of neighboring pixels is critical, especially for finding a pixel belonging to the homogeneous region, since the statistics of the homogeneous region vary according to the selection order. An effective strategy for selecting neighboring pixels, which uses rank-order differences vector obtained by computing the intensity differences between the center pixel and neighboring pixels and arranging them in ascending order, is proposed in this paper. By using region growing method, we divide the elements of the rank-ordered differences vector into two groups, homogeneous rank-ordered differences vector and outlier rank-ordered differences vector. The mean curvature diffusion filter is combined with a line process, which chooses selectively diffusion coefficient of the neighboring pixels belonging into homogeneous rank-ordered differences vector. Experimental results using an aerial image and a TerraSAR-X satellite image showed that the proposed method reduced more efficiently noises than some conventional adaptive filters using all neighboring pixels in updating the center pixel.

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.

An advanced reversible data hiding algorithm based on the similarity between neighboring pixels

  • Jung, Soo-Mok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.2
    • /
    • pp.33-42
    • /
    • 2016
  • In this paper, an advanced reversible data hiding algorithm which takes the advantage of the spatial locality in image was proposed. Natural image has a spatial locality. The pixel value of a natural image is similar to the values of neighboring pixels. So, using the neighboring pixel values, it is possible to precisely predict the pixel value. Frequency increases significantly at the peak point of the difference histogram using the predicted values. Therefore, it is possible to increase the amount of data to be embedded. By using the proposed algorithm, visually high quality stego-image can be generated, the original cover image and the embedded data can be extracted from the stego-image without distortion. The embedding data into the cover image of the proposed algorithm is much lager than that of the previous algorithm. The performance of the proposed algorithm was verified by experiment. The proposed algorithm is very useful for the reversible data hiding.

Rotation Invariant Histogram of Oriented Gradients

  • Cheon, Min-Kyu;Lee, Won-Ju;Hyun, Chang-Ho;Park, Mignon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.4
    • /
    • pp.293-298
    • /
    • 2011
  • In this paper, we propose a new image descriptor, that is, a rotation invariant histogram of oriented gradients (RIHOG). RIHOG overcomes a disadvantage of the histogram of oriented gradients (HOG), which is very sensitive to image rotation. The HOG only uses magnitude values of a pixel without considering neighboring pixels. The RIHOG uses the accumulated relative magnitude values of corresponding relative orientation calculated with neighboring pixels, which has an effect on reducing the sensitivity to image rotation. The performance of RIHOG is verified via the index of classification and classification of Brodatz texture data.

A Stereo Matching by the Iterative Relaxation Using the Consensus of Matching Possibility (정합 일치성을 이용한 반복 이완 스테레오 정합)

  • 이왕국;김용석;도경훈;하영호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.1
    • /
    • pp.39-49
    • /
    • 1995
  • Stereo vision is useful to obtain three dimensional depth information from two images taken from different view points. In this paper, we reduce searching area for correspondence by using the intra-scanline constraint, and utilize the inter-scanline constraint and the property of disparity continuity among the neighboring pixels for relaxation. Nodes with 3-D stucture are located on the axes of two views, and have matching possibility of correspondent pixels of two images. A matching is accepted if a node at the intersection of the disparity axes has the greatest matching possibility. Otherwise, the matching possibility of the node is updated by relaxation with the cooperation of neighboring nodes. Further relaxation with competition of two views is applied to a matching possibility of randomly selected node. The consensus of two views increases the confidence of matching, and removes a blurring phenomenon on the discontinuity of object. This approach has been tested with various types of image such as random dot stereogram and aerial image, and the experimental results show good matching performance.

  • PDF

Contextual Modeling and Generation of Texture Observed in Single and Multi-channel Images

  • Jung, Myung-Hee
    • Korean Journal of Remote Sensing
    • /
    • v.17 no.4
    • /
    • pp.335-344
    • /
    • 2001
  • Texture is extensively studied in a variety of image processing applications such as image segmentation and classification because it is an important property to perceive regions and surfaces. This paper focused on the analysis and synthesis of textured single and multiband images using Markov Random Field model considering the existent spatial correlation. Especially, for multiband images, the cross-channel correlation existing between bands as well as the spatial correlation within band should be considered in the model. Although a local interaction is assumed between the specified neighboring pixels in MRF models, during the maximization process, short-term correlations among neighboring pixels develop into long-term correlations. This result in exhibiting phase transition. In this research, the role of temperature to obtain the most probable state during the sampling procedure in discrete Markov Random Fields and the stopping rule were also studied.

New Fluctuation Functions to Measure Spatial Correlation of Encrypted Images in Reversible Data Hiding (가역적 데이터 은닉에서 암호화된 이미지의 공간 상관관계를 측정하기 위한 새로운 섭동 함수 연구)

  • Khanam, Fatema-Tuz-Zohra;Kim, Sunghwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.331-337
    • /
    • 2017
  • In this work, we propose an improved form of Zhang's reversible data hiding technique in encrypted image. In the original work, average value of neighboring pixels is used for fluctuation calculation which fails to give good performance. In proposed scheme, to reduce the bit error rate a new function is calculated by summing difference from four neighboring pixels for measuring fluctuation. Moreover, modified calculation of fluctuation function is also proposed where border pixels are considered. The simulation results show that the performance of proposed method outperforms Zhang's and Hong's work. From the results, more information can be sent by using proposed system