• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.73-82
• /
• 2007

This paper proposes how to reduce the amount of data transmitted in each sensor and cluster head in order to lengthen the lifetime of sensor network by data aggregation of the continuous queries. The most important factor of refuting the sensor's energy dissipation is to reduce the amount of messages transmitted. The method proposed is basically to combine clustering, in-network data aggregation and hierarchical filtering. Hierarchical filtering is to divide sensor network by two tiers when filtering it. First tier performs filtering when transmitting the data from cluster member to cluster head, and second tier performs filtering when transmitting the data from cluster head to base station. This method is much more efficient and effective than the previous work. We show through various experiments that our scheme reduces the network traffic significantly and increases the network's lifetime than existing methods.

• 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.

• Journal of Digital Policy
• /
• v.1 no.2
• /
• pp.53-59
• /
• 2022

In this paper, we proposed a method using sub-edge information extracted through a hierarchical structure in the process of generating super resolution based on a single image. In order to improve the quality of super resolution, it is necessary to clearly distinguish the shape of each area while clearly expressing the boundary area in the image. The proposed method assists edge information of the image in deep learning based super resolution method to create an improved super resolution result while maintaining the structural shape of the boundary region, which is an important factor determining the quality in the super resolution process. In addition to the group convolution structure for performing deep learning based super resolution, a separate hierarchical edge accumulation extraction process based on high-frequency band information for sub-edge extraction is proposed, and a method of using it as an auxiliary feature is proposed. Experimental results showed about 1% performance improvement in PSNR and SSIM compared to the existing super resolution.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.1
• /
• pp.33-40
• /
• 2014

In this paper we propose new image coding using wavelet transform. The new method constructs hierarchical bit plane and progressively transports each bit plane. The Proposed algorithm not only supports multi-resolution, dividing original image into special band and various resolution using Antonini's wavelet basis function but also reduces blocking effects that come into JPEG. In encoding time this algorithm considers each band characters and priority of transport order, and applies to fast search of image.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.73-84
• /
• 1992

In this paper, an algorithm for recovering the 3-D shape from a single shaded image is proposed. In the proposed algorithm, by using the relation between the height and surface gradient (p, q), a set of linear equations is derived from the linearized reflectance function. Then the 3-D surface is recovered by employing the conjugate gradient technique. In order to improve the convergence speed of the solution, we also employ the hierarchical basis function and multiresolution images in the algorithm. A method for determining the regularization parameter, which is determined by trial and error in the conventional approach, is also introduced. In addition, the proposed algorithm attempts to recover the 3-D surface without requiring the boundary conditions, making it suitable for a real-time implementation. Simulation results for real image as well as synthetic image are provided to demonstrate the performance of the proposed algorithm.

• Steel and Composite Structures
• /
• v.26 no.2
• /
• pp.171-182
• /
• 2018

This paper presents an isogeometric discretization of Kirchhoff-Love thin shells using truncated hierarchical B-splines (THB-splines). It is demonstrated that the underlying basis functions are ideally appropriate for adaptive refinement of the so-called thin shell structures in the framework of isogeometric analysis. The proposed approach provides sufficient flexibility for refining basis functions independent of their order. The main advantage of local THB-spline evaluation is that it provides higher degree analysis on tight meshes of arbitrary geometry which makes it well suited for discretizing the Kirchhoff-Love shell formulation. Numerical results show the versatility and high accuracy of the present method. This study is a part of the efforts by the authors to bridge the gap between CAD and CAE.

• Journal of Korean Society for Quality Management
• /
• v.32 no.3
• /
• pp.29-44
• /
• 2004

Obtaining and fully understanding the true requirements of customers is hard task. However, successful use of quality function deployment(QFD) depends on capturing customers' requirements and reflecting them during the design of a product. One of common mistakes in QFD is to perform analysis using an inconsistent house of quality(HoQ) chart. This article presents a model for prioritizing customer attributes and design characteristics in order to make a product more attractive to customers. The proposed model modifies the analytic hierarchical process(AHP) with simple pairwise comparison. Our exploration using of QFD identifies how practitioners maintain consistency, whist quantifying HoQ speedily from the customer's perspectives. This paper also identifies and justifies an alternative position on QFD that is supported by statistical examples.

• Journal of Korea Multimedia Society
• /
• v.15 no.10
• /
• pp.1257-1263
• /
• 2012

An implementation of animation module using the 3D body data scanned by laser scanner is reported in this paper. Characteristic points of the skeleton in human body were picked up as pivot point for 3D rotation. The body data set wes reconstructed as objects built in hierarchical tree structure, which is based on skeleton model. In order to implement the 3D animation of the laser scanned body data, the vertexes of the objects were connected as skeleton structure and animated to follow dynamic patterns inputted by user.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.189-194
• /
• 2017

In this study, we propose a method which is based on "Image segmentation by histogram thresholding using hierarchical cluster analysis"/HCA/ and "A nonparametric approach for histogram segmentation"/NHS/. HCA method uses that all histogram bins are one cluster then it reduces cluster numbers by using distance metric. Because this method has too many clusters, it is more computation. In order to eliminate disadvantages of "HCA" method, we used "NHS" method. NHS method finds all local minima of histogram. To reduce cluster number, we use NHS method which is fast. In our approach, we combine those two methods to eliminate disadvantages of Arifin method. The proposed method is not only less computational than "HCA" method because combined method has few clusters but also it uses local minima of histogram which is computed by "NHS".