• Title/Summary/Keyword: pixel difference

Search Result 424, Processing Time 0.026 seconds

Covered Microlens Structure for Quad Color Filter Array of CMOS Image Sensor

  • Jae-Hyeok Hwang;Yunkyung Kim
    • Current Optics and Photonics
    • /
    • v.7 no.5
    • /
    • pp.485-495
    • /
    • 2023
  • The pixel size in high-resolution complementary metal-oxide-semiconductor (CMOS) image sensors continues to shrink due to chip size limitations. However, the pixel pitch's miniaturization causes deterioration of optical performance. As one solution, a quad color filter (CF) array with pixel binning has been developed to enhance sensitivity. For high sensitivity, the microlens structure also needs to be optimized as the CF arrays change. In this paper, the covered microlens, which consist of four microlenses covered by one large microlens, are proposed for the quad CF array in the backside illumination pixel structure. To evaluate the optical performance, the suggested microlens structure was simulated from 0.5 ㎛ to 1.0 ㎛ pixels at the center and edge of the sensors. Moreover, all pixel structures were compared with and without in-pixel deep trench isolation (DTI), which works to distribute incident light uniformly into each photodiode. The suggested structure was evaluated with an optical simulation using the finite-difference time-domain method for numerical analysis of the optical characteristics. Compared to the conventional microlens, the suggested microlens show 29.1% and 33.9% maximum enhancement of sensitivity at the center and edge of the sensor, respectively. Therefore, the covered microlens demonstrated the highly sensitive image sensor with a quad CF array.

An RGB to RGBY Color Conversion Algorithm for Liquid Crystal Display Using RGW Pixel with Two-Field Sequential Driving Method

  • Hong, Sung-Jin;Kwon, Oh-Kyong
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.6
    • /
    • pp.777-782
    • /
    • 2014
  • This paper proposes an RGB to RGBY color conversion algorithm for liquid crystal display (LCD) using RGW pixel structure with two-field (yellow and blue) sequential driving method. The proposed algorithm preserves the hue and saturation of the original color by maintaining the RGB ratio, and it increases the luminance. The performance of the proposed RGBY conversion algorithm is verified using the MATLAB simulation with 24 images of Kodak lossless true color image suite. The simulation results of average color difference CIEDE2000 (${\delta}E^*_{00}$) and scaling factor are 0.99 and 1.89, respectively. These results indicate that the average brightness is increased 1.89 times compared to LCD using conventional RGB pixel structure, without increasing the power consumption and degrading the image quality.

Signatures Verification by Using Nonlinear Quantization Histogram Based on Polar Coordinate of Multidimensional Adjacent Pixel Intensity Difference (다차원 인접화소 간 명암차의 극좌표 기반 비선형 양자화 히스토그램에 의한 서명인식)

  • Cho, Yong-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.5
    • /
    • pp.375-382
    • /
    • 2016
  • In this paper, we presents a signatures verification by using the nonlinear quantization histogram of polar coordinate based on multi-dimensional adjacent pixel intensity difference. The multi-dimensional adjacent pixel intensity difference is calculated from an intensity difference between a pair of pixels in a horizontal, vertical, diagonal, and opposite diagonal directions centering around the reference pixel. The polar coordinate is converted from the rectangular coordinate by making a pair of horizontal and vertical difference, and diagonal and opposite diagonal difference, respectively. The nonlinear quantization histogram is also calculated from nonuniformly quantizing the polar coordinate value by using the Lloyd algorithm, which is the recursive method. The polar coordinate histogram of 4-directional intensity difference is applied not only for more considering the corelation between pixels but also for reducing the calculation load by decreasing the number of histogram. The nonlinear quantization is also applied not only to still more reflect an attribute of intensity variations between pixels but also to obtain the low level histogram. The proposed method has been applied to verified 90(3 persons * 30 signatures/person) images of 256*256 pixels based on a matching measures of city-block, Euclidean, ordinal value, and normalized cross-correlation coefficient. The experimental results show that the proposed method has a superior to the linear quantization histogram, and Euclidean distance is also the optimal matching measure.

Robust Pupil Detection using Rank Order Filter and Pixel Difference (Rank Order Filter와 화소값 차이를 이용한 강인한 눈동자 검출)

  • Jang, Kyung-Shik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1383-1390
    • /
    • 2012
  • In this paper, we propose a robust pupil detection method using rank order filter and pixel value difference in facial image. We have detected the potential pupil candidates using rank order filter. Many false pupil candidates found at eyebrow are removed using the fact that the pixel difference is much at the boundary between pupil and sclera. The rest pupil candidates are grouped into pairs. Each pair is verified according to geometric constraints such as the angle and the distance between two candidates. A fitness function is obtained for each pair using the pixel values of two pupil regions, we select a pair with the smallest fitness value as a final pupil. The experiments have been performed for 400 images of the BioID face database. The results show that it achieves more than 90% accuracy, and especially the proposed method improves the detection rate and high accuracy for face with spectacle.

An Automatic Cut Detection Algorithm Using Median Filter And Neural Network (중간값 필터와 신경망 회로를 사용한 자동 컷 검출 알고리즘)

  • Jun, Seung-Chul;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.381-387
    • /
    • 2002
  • In this paper, an efficient method to find shot boundaries in the MPEG video stream data is proposed. For this purpose, we first assume that the histogram difference value(HDV) and pixel difference value(PDV) as an one dimensional signal and apply the median filter to these signals. The output of the median filter is subtracted from the original signal to produce the median filtered difference(MFD). The MFD is a criterion of shot boundary. In addition a neural network is employed and trained to find exactly cut boundary. The proposed algorithm shows that the cut boundaries are well extracted, especially in a dynamic video.

Motion Detection using Adaptive Background Image and A Net Model Pixel Space of Boundary Detection (적응적 배경영상과 그물형 픽셀 간격의 윤곽점 검출을 이용한 객체의 움직임 검출)

  • Lee Chang soo;Jun Moon seog
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3C
    • /
    • pp.92-101
    • /
    • 2005
  • It is difficult to detect the accurate detection which leads the camera it moves follows in change of the noise or illumination and Also, it could be recognized with backgound if the object doesn't move during hours. In this paper, the proposed method is updating changed background image as much as N*M pixel mask as time goes on after get a difference between imput image and first background image. And checking image pixel can efficiently detect moving by computing fixed distance pixel instead of operate all pixel. Also, set up minimum area of object to use boundary point of object abstracted through checking image pixel and motion detect of object. Therefore motion detection is available as is fast and correct without doing checking image pixel every Dame. From experiment, the designed and implemented system showed high precision ratio in performance assessment more than 90 percents.

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.

Watermarking Technique using Image Characteristics

  • Jung, Soo-Mok
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.187-193
    • /
    • 2021
  • In this paper, we propose an image watermarking technique that effectively hides confidential data in the LSB of image pixels by utilizing the characteristics of the image. In the proposed technique, the image is precisely divided into boundary surface and normal region other than the boundary surface and performs different processing. The boundary surface existing in the image is created by meeting different regions and contains important information of the image. One bit of confidential data is concealed in the LSB of the pixel at the boundary surface to preserve the characteristics of the boundary surface. In normal region other than the boundary surface, the pixel values are similar, and the change with the adjacent pixel values is smooth. Based on this property, even if the 2 bits of confidential data are hidden in the lower 2 bits of the pixel in the normal region, the difference cannot be visually distinguished. When confidential data is concealed in an image as described above, the amount of confidential data concealed in an image can be increased while maintaining excellent image quality. Concealing confidential data by applying the proposed method increases the amount of confidential data concealed by up to 84.6% compared to the existing method. The proposed technique can be effectively used for commercial image watermarking that hides copyright information.

An Improved Steganography Method Based on Least-Significant-Bit Substitution and Pixel-Value Differencing

  • Liu, Hsing-Han;Su, Pin-Chang;Hsu, Meng-Hua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.11
    • /
    • pp.4537-4556
    • /
    • 2020
  • This research was based on the study conducted by Khodaei et al. (2012), namely, the least-significant-bit (LSB) substitution combined with the pixel-value differencing (PVD) steganography, and presented an improved irreversible image steganography method. Such a method was developed through integrating the improved LSB substitution with the modulus function-based PVD steganography to increase steganographic capacity of the original technique while maintaining the quality of images. It partitions the cover image into non-overlapped blocks, each of which consists of 3 consecutive pixels. The 2nd pixel represents the base, in which secret data are embedded by using the 3-bit LSB substitution. Each of the other 2 pixels is paired with the base respectively for embedding secret data by using an improved modulus PVD method. The experiment results showed that the method can greatly increase steganographic capacity in comparison with other PVD-based techniques (by a maximum amount of 135%), on the premise that the quality of images is maintained. Last but not least, 2 security analyses, the pixel difference histogram (PDH) and the content-selective residual (CSR) steganalysis were performed. The results indicated that the method is capable of preventing the detection of the 2 common techniques.

A motion-adaptive de-interlacing method using an efficient spatial and temporal interpolation (효율적인 시공간 보간을 통한 움직임 기반의 디인터레이싱 기법)

  • Lee, Seong-Gyu;Lee, Dong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.5
    • /
    • pp.556-566
    • /
    • 2001
  • This paper proposes a motion-adaptive de-interlacing algorithm based on EBMF(Edge Based Median Filter) and AMPDF(Adaptive Minimum Pixel Difference Fillet). To compensate 'motion missing'error, which is an important factor in motion-adaptive methods, we used AMPDF which estimates an accurate value using different thresholds after classifying the input image to 4 classes. To efficiently interpolate the moving diagonal edge, we also used EBMF which selects a candidate pixel according to the edge information. Finally, we, to increase the performance, adopted an adaptive interpolation after classifying the input image to moving region, stationary region, and boundary region. Simulation results showed that the proposed method provides better performance than the existing methods.

  • PDF