• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.953-958
• /
• 2013

In this paper, an efficient hardware architecture is proposed for $32{\times}32$ inverse transform HEVC decoder. HEVC is a new image compression standard to deal with much larger image sizes compared with conventional image codecs, such as 4k, 8k images. To process huge image data effectively, it adopts various new block structures. Theses blocks consists of $4{\times}4$, $8{\times}8$, $16{\times}16$, and $32{\times}32$ block. This paper suggests an effective structures to process $32{\times}32$ inverse transform. This structure of inverse transform adopts the decomposed $16{\times}16$ matrixes of $32{\times}32$ matrix, and simplified the operations by implementing multiplying with shifters and adders. Additionally the operations frequency is downed by using multicycle paths. Also this structure can be easily adopted to a multi-size transform or a forward transform block in HEVC codec.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.169-175
• /
• 2006

In this paper we propose a method of reconstruction of cylindrical panorama using simplified projective transform from the panning image on the fixed camera. For the practical construction of cylindrical panorama we consider the rotation of the camera on the Y-axis only, even though considering the rotation components on all of the X,Y,Z axis on three-dimensional space for projective transform between general panoramas. The restriction mentioned above simplifies projective transform with existing 8 degrees of freedom into the one with 4 degrees of freedom. In the results, overall computation for projective transform can be decreased to the great extents in quantify, because the number of corresponding points required for inducing the transforming formula is gone down by half. Proposed algorithm from the simulation carried out in this paper shows similar performance and decreased computational quantity compared with existing algorithm. Also, it shows the construction of cylindrical panorama using simplified projective transform.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.329-334
• /
• 2014

This paper proposes the hardware architecture of high performance multi-mode 2D forward transform for HEVC which has same number of cycles for processing any type of four TUs and yield high throughput. In order to make the original image which has high pixel and high resolution into highly compressed image effectively, the transform technique of HEVC supports 4 kinds of pixel units, TUs and it finds the optimal mode after performs each transform computation. As the proposed transform engine uses the common computation operator which is produced by analyzing the relationship among transform matrix coefficients, it can process every 4 kinds of TU mode matrix operation with 35cycles equally. The proposed transform block was designed by Verilog HDL and synthesized by using TSMC 0.18um CMOS processing technology. From the results of logic synthesis, the maximum operating frequency was 400MHz and total gate count was 214k gates which has the throughput of 10-Gpels/cycle with the $4k(3840{\times}2160)@30fps$ image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1095-1100
• /
• 2008

In a process of insect foot recognition, footprint segments as basic areas for recognition need to be extracted from scanned insect footprints and appropriate features should be found from the footprint segments in order to discriminate kinds of insects, because the characteristics of the features are important to classify insects. In this paper, we propose methods for automatic footprint segmentation and feature extraction. We use a Trace transform method in order to find out appropriate features from the extracted segments by the above methods. The Trace transform method builds a new type of data structure from the segmented images by functions using parallel trace lines and the new type of data structure has characteristics invariant to translation, rotation and reflection of images. This data structure is converted to Triple features by Diametric and Circus functions, and the Triple features are used for discriminating patterns of insect footprints. In this paper, we show that the Triple features found by the proposed methods are enough distinguishable and appropriate for classifying kinds of insects.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.3
• /
• pp.291-298
• /
• 2019

In this paper, we propose a Fresnel transform method using various wavelet functions to efficiently decompose digital holograms. After implementing the proposed wavelet function-based Fresnelet transforms, we apply it to the digital hologram and analyze the energy characteristics of the coefficients. The implemented wavelet transform-based Fresnelet transform is well suited for reconstructing and processing holograms which are optically obtained or generated by computer-generated hologram technique. After analyzing the characteristics of the spline function, we discuss wavelet multiresolution analysis method based on it. Through this process, we proposed a transform tool that can effectively decompose fringe patterns generated by optical interference phenomena. We implement Fresnelet transform based on wavelet function with various decomposition properties and show the results of decomposing fringe pattern using it. The results show that the energy distribution of the coefficients is significantly different depending on whether the random phase is included or not.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.345-361
• /
• 2005

A transform-space index indexes objects represented as points in the transform space An advantage of a transform-space index is that optimization of join algorithms using these indexes becomes relatively simple. However, the disadvantage is that these algorithms cannot be applied to original-space indexes such as the R-tree. As a way of overcoming this disadvantages, the authors earlier proposed the transform-space view join algorithm that joins two original- space indexes in the transform space through the notion of the transform-space view. A transform-space view is a virtual transform-space index that allows us to perform join in the transform space using original-space indexes. In a transform-space view join algorithm, the order of accessing disk pages -for which various space filling curves could be used -makes a significant impact on the performance of joins. In this paper, we Propose a new space filling curve called the adaptive row major order (ARM order). The ARM order adaptively controls the order of accessing pages and significantly reduces the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page) and the number of disk accesses for a given buffer size. Through analysis and experiments, we verify the excellence of the ARM order when used with the transform-space view join. The transform-space view join with the ARM order always outperforms existing ones in terms of both measures used: the one-pass buffer size and the number of disk accesses for a given buffer size. Compared to other conventional space filling curves used with the transform-space view join, it reduces the one-pass buffer size by up to 21.3 times and the number of disk accesses by up to $74.6\%$. In addition, compared to existing spatial join algorithms that use R-trees in the original space, it reduces the one-pass buffer size by up to 15.7 times and the number of disk accesses by up to $65.3\%$.

• Proceedings of the Optical Society of Korea Conference
• /
• 1990.02a
• /
• pp.121-125
• /
• 1990

Optical Hough transform technique is introduced to obtain the straight line features in parallel from the input scene images. Experimental results are also provided to demonstrate the advantage of such optical parallel processor over the digital one. Peaks in optical Hough space are free from quantization noise and thus easy to detect.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.975-981
• /
• 1996

Let $D \subset C^2$ be a bounded convex domain with real analytic boundary. We get some Lipschitz regularity of the Cauchy transform on the convex domain D.

• Journal of the Korean Mathematical Society
• /
• v.39 no.5
• /
• pp.709-729
• /
• 2002

Using the well known Hermite-Hadamard integral inequality for convex functions, some inequalities for the finite Hilbert transform of functions whose first derivatives are convex are established. Some numerical experiments are performed as well.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.4
• /
• pp.543-559
• /
• 2002

Some inequalities and approximations for the finite filbert transform by the use of Ostrowski type inequalities for absolutely continuous functions are given.