• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.42-50
• /
• 2017

A Bit-depth expansion is a method to increase the number of bit. It is getting important as the needs of HDR (High Dynamic Range) display or resolution of display have been increased because the level of luminance or expressiveness of color is proportional to the number of bit in the display. In this paper, we present effective bit-depth expansion algorithm for conventional standard 8 bit-depth content to display in high bit-depth device (10 bits). Proposed method shows better result comparing with recently developed methods in quantitative (PSNR) with low complexity. The proposed method shows 1db higher in PSNR measurement with 40 times faster in computational time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2175-2190
• /
• 2011

This paper presents the effects of depth map quantization for multiview intermediate image generation using depth image-based rendering (DIBR). DIBR synthesizes multiple virtual views of a 3D scene from a 2D image and its associated depth map. However, it needs precise depth information in order to generate reliable and accurate intermediate view images for use in multiview 3D display systems. Previous work has extensively studied the pre-processing of the depth map, but little is known about depth map quantization. In this paper, we conduct an experiment to estimate the depth map quantization that affords acceptable image quality to generate DIBR-based multiview intermediate images. The experiment uses computer-generated 3D scenes, in which the multiview images captured directly from the scene are compared to the multiview intermediate images constructed by DIBR with a number of quantized depth maps. The results showed that there was no significant effect on depth map quantization from 16-bit to 7-bit (and more specifically 96-scale) on DIBR. Hence, a depth map above 7-bit is needed to maintain sufficient image quality for a DIBR-based multiview 3D system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.132-148
• /
• 2013

Via the Internet, the information infrastructure of modern health care has already established medical information systems to share electronic health records among patients and health care providers. Data hiding plays an important role to protect medical images. Because modern medical devices have improved, high resolutions of medical images are provided to detect early diseases. The high quality medical images are used to recognize complicated anatomical structures such as soft tissues, muscles, and internal organs to support diagnosis of diseases. For instance, 16-bit depth medical images will provide 65,536 discrete levels to show more details of anatomical structures. In general, the feature of low utilization rate of intensity in 16-bit depth will be utilized to handle overflow/underflow problem. Nowadays, most of data hiding algorithms are still experimenting on 8-bit depth medical images. We proposed a novel reversible data hiding scheme testing on 16-bit depth CT and MRI medical image. And the peak point and zero point of a histogram are applied to embed secret message k bits without salt-and-pepper.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.507-513
• /
• 2020

The median filter that is used in various fields requiring image processing converts to a median value of pixels belonging to a radius r for all pixels in the image of n×m size. For 8-bit depth images, an O(nm) time algorithm exists but for over 16-bit depth images, there is an O(nmlog²r) time algorithm of Gil and Werman. In this paper, we propose an efficient median filter algorithm that works for more than 16-bit depth images. The time complexity of our algorithm is the same as that of Gil and Werman, but theoretical analysis and experimental results show that ours is efficient than above two times.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.232-235
• /
• 2010

This paper proposes an efficient depth-map coding method. The adaptive block-based depth-map coding method decides the number of bit planes to be encoded according to the quantization parameters to obtain the desired bit rates. So, the depth-map coding using the block-based decision of the bit-plane to be encoded proposes to free from the constraint of the quantization parameters. Simulation results show that the proposed method, in comparison with the adaptive block-based depth-map coding method, improves the average BD-rate savings by 3.5% and the average BD-PSNR gains by 0.25dB.

• Journal of Broadcast Engineering
• /
• v.16 no.2
• /
• pp.274-292
• /
• 2011

This paper proposes an efficient coding method of the depth-map which is different from the natural images. The depth-map are so smooth in both inner parts of the objects and background, but it has sharp edges on the object-boundaries like a cliff. In addition, when a depth-map block is decomposed into bit planes, the characteristic of perfect matching or inverted matching between bit planes often occurs on the object-boundaries. Therefore, the proposed depth-map coding scheme is designed to have the bit-plane unit coding method using the adaptive XOR method for efficiently coding the depth-map images on the object-boundary areas, as well as the conventional DCT-based coding scheme (for example, H.264/AVC) for efficiently coding the inside area images of the objects or the background depth-map images. The experimental results show that the proposed algorithm improves the average bit-rate savings as 11.8 % ~ 20.8% and the average PSNR (Peak Signal-to-Noise Ratio) gains as 0.9 dB ~ 1.5 dB in comparison with the H.264/AVC coding scheme. And the proposed algorithm improves the average bit-rate savings as 7.7 % ~ 12.2 % and the average PSNR gains as 0.5 dB ~ 0.8 dB in comparison with the adaptive block-based depth-map coding scheme. It can be confirmed that the proposed method improves the subjective quality of synthesized image using the decoded depth-map in comparison with the H.264/AVC coding scheme. And the subjective quality of the proposed method was similar to the subjective quality of the adaptive block-based depth-map coding scheme.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.8
• /
• pp.917-923
• /
• 2014

Subminiature joining bolts are required for the electronic parts of gadgets such as mobile phones and watch phones. During the miniaturization of bolt heads, it is difficult to obtain sufficient joining force owing to the risk of shear fracture of the bolt head or severe plastic deformation on the bit region. In this study, the maximum joining torque for the bit depth was predicted using finite element analysis. A shear fracture test was conducted on a wire used in bolt forming. The results of this test were subjected to finite element analysis and a fracture criterion was obtained by comparing the experimental and analysis results. The shear fracture of the bolt head during joining was predicted based on the obtained criterion. Furthermore, the maximum joining torque was predicted for various bit depths. Fracture on the boundary between the bolt head and thread was found to occur in lower joining torque as bit depth increases.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.2
• /
• pp.97-101
• /
• 2013

Bit-depth expansion is a process of enhancing the image quality by increasing the number of intensity levels. To solve this problem, a hybrid method is proposed, where the pixels are categorized into smooth and complex regions, and are processed using different methods. The pixels in the smooth region are reconstructed with a smooth prior, and a Bayesian estimator is used for the pixels in the complex region. The proposed method effectively removes the false contour artifacts while requiring less computation than conventional methods. In addition, the method shows good quantitative performance, and the PSNR gains over the best existing method are 1.45 dB and 0.26 dB for 4 bits and 3 bits expansion cases, respectively.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.200-202
• /
• 2014

본 논문은 High bit-depth 를 위한 SIMD (Single Instruction, Multiple Data) 명령어 기반 보간 필터 고속화 방법을 제안한다. 픽셀 연산을 기반으로 하는 보간 필터링은 HEVC 복호화기에서 높은 복잡도를 차지하고 있지만 반복적인 산술연산을 수행하기 때문에 SIMD 를 이용한 고속화에 적합한 구조를 가지고 있다. 이러한 이유로 본 논문에서는 보간 필터 연산에 대하여 SIMD 명령어를 이용하여 메모리를 효율적으로 사용하여 고속화하는 방법을 제안한다. 제안하는 기술은 HEVC 참조 소프트웨어 HM 12.0-RExt 4.1 에 기반을 둔 ANSI C 기반 자체 개발 HEVC RExt 복호화기 소프트웨어에서 평균 8.5%의 복호화 속도향상을 보였으며, 보간 필터의 수행 시간을 평균 24.8% 향상시켰다.

• The Journal of the Korea Contents Association
• /
• v.9 no.7
• /
• pp.57-66
• /
• 2009

Zigbee is a universal communication standard used in USN and is utilized in various applications. Zigbee protocol provides an address within a single PAN network, and at this time, it uses DAA. This is a method that divides a 16-bit address area into blocks with a fixed size according to the depth to assign one to each node. However, this method is limited because it has to assign addresses in 16 bits. As the depth increases, the number of nodes also increases exponentially to the maximal number of routers provided to each depth. Therefore, it is difficult to construct a huge network with numerous routers and large depth as in the places which are wide or have many shadow areas. Besides, since all the operations are performed in a single PAN network, it is hard to make several PANs into a single network. This article suggests new addressing and routing methods that can construct several PAN networks into a single network and combine broad area with less limitation in the number of routers and depth by extending the Zigbee-based network. Moreover, this paper has tested its performance and has verified its usability through substantive tests.