• Title/Summary/Keyword: Pixels

Search Result 2,460, Processing Time 0.028 seconds

Angle-sensitive Pixels Based on Subwavelength Compound Gratings

  • Meng, Yunlong;Hu, Xuemei;Yang, Cheng;Shen, Xinyu;Cao, Xueyun;Lin, Lankun;Yan, Feng;Yue, Tao
    • Current Optics and Photonics
    • /
    • v.6 no.4
    • /
    • pp.359-366
    • /
    • 2022
  • In this paper, we present a new design for angle-sensitive pixels (ASPs). The proposed ASPs take advantage of subwavelength compound gratings to capture the light angle, which enables pixel size to reach the wavelength scale of 0.7 ㎛ × 0.7 ㎛. The subwavelength compound gratings are implemented by the wires of the readout circuit inherent to the standard complementary metal-oxide-semiconductor manufacturing process, thus avoiding additional off-chip optics or post-processing. This technique allows the use of two pixels for horizontal or vertical angle detection, and can determine the light's angle in the range from -45° to +45°. The proposed sensor enables surface-profile reconstruction of microscale samples using a lensless imaging system.

Reversible Data Hiding Algorithm Based on Pixel Value Ordering and Edge Detection Mechanism

  • Nguyen, Thai-Son;Tram, Hoang-Nam;Vo, Phuoc-Hung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.10
    • /
    • pp.3406-3418
    • /
    • 2022
  • Reversible data hiding is an algorithm that has ability to extract the secret data and to restore the marked image to its original version after data extracting. However, some previous schemes offered the low image quality of marked images. To solve this shortcoming, a new reversible data hiding scheme based on pixel value ordering and edge detection mechanism is proposed. In our proposed scheme, the edge image is constructed to divide all pixels into the smooth regions and rough regions. Then, the pixels in the smooth regions are separated into non overlapping blocks. Then, by taking advantages of the high correlation of current pixels and their adjacent pixels in the smooth regions, PVO algorithm is applied for embedding secret data to maintain the minimum distortion. The experimental results showed that our proposed scheme obtained the larger embedding capacity. Moreover, the greater image quality of marked images are achieved by the proposed scheme than that other previous schemes while the high EC is embedded.

Extraction of Changed Pixels for Hyperion Hyperspectral Images Using Range Average Based Buffer Zone Concept (구간평균 그래프 기반의 버퍼존 개념을 적용한 Hyperion 초분광영상의 변화화소 추출)

  • Kim, Dae-Sung;Pyen, Mu-Wook
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.29 no.5
    • /
    • pp.487-496
    • /
    • 2011
  • This study is aimed to perform more reliable unsupervised change detection through the re-extraction of the changed pixels which were extracted with global thresholding by applying buffer zone concept. First, three buffer zone was divided on the basis of the thresholding value which was determined using range average and the maximum distance point from a straight line. We re-extracted the changed pixels by performing unsupervised classification for buffer zone II which consists of changed pixels and unchanged pixels. The proposed method was implemented in Hyperion hyperspectral images and evaluated comparing to the existing global thresholding method. The experimental results demonstrated that the proposed method performed more accuracy change detection for vegetation area even if extracted slightly more changed pixels.

Object Tracking for Elimination using LOD Edge Maps Generated from Canny Edge Maps (캐니 에지 맵을 LOD로 변환한 맵을 이용하여 객체 소거를 위한 추적)

  • Jang, Young-Dae;Park, Ji-Hun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.333-336
    • /
    • 2007
  • We propose a simple method for tracking a nonparameterized subject contour in a single video stream with a moving camera and changing background. Then we present a method to eliminate the tracked contour object by replacing with the background scene we get from other frame. Our method consists of two parts: first we track the object using LOD (Level-of-Detail) canny edge maps, then we generate background of each image frame and replace the tracked object in a scene by a background image from other frame that is not occluded by the tracked object. Our tracking method is based on level-of-detail (LOD) modified Canny edge maps and graph-based routing operations on the LOD maps. To reduce side-effects because of irrelevant edges, we start our basic tracking by using strong Canny edges generated from large image intensity gradients of an input image. We get more edge pixels along LOD hierarchy. LOD Canny edge pixels become nodes in routing, and LOD values of adjacent edge pixels determine routing costs between the nodes. We find the best route to follow Canny edge pixels favoring stronger Canny edge pixels. Our accurate tracking is based on reducing effects from irrelevant edges by selecting the stronger edge pixels, thereby relying on the current frame edge pixel as much as possible. This approach is based on computing camera motion. Our experimental results show that our method works nice for moderate camera movement with small object shape changes.

  • PDF

Illumination estimation based on valid pixel selection from CCD camera response (CCD카메라 응답으로부터 유효 화소 선택에 기반한 광원 추정)

  • 권오설;조양호;김윤태;송근호;하영호
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.5
    • /
    • pp.251-258
    • /
    • 2004
  • This paper proposes a method for estimating the illuminant chromaticity using the distributions of the camera responses obtained by a CCD camera in a real-world scene. Illuminant estimation using a highlight method is based on the geometric relation between a body and its surface reflection. In general, the pixels in a highlight region are affected by an illuminant geometric difference, camera quantization errors, and the non-uniformity of the CCD sensor. As such, this leads to inaccurate results if an illuminant is estimated using the pixels of a CCD camera without any preprocessing. Accordingly, to solve this problem the proposed method analyzes the distribution of the CCD camera responses and selects pixels using the Mahalanobis distance in highlight regions. The use of the Mahalanobis distance based on the camera responses enables the adaptive selection of valid pixels among the pixels distributed in the highlight regions. Lines are then determined based on the selected pixels with r-g chromaticity coordinates using a principal component analysis(PCA). Thereafter, the illuminant chromaticity is estimated based on the intersection points of the lines. Experimental results using the proposed method demonstrated a reduced estimation error compared with the conventional method.

Super-Pixels Generation based on Fuzzy Similarity (퍼지 유사성 기반 슈퍼-픽셀 생성)

  • Kim, Yong-Gil;Moon, Kyung-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.147-157
    • /
    • 2017
  • In recent years, Super-pixels have become very popular for use in computer vision applications. Super-pixel algorithm transforms pixels into perceptually feasible regions to reduce stiff features of grid pixel. In particular, super-pixels are useful to depth estimation, skeleton works, body labeling, and feature localization, etc. But, it is not easy to generate a good super-pixel partition for doing these tasks. Especially, super-pixels do not satisfy more meaningful features in view of the gestalt aspects such as non-sum, continuation, closure, perceptual constancy. In this paper, we suggest an advanced algorithm which combines simple linear iterative clustering with fuzzy clustering concepts. Simple linear iterative clustering technique has high adherence to image boundaries, speed, memory efficient than conventional methods. But, it does not suggest good compact and regular property to the super-pixel shapes in context of gestalt aspects. Fuzzy similarity measures provide a reasonable graph in view of bounded size and few neighbors. Thus, more compact and regular pixels are obtained, and can extract locally relevant features. Simulation shows that fuzzy similarity based super-pixel building represents natural features as the manner in which humans decompose images.

Improved Euclidean transform method using Voronoi diagram (보로노이 다이어그램에 기반한 개선된 유클리디언 거리 변환 방법)

  • Jang Seok Hwan;Park Yong Sup;Kim Whoi Yul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12C
    • /
    • pp.1686-1691
    • /
    • 2004
  • In this paper, we present an improved method to calculate Euclidean distance transform based on Guan's method. Compared to the conventional method, Euclidean distance can be computed faster using Guan's method when the number of feature pixels is small; however, overall computational cost increases proportional to the number of feature pixels in an image. To overcome this problem, we divide feature pixels into two groups: boundary feature pixels (BFPs) and non-boundary feature pixels (NFPs). Here BFPs are defined as those in the 4-neighborhood of foreground pixels. Then, only BFPs are used to calculate the Voronoi diagram resulting in a Euclidean distance map. Experimental results indicate that the proposed method takes 40 Percent less computing time on average than Guan's method. To prove the performance of the proposed method, the computing time of Euclidean distance map by proposed method is compared with the computing time of Guan's method in 16 images that are binary and the size of 512${\times}$512.

Intra Prediction Method by Quadric Surface Modeling for Depth Video (깊이 영상의 이차 곡면 모델링을 통한 화면 내 예측 방법)

  • Lee, Dong-seok;Kwon, Soon-kak
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.2
    • /
    • pp.35-44
    • /
    • 2022
  • In this paper, we propose an intra-picture prediction method by a quadratic surface modeling method for depth video coding. The pixels of depth video are transformed to 3D coordinates using distance information. A quadratic surface with the smallest error is found by least square method for reference pixels. The reference pixel can be either the upper pixels or the left pixels. In the intra prediction using the quadratic surface, two predcition values are computed for one pixel. Two errors are computed as the square sums of differences between each prediction values and the pixel values of the reference pixels. The pixel sof the block are predicted by the reference pixels and prediction method that they have the lowest error. Comparing with the-state-of-art video coding method, simulation results show that the distortion and the bit rate are improved by up to 5.16% and 5.12%, respectively.

Intensity Based Stereo Matching Algorithm Including Boundary Information (경계선 영역 정보를 이용한 밝기값 기반 스테레오 정합)

  • Choi, Dong-Jun;Kim, Do-Hyun;Yang, Yeong-Yil
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.84-92
    • /
    • 1998
  • In this paper, we propose the novel cost functions for finding the disparity between the left and the right images in the stereo matching problem. The dynamic programming method is used in solving the stereo matching problem by Cox et al[10]. In the reference[10], only the intensity of the pixels in the epipolar line is used as the cost functions to find the corresponding pixels. We propose the two new cost functions. The information of the slope of the pixel is introduced to the constraints in determining the weights of intensity and direction(the historical information). The pixels with the higher slope are matched mainly by the intensity of pixels. As the slope becomes lower, the matching is performed mainly by the direction. Secondly, the disparity information of the previous epipolar line the pixel is used to find the disparity of the current epipolar line. If the pixel in the left epipolar line, $p-i$ and the pixel in the right epipolar line, $p-j$ satisfy the following conditions, the higher matching probability is given to the pixels, $p-i$ and $p-j$. i) The pixels, $p-i$ and $p-j$ are the pixles on the edges in the left and the right images, respectively. ⅱ) For the pixels $p-k$ and $p-l$ in the previous epipolar line, $p-k$and $p-l$ are matched and are the pixels on the same edge with $p-i$ and $p-j$, respectively. The proposed method compared with the original method[10] finds the better matching results for the test images.

  • PDF

A Study on Maximizing the Matching Ratio of Scintillation Pixels and Photosensors of PET Detector using a Small Number of Photosensors (적은 수의 광센서를 사용한 PET 검출기의 섬광 픽셀과 광센서 매칭 비율의 최대화 연구)

  • Lee, Seung-Jae;Baek, Cheol-Ha
    • Journal of the Korean Society of Radiology
    • /
    • v.15 no.5
    • /
    • pp.749-754
    • /
    • 2021
  • In order to maximize the matching ratio between the scintillation pixel and the photosensor of the PET detector using a small number of photosensor, various arrays of scintillation pixels and four photosensors were used. The array of scintillation pixels consisted of six cases from 6 × 6 to 11 × 11. The distance between the photosensors was applied equally to all scintillation pixels, and the arrangement was expanded by reducing the size of scintillation pixel. DETECT2000 capable of light simulation was used to acquire flood images of the designed PET detectors. At the center of each scintillation pixel array, light generated through the interaction between extinction radiation and scintillation pixels was generated, and the light was detected through for four photosensors, and then a flood image was reconstructed. Through the reconstructed flood image, we found the largest arrangement in which all the scintillation pixels can be distinguished. As a result, it was possible to distinguish all the scintillation pixels in the flood image of 8 × 8 scintillation pixel array, and from the 9 × 9 scintillation pixel flood image, the two edge scintillation pixels overlapped and appeared in the image. At this time, the matching ratio between the scintillation pixel and the photosensor was 16:1. When a PET system is constructed using this detector, the number of photosensors used is reduced and the cost of the oveall system is expected to be reduced through the simplification of the signal processing circuit.