• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.150-161
• /
• 2013

This paper presents a new system which produces high resolution 3D contents by capturing multiview images of an object using multiple cameras, and estimating geometric and texture information of the object from the captured images. Even though a variety of multiview image-based 3D reconstruction systems have been proposed, it was difficult to generate high resolution 3D contents because multiview image-based 3D reconstruction requires a large amount of memory and computation. In order to reduce computational complexity and memory size for 3D reconstruction, the proposed system predetermines the regions in input images where an object can exist to extract object boundaries fast. And for fast computation of a visual hull, the system represents silhouettes and 3D-2D projection/back-projection relations by chain codes and 1D homographies, respectively. The geometric data of the reconstructed object is compactly represented by a 3D segment-based data format which is called DoCube, and the 3D object is finally reconstructed after 3D mesh generation and texture mapping are performed. Experimental results show that the proposed system produces 3D object contents of $800{\times}800{\times}800$ resolution with a rate of 2.2 seconds per frame.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.40 no.4
• /
• pp.373-379
• /
• 2016

It is known that it is expedient to represent the distribution of the properties of a bone with complex heterogeneity as B-spline volume functions. For B-spline-based representation, the pixel values of CT images are interpolated by B-spline volume functions. However, the CT images of a bone are three-dimensional and very large, and hence a large amount of memory and long computation time for the interpolation are required. In this study, a method for resolving these problems is proposed. In the proposed method, the B-spline volume interpolation problem is simplified by using the uniformity of pixel spacing of the image and the properties of B-spline basis functions. This results in a reduction in computation time and the amount of memory used. The proposed method was implemented and it was verified that the computation time and the amount of memory used were reduced.

• Economic and Environmental Geology
• /
• v.27 no.1
• /
• pp.41-47
• /
• 1994

A fast Hankel transform (FHT) algorithm (Anderson, 1982) is applied to numerical evaluation of many Green's tensor integrals encountered in three-dimensional electromagnetic modeling using integral equations. Efficient computation of Hankel transforms is obtained by a combination of related and lagged convolutions which are available in the FHT. We express Green's tensor integrals for a layered half-space, and rewrite those to a form of related functions so that the FHT can be applied in an efficient manner. By use of the FHT, a complete or full matrix of the related Hankel transform can be rapidly and accurately calculated for about the same computation time as would be required for a single direct convolution. Computing time for a five-layer half-space shows that the FHT is about 117 and 4 times faster than conventional direct and multiple lagged convolution methods, respectively.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.1
• /
• pp.39-48
• /
• 2017

We present penetration depth (PD) computation algorithms using explicit Minkowski sum construction ($PD_e$) and implicit Minkowski sum construction ($PD_i$). Minkowski sum construction is the most time consuming part in fast PD computation. In order to address this issue, we find a candidate solution using a centroid difference and motion coherence. Then, $PD_e$ constructs or updates partial Minkowski sum around the candidate solution. In contrast, $PD_i$ constructs only a tangent plane to the Minkowski sums iteratively. In practice, our algorithms can compute PD for complicated models consisting of thousands of triangles in a few milli-seconds. We also discuss the benefits of using different construction of Minkowski sums in the context of PD.

• The KIPS Transactions:PartA
• /
• v.12A no.3 s.93
• /
• pp.215-222
• /
• 2005

The efficient utilization of cache memories is a key factor in achieving high performance for computing large signal transforms. Nonunit stride access in computation of large DFTs causes cache conflict misses, thereby resulting in poor cache performance. It leads to a severe degradation in overall performance. In this paper, we propose a dynamic data layout approach considering the memory hierarchy system. In our approach, data reorganization is performed between computation stages to reduce the number of cache misses. Also, we develop an efficient search algorithm to determine the optimal tree with the minimum execution time among possible factorization trees considering the size of DFTs and the data access stride. Our approach is applied to compute the fast Fourier Transform (FFT). Experiments were performed on Pentium 4, $Athlon^{TM}$ 64, Alpha 21264, UtraSPARC III. Experiment results show that our FFT achieve performance improvement of up to 3.37 times better than the previous FFT packages.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.594-600
• /
• 2017

This paper proposes a global search based motion estimation algorithm for high performance HEVC encoder and its hardware architecture. To eliminate temporal redundancy, motion estimation in HEVC inter-view prediction uses global search and fast search algorithm to search for a predicted block having a high correlation with the current PU in an interpolated reference picture. The global search method predicts the motion of all candidate blocks in a given search area, thus ensuring optimal results, but has a disadvantage of large computation time. Therefore we propose a new algorithm that reduces computational complexity by reusing SAD operation in global search to reduce computation time of inter prediction. As a result of applying the proposed algorithm to standard software HM16.12, the computation time was reduced by 61%, BDBitrate by 11.81%, and BDPSNR by about 0.5% compared with the existing search algorithm. As a result of hardware design, the maximum operating frequency is 255 MHz and the total number of gates is 65.1K.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.14-21
• /
• 2011

Cryptographic protocols based on bilinear pairings provide excellent alternatives to conventional elliptic curve cryptosystems based on discrete logarithm problems. Through active research has been done toward fast computation of the bilinear pairings, it is still believed that the computational cost of one pairing computation is heavier than the cost of one ECC scalar multiplication. However, there have been many progresses in pairing computations over binary fields. In this paper, we compare the cost of BLS signature scheme with ECDSA with equvalent level of security parameters. Analysis shows that the cost of the pairing computation is quite comparable to the cost of ECC scalar multiplication for the case of binary fields.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.9
• /
• pp.701-706
• /
• 2018

The characteristic basis function method, or CFBM, is one of the representative electromagnetic methods widely used today. In this paper, we propose an accelerating algorithm for the far field interaction calculation of CBFM, to efficiently analyze the electromagnetic characteristics of arbitrarily large structures. To effectively analyze the electromagnetic characteristics of a large structure, it is essential to shorten the computation time. In the CBFM analysis method, the complexity can be greatly reduced by using approximations created via the multipole expansion method. The new algorithm proposed in this paper is applied to the computation of radar cross sections of conductor spheres and fighter aircraft, and it is confirmed that calculation time is reduced by 34 % and 74 %, respectively, without loss of accuracy compared with existing CBFM.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.103-112
• /
• 2011

Motion estimation (ME) is regarded as an important component in a video encoding process, because it consumes a large computation complexity. H.264/AVC requires additional computation overheads for fractional search and interpolation. This causes a problem that computational complexity is increased. In Motion estimation, SATD(Sum of Transform Difference) has the characteristics of a parabolic based on the minimum point. In this paper, we propose new prediction algorithm to reduce search point in motion estimation by sub-pixel interpolation characteristics. The proposed algorithm reduces the time of encoding process by decreasing computational complexity. Experimental results show that the proposed method reduces 20% of the computation complexity of motion estimation, while the degradation in video quality is negligible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1076-1085
• /
• 2009

In this paper, a new method for efficient computation of CGH patterns for 3-D video images is proposed by combined use of temporal redundancy and look-up table techniques. In the conventional N-LT method, fringe patterns for other object points on that image plane can be obtained by simply shifting these pre-calculated PFP (Principle Fringe Patterns). But there have been many practical limitations in real-time generation of 3-D video holograms because the computation time required for the generation of 3-D video holograms must be massively increased compared to that of the static holograms. On the other hand, as ordinary 3-D moving pictures have numerous similarities between video frames, called by temporal redundancy, and this redundancy is used to compress the video image. Therefore, in this paper, we proposed the efficient hologram generation method using the temporal redundancy of 3-D video image and N-LT method. To confirm the feasibility of the proposed method, some experiments with test 3-D videos are carried out, and the results are comparatively discussed with the conventional methods in terms of the number of object points and computation time.