• Title/Summary/Keyword: image pyramid structure

Search Result 53, Processing Time 0.024 seconds

Efficient Red-Color Emission of InGaN/GaN Double Hetero-Structure Formed on Nano-Pyramid Structure

  • Go, Yeong-Ho;Kim, Je-Hyeong;Gong, Su-Hyeon;Kim, Ju-Seong;Kim, Taek;Jo, Yong-Hun
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2012.08a
    • /
    • pp.174-175
    • /
    • 2012
  • (In, Ga) N-based III-nitride semiconductor materials have been viewed as the most promising materials for the applications of blue and green light emitting devices such as light-emitting diodes (LEDs) and laser diodes. Although the InGaN alloy can have wide range of visible wavelength by changing the In composition, it is very hard to grow high quality epilayers of In-rich InGaN because of the thermal instability as well as the large lattice and thermal mismatches. In order to avoid phase separation of InGaN, various kinds of structures of InGaN have been studied. If high-quality In-rich InGaN/GaN multiple quantum well (MQW) structures are available, it is expected to achieve highly efficient phosphor-free white LEDs. In this study, we proposed a novel InGaN double hetero-structure grown on GaN nano-pyramids to generate broad-band red-color emission with high quantum efficiency. In this work, we systematically studied the optical properties of the InGaN pyramid structures. The nano-sized hexagonal pyramid structures were grown on the n-type GaN template by metalorganic chemical vapor deposition. SiNx mask was formed on the n-type GaN template with uniformly patterned circle pattern by laser holography. GaN pyramid structures were selectively grown on the opening area of mask by lateral over-growth followed by growth of InGaN/GaN double hetero-structure. The bird's eye-view scanning electron microscope (SEM) image shows that uniform hexagonal pyramid structures are well arranged. We showed that the pyramid structures have high crystal quality and the thickness of InGaN is varied along the height of pyramids via transmission electron microscope. Because the InGaN/GaN double hetero-structure was grown on the nano-pyramid GaN and on the planar GaN, simultaneously, we investigated the comparative study of the optical properties. Photoluminescence (PL) spectra of nano-pyramid sample and planar sample measured at 10 K. Although the growth condition were exactly the same for two samples, the nano-pyramid sample have much lower energy emission centered at 615 nm, compared to 438 nm for planar sample. Moreover, nano-pyramid sample shows broad-band spectrum, which is originate from structural properties of nano-pyramid structure. To study thermal activation energy and potential fluctuation, we measured PL with changing temperature from 10 K to 300 K. We also measured PL with changing the excitation power from 48 ${\mu}W$ to 48 mW. We can discriminate the origin of the broad-band spectra from the defect-related yellow luminescence of GaN by carrying out PL excitation experiments. The nano-pyramid structure provided highly efficient broad-band red-color emission for the future applications of phosphor-free white LEDs.

  • PDF

Edge Adaptive Hierarchical Interpolation for Lossless and Progressive Image Transmission

  • Biadgie, Yenewondim;Wee, Young-Chul;Choi, Jung-Ju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.2068-2086
    • /
    • 2011
  • Based on the quincunx sub-sampling grid, the New Interleaved Hierarchical INTerpolation (NIHINT) method is recognized as a superior pyramid data structure for the lossless and progressive coding of natural images. In this paper, we propose a new image interpolation algorithm, Edge Adaptive Hierarchical INTerpolation (EAHINT), for a further reduction in the entropy of interpolation errors. We compute the local variance of the causal context to model the strength of a local edge around a target pixel and then apply three statistical decision rules to classify the local edge into a strong edge, a weak edge, or a medium edge. According to these local edge types, we apply an interpolation method to the target pixel using a one-directional interpolator for a strong edge, a multi-directional adaptive weighting interpolator for a medium edge, or a non-directional static weighting linear interpolator for a weak edge. Experimental results show that the proposed algorithm achieves a better compression bit rate than the NIHINT method for lossless image coding. It is shown that the compression bit rate is much better for images that are rich in directional edges and textures. Our algorithm also shows better rate-distortion performance and visual quality for progressive image transmission.

An Image Compression Method using Zerotree (Zerotree를 이용한 영상 압축 방법)

  • 최준영;호요성
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.851-854
    • /
    • 1998
  • Recently efficient image coding algorithms using zerotree have been proposed. In these methods, the locations of nonzero wavelet coefficients are encoded with a tree structure, called zerotree, which can exploit the self-similarity of the wavelet pyramid decomposition across different scales. These are very effective, especially in low bit rate image coding. In this paper, two zerotree image coding algorithms, EZW and SPIHT, are briefly introduced, and a new zerotree searching scheme is proposed to emphasize the significance of a wavelet coefficient by its orientations as well as its scale.

  • PDF

Zerotree Quantized Image Coding using Wavelet (웨이브렛을 이용한 제로트리 양자화 이미지 코딩기법 연구)

  • 이양원
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.211-214
    • /
    • 2002
  • Recently efficient image coding using zerotree have been proposed. In these methods, the locations of nonzero wavelet coefficient are enrolled with a tree structure, called zerotree, which ran exploit the self-similarity of the wavelet pyramid decomposition across different scales. These are very especially in low bit rate image coding. In this paper, two zerotree image rolling algorithm, EZW and SPHIT are briefly introduced, and a new zerotree searching scheme is proposed to emphasize the significance of a wavelet coefficient by its orientation as well as its scale.

  • PDF

Wavelet Image Coding with Optimized Zerotree Quantization (최적화된 제로트리 양자화를 이용한 웨이브렛 패킷 이미지 코딩)

  • 이양원
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.12a
    • /
    • pp.161-164
    • /
    • 2000
  • Recently efficient image coding using zerotree have been proposed. In these methods, the locations of nonzero wavelet coefficient are encoded with a tree structure, called zerotree, which can exploit the self-similarity of the wavelet pyramid decomposition across different scales. These are very especially in low bit rate image coding. In this paper, two zerotree image coding algorithm, EZW and SPHIT are briefly introduced, and a new zerotree searching scheme is proposed to emphasize the significance of a wavelet coefficient by its orientation as well as its scale.

  • PDF

A Pyramid Data Structure for Progressive Lossless Image Transmission (무손실 점진적 영상 전송을 위한 피라미드 데이터 구조에 관한 연구)

  • 안재훈;정호열;최태영
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.6
    • /
    • pp.49-58
    • /
    • 1993
  • Extended reduced difference pyramid (ERDP) is proposed for lossless progressive image transmission, which is based on a new transform called rounded-transform(RT). The RT is a nonlinear and reversible transform of integers into integers utilizing two kinds of the rounding operations such as round up and down. The ERDP can be obtained from an N-poing RT or a series of RTs of both. For the performance evaluation, the entropy of the difference images to be transmitted is used as a lower bound transmission rate. Two examples of the ERDP can be easily shown, which is more effective in the entropy than the ordinary RDP.

  • PDF

An Improved PeleeNet Algorithm with Feature Pyramid Networks for Image Detection

  • Yangfan, Bai;Joe, Inwhee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.05a
    • /
    • pp.398-400
    • /
    • 2019
  • Faced with the increasing demand for image recognition on mobile devices, how to run convolutional neural network (CNN) models on mobile devices with limited computing power and limited storage resources encourages people to study efficient model design. In recent years, many effective architectures have been proposed, such as mobilenet_v1, mobilenet_v2 and PeleeNet. However, in the process of feature selection, all these models neglect some information of shallow features, which reduces the capture of shallow feature location and semantics. In this study, we propose an effective framework based on Feature Pyramid Networks to improve the recognition accuracy of deep and shallow images while guaranteeing the recognition speed of PeleeNet structured images. Compared with PeleeNet, the accuracy of structure recognition on CIFA-10 data set increased by 4.0%.

Assembly performance evaluation method for prefabricated steel structures using deep learning and k-nearest neighbors

  • Hyuntae Bang;Byeongjun Yu;Haemin Jeon
    • Smart Structures and Systems
    • /
    • v.32 no.2
    • /
    • pp.111-121
    • /
    • 2023
  • This study proposes an automated assembly performance evaluation method for prefabricated steel structures (PSSs) using machine learning methods. Assembly component images were segmented using a modified version of the receptive field pyramid. By factorizing channel modulation and the receptive field exploration layers of the convolution pyramid, highly accurate segmentation results were obtained. After completing segmentation, the positions of the bolt holes were calculated using various image processing techniques, such as fuzzy-based edge detection, Hough's line detection, and image perspective transformation. By calculating the distance ratio between bolt holes, the assembly performance of the PSS was estimated using the k-nearest neighbors (kNN) algorithm. The effectiveness of the proposed framework was validated using a 3D PSS printing model and a field test. The results indicated that this approach could recognize assembly components with an intersection over union (IoU) of 95% and evaluate assembly performance with an error of less than 5%.

3-DIMENSIONAL TILING TECHNIQUE TO PROCESS HUGE SIZE HIGH RESOLUTION SATELLITE IMAGE SEAMLESSLY AND RAPIDLY

  • Jung, Chan-Gyu;Kim, Jun-Chul;Hwang, Hyun-Deok
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.85-89
    • /
    • 2007
  • This paper presents the method to provide a fast service for user in image manipulation such as zooming and panning of huge size high resolution satellite image (e.g. Giga bytes per scene). The proposed technique is based on the hierarchical structure that has 3D-Tiling in horizontal and vertical direction to provide the image service more effectively than 2D-Tiling technique in the past does. The essence of the proposed technique is to create tiles that have optimum level of horizontal as well as vertical direction on the basis of current displaying area which changes as user manipulates huge image. So this technique provides seamless service, and will be very powerful and useful for manipulation of images of huge size without data conversion.

  • PDF

3-Dimensional Tiling Technique to Process Huge Size High Resolution Satellite Image Seamlessly and Rapidly

  • Kim, Jun-Chul;Jung, Chan-Gyu;Kim, Moon-Gyu
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.5
    • /
    • pp.375-383
    • /
    • 2007
  • This paper presents the method to provide a fast service for user in image manipulation such as zooming and panning of huge size high resolution satellite image(e.g. Giga bytes per scene). The proposed technique is based on the hierarchical structure that has 3D-Tiling in horizontal and vertical direction to provide the image service more effectively than 2D-Tiling technique in the past does. The essence of the proposed technique is to create tiles of optimum level in real time on the basis of current displaying area, which change as user manipulates huge image. Consequently, this technique provides seamless service, and will be very powerful and useful for manipulation of images of huge size without data conversion.