• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.04a
• /
• pp.215-218
• /
• 2003

There are lots of ways to measure earth-volume, but recently Total Station and GPS are more frequently used. According to the advance of science, acquisition and processing of image by camera are also going to make great progress. So that, in this study, we search the efficiency for earth-volume calculation using digital photogrammetry.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.145-155
• /
• 2013

In this paper, we proposed a $4{\times}4$ block parallel architecture of interpolation for high-performance H.264/AVC Fractional Motion Estimation in 8K UHD($7680{\times}4320$) video real time processing. To improve throughput, we design $4{\times}4$ block parallel interpolation. For supplying the $10{\times}10$ reference data for interpolation, we design 2D cache buffer which consists of the $10{\times}10$ memory arrays. We minimize redundant storage of the reference pixel by applying the Search Area Stripe Reuse scheme(SASR), and implement high-speed plane interpolator with 3-stage pipeline(Horizontal Vertical 1/2 interpolation, Diagonal 1/2 interpolation, 1/4 interpolation). The proposed architecture was simulated in 0.13um standard cell library. The gate count is 436.5Kgates. The proposed H.264/AVC Fractional Motion Estimation can support 8K UHD at 30 frames per second by running at 187MHz.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.502-504
• /
• 1995

In video image compression, it is important to extract the exact notion information from image sequence in order to perform the data compression, the field rate conversion, and the motion compensated interpolation effectively. It is well known that the location of the smallest sum of absolute difference(SAD) does not always give the true motion vector(MV) since the MV obtained via full block search is often corrupted by noise. In this paper, we first classifies the input blocks into 3 categories : the background, the shade-motion, and the edge-motion. According to the characteristics of the classified blocks, multiple locations of relatively small SAD are searched with an adaptive search window by using the proposed method. The proposed method picks MVs among those candidates by using temporal correlation. Since temporal correlation reveals the noise level in a particular region of the video image sequence, we are able to reduce the search are very effectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2540-2545
• /
• 2015

In this paper, we propose a novel method to extract appendix from ultrasound image automatically to avoid such subjectivity issue. In the process, we apply a series of image processing algorithms such as Ends_in search stretching for emphasizing brightness contrast and binarization, region labelling, and cubic spline interpolation for extracting lower bound fasicia line that is the base of extracting the appendix. Knowing that the appendix is located at the lower organ area below the bottom fascia line, we conduct a series of image processing techniques to find the fascia line correctly. And then we apply ART2 algorithm to the organ area in order to extract appendix accurately. Through experiment, the effectiveness of the proposed method is verified based on the field experts' evaluations.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.55-62
• /
• 2021

In this paper, we propose a human-content interface that allows users to quickly and efficiently search data through friction-based scrolling with ROI(Regions of interests). Our approach, conceived from the behavior of finding information or content of interest to users, efficiently calculates ROI for a given content. Based on the kernel developed by conceiving from GMM(Gaussian mixture model), information is searched by moving the screen smoothly and quickly to the location of the information of interest to the user. In this paper, linear interpolation is applied to make one softer inertia, and this is applied to scrolls. As a result, unlike the existing approach in which information is searched according to the user's input, our method can more easily and intuitively find information or content that the user is interested in through friction-based scrolling. For this reason, the user can save search time.

• Proceedings of the KWS Conference
• /
• 2002.10a
• /
• pp.803-808
• /
• 2002

A computer-aided alloy-designing technique to develop the insert metal for transient liquid phase (TLP) bonding was applied to high aluminum Ni-base superalloys. The main procedure of a mathematical programming method was to obtain the optimal chemical composition through rationally compromising the plural objective performances of insert metal by a grid-search which involved data estimation from the limited experimental data using interpolation method. The objective function Z which was introduced as an index of bonding performance of insert metal involved the melting point, hardness (strength), formability of brittle phases and void ratio (bonding defects) in bond layer as the evaluating factors. The contour maps of objective function Z were also obtained applying the interpolation method. The compositions of Ni-3.0%Cr-4.0%B-0.5%Ce (for ${\gamma}$/${\gamma}$/${\beta}$ type alloy) and Ni3.5%Cr-3.5%B-3%Ti (for ${\gamma}$/${\gamma}$ type alloy) which optimized the objective function were determined as insert metal. SEM observations revealed that the microstructure in bond layers using the newly developed insert metals indicated quite sound morphologies without forming microconstituents and voids. The creep rupture properties of both joints were much improved compared to a commercial insert metal of MBF-80 (Ni-15.5%Cr-3.7%B), and were fairly comparable to those of base metals.

• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.459-468
• /
• 2013

Under nonlinear characteristics of frames, we propose the frame interpolation using GRNN to enhance the visual picture quality. By full search with block size of 128x128~1x1 to reduce blocky artifact and image overlay, we select the frame having block of minimum error and re-estimate the nonlinear moving vector using GRNN. We compare our scheme with forward(backward) motion compensation, bidirectional motion compensation when the object movement is large or the object image includes zoom-in and zoom-out or camera focus has changed. Experimental results show that the proposed method provides better performance in subjective image quality compared to conventional MCFI methods.

• Journal of Korea Water Resources Association
• /
• v.44 no.3
• /
• pp.209-220
• /
• 2011

Input uncertainty is one of the major sources of uncertainty in hydrologic modeling. In this paper, first, three alternate rainfall inputs generated by different interpolation schemes were used to see the impact on a distributed watershed model. Later, the residuals of precipitation interpolations were tested as a source of ensemble streamflow generation in two river basins in the U.S. Using the Monte Carlo parameter search, the relationship between input and parameter uncertainty was also categorized to see sensitivity of the parameters to input differences. This analysis is useful not only to find the parameters that need more attention but also to transfer parameters calibrated for station measurement to the simulation using different inputs such as downscaled data from weather generator outputs. Input ensembles that preserves local statistical characteristics are used to generate streamflow ensembles hindcast, and showed that the ensemble sets are capturing the observed steamflow properly. This procedure is especially important to consider input uncertainties in the simulation of streamflow forecast.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.446-454
• /
• 2004

With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.1 s.173
• /
• pp.190-195
• /
• 2000

It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure. Nikolakopoulos et. al. used the intersection point of the superposed contours that correspond to the eigenfrequency caused by the crack presence. However the intersecting point of the superposed contours is not only difficult to find but also incorrect to calculate. A method is presented in this paper which uses optimization technique for the location and depth of the crack. The basic idea is to find parameters which use the structural eigenfrequencies on crack depth and location and optimization algorithm. With finite element model of the structure to calculate eigenfrequencies, it is possible to formulate the inverse problem in optimization format. Method of optimization is augmented lagrange multiplier method and search direction method is BFGS variable metric method and one dimensional search method is polynomial interpolation.