• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2005년도 춘계 학술발표회 논문집
• /
• pp.121-128
• /
• 2005

This study presents an effective stiffness-based optimal technique to control quantitatively lateral drift for shear wall structures subject to lateral loads. To this end the displacement sensitivity depending on behavior characteristics of shear wall structures is established. Also, the approximation concept that can preserve the generality of the mathematical programming and can efficiently solve large scale problems is introduced. Resizing sections in the stiffness-based optimal design are assumed to be uniformly varying in size and the technique of member grouping is considered for the improvement of construction efficiency Two types of 11-story shear wall structures are presented to illustrate the features of the quantitative lateral drift control technique proposed in this study.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.867-871
• /
• 2004

In this paper, a new analytic approach for shape preserving contrast enhancement is presented. Contrast enhancement is achieved by means of segmental histogram stretching modification which preserves the given image shape, not distorting the original shape. After global stretching, the image is partitioned into several level-sets according to threshold condition. The image information of each level-set is represented as typical value based on grouped differential values. The basic property is modified into common local schemes, thereby introducing the enhanced effect through extreme discrimination between subsets. The scheme is based on stretching the histogram of subsets in which the intensity gray levels between connected pixels are approximately same In spite of histogram widening, stretched by local image information, it neither creates nor destroys the original image, thereby preserving image shape and enhancing the contrast. By designing local histogram stretching operations, we can preserve the original shape of level-sets of the image, and also enhance the global intensity. Thus it can hold the main properties of both global and local image schemes, which leads to versatile applications in the field of digital epigraphy.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.57-60
• /
• 2000

This paper presents a new adaptive fast motion estimation algorithm along with its architecture. The conventional algorithm such as full - search algorithm, three step algorithm have some disadvantages which are related to the amount of computation, the quality of image and the implementation of hardware, the proposed algorithm uses spatial correlation and a slope of motion vector in order to reduce the amount of computation and preserve good image quality, The proposed algorithm is better than the conventional Block Matching Algorithm(BMA) with regard to the amount of computation and image quality. Also, we propose an efficient at chitecture to implement the proposed algorithm. It is suitable for real time processing application.

• 전자공학회논문지B
• /
• 제33B권11호
• /
• pp.44-52
• /
• 1996

This paper proposes a KLT-CVQ scheme using PCNN to improbe the quality of the reconstructed images at a given bit rate. By using the PCNN and classified vector quantization, we exploit the high energy compaction and compelte decorrelation capbilities of the KLT, and the pdf (probability density function) shape and space-filling advantages of the vQ to improve the performance of the proposed hybrid coding technique. In order to preserve the preceptual fetures such as the edge components in the reconstructed images, we classified the input image blocks according to the texture energy measures of the local statistics and vector-coded them adaptively, and thereby reduces the possible edge degradation in the reconstructed images. The results of the computer simulations show that the performance of the proposed KLT-CVQ is higher than that of the KLT-CSQ or the DCT-CVQ in the quality of the reconstructed images at a given bit rate.

• 전자공학회논문지S
• /
• 제34S권7호
• /
• pp.89-101
• /
• 1997

A technical method of noise modeling and adaptive filtering reducing of speckle noise in ultrasonic medical images is presented. By adjusting the characteristics of the filer according to local statistics around each pixel of the image as moving windowing, it is possible to suppress noise sufficiently while preserve edge and other significant information required in diagnosis. Homogeneous factor(HF) from the noise models that enables the filter to recognize the local structures of the image is introduced, and an algorithm for determining the HF fitted to the diagnostic systems with various inner statistical properties is proposed. We show by the experimented that the performance of proposed method is superior to these of other filters and models in preserving small details and suppressing the noise at homogeneous region.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.427-430
• /
• 2005

In this paper, we propose a new post-processing method, based on the theory of the projection onto convex sets (POCS) to reduce the blocking artifacts in decoded images. We propose a new smoothness constraint set (SCS) and its projection operator in the wavelet transform (WT) domain to remove unnecessary high-frequency components caused by blocking artifacts. We also propose a new method to find and preserve the original high frequency components of the image edge. Experimental results show that the proposed method can not only achieve a significantly enhanced subjective quality, but also have the PSNR improvement in the output image.

• Journal of Computational Design and Engineering
• /
• 제1권2호
• /
• pp.88-95
• /
• 2014

Because the cost of performance testing using actual products is expensive, manufacturers use lower-cost computer-aided design simulations for this function. In this paper, we propose using hexahedral meshes, which are more accurate than tetrahedral meshes, for finite element analysis. We propose automatic hexahedral mesh generation with sharp features to precisely represent the corresponding features of a target shape. Our hexahedral mesh is generated using a voxel-based algorithm. In our previous works, we fit the surface of the voxels to the target surface using Laplacian energy minimization. We used normal vectors in the fitting to preserve sharp features. However, this method could not represent concave sharp features precisely. In this proposal, we improve our previous Laplacian energy minimization by adding a term that depends on multi-normal vectors instead of using normal vectors. Furthermore, we accentuate a convex/concave surface subset to represent concave sharp features.

• Kyungpook Mathematical Journal
• /
• 제59권4호
• /
• pp.617-629
• /
• 2019

A term is called linear if each variable which occurs in the term, occurs only once. A hypersubstitution is said to be linear if it maps any operation symbol to a linear term of the same arity. Linear hypersubstitutions have some importance in Theoretical Computer Science since they preserve recognizability [7]. We show that the collection of all linear hypersubstitutions forms a monoid. Linear hypersubstitutions are used to define linear hyperidentities. The set of all linear term operations of a given algebra forms with respect to certain superposition operations a function algebra. Hypersubstitutions define endomorphisms on this function algebra.

• 전자통신동향분석
• /
• 제33권1호
• /
• pp.68-77
• /
• 2018

Data deduplication is a common used technology in backup systems and cloud storage to reduce storage costs and network traffic. To preserve data privacy from servers or malicious attackers, there has been a growing demand in recent years for individuals and companies to encrypt data and store encrypted data on a server. In this study, we introduce two cryptographic primitives, Convergent Encryption and Message-Locked Encryption, which enable deduplication of encrypted data between clients and a storage server. We analyze the security of these schemes in terms of dictionary and poison attacks. In addition, we introduce deduplication systems that can be implemented in real cloud storage, which is a practical application environment, and describes the proof of ownership on client-side deduplication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2782-2805
• /
• 2018

We present a legorization framework that produces a LEGO model from user-specified 3D mesh model. Our framework is composed of two stages: voxelization and legorization. In the voxelization, input 3D mesh is converted to a voxel model. To preserve the shape of the 3D mesh, we devise a silhouette fitting process for the initial voxel model. For legorization, we propose three objectives: stability, aesthetics and efficiency. These objectives are expressed in a tiling equation, which builds a LEGO model using layer-by-layer approach. We legorize five models including characters and buildings to prove the excellence of our framework.