• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.9-17
• /
• 2009

A face database has contained a large amount of facial information data since face recognition was widely used. With the increase of facial information data, the face recognition based on distributed processing method has been noticed as a major topic. In existing studies, there were lack of discussion about the transferring method for large data. So, we proposed a fuzzy logic-based bit compression rate selection method for distributed face recognition. The proposed method selects an effective bit compression rate by fuzzy inference based on face recognition rate, processing time for recognition, and transferred bit length. And, we compared the facial recognition rate and the recognition time of the proposed method to those of facial information data with no compression and fixed bit compression rates. Experimental results demonstrates that the proposed method can reduce processing time for face recognition with a reasonable recognition rate.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.636-639
• /
• 2004

In present, there are many methods such as DCT, Wavelet Transform, or Quantization -to the image compression field, but the basic image compression method have based on DCT. The representative thing of the efficient techniques for information compression is DCT method. It is more superior than other information conversion method. It is widely applied in digital signal processing field and MPEG and JPEG which are selected as basis algorithm for an image compression by the international standardization group. It is general that DCT is consisted of using multiplier with main arithmetic blocks having many arithmetic amounts. But, the use of multiplier requires many areas when hardware is embodied, and there is fault that the processing speed is low. In this paper, we designed the hardware module that could run high-speed operation using row-column separation calculation method and Chen algorithm by distributed arithmetic method using ROM table instead of multiplier for design DCT module of high speed.

• Transactions of Materials Processing
• /
• v.21 no.5
• /
• pp.285-290
• /
• 2012

In spite of progress in predicting ductile failure, the development of a macroscopic yield criterion to describe damage evolution in HCP (hexagonal close-packed) materials remains a challenge. HCP materials display strength differential effects (i.e., different behavior in tension versus compression) in their plastic response due to twinning. Cazacu and Stewart(2009) developed an analytical yield criterion for porous material containing randomly distributed spherical voids in an isotropic, incompressible matrix that shows tension-compression asymmetry. The goal of the calculations in this paper is to investigate the effect of the tension-compression asymmetry on necking induced by void nucleation, evolution and consolidation. In order to investigate the effect of the tension-compression asymmetry of the matrix on necking and fracture initiation, three isotropic materials A, B, and C were examined with different ratios of tension-compression asymmetry. The various types of material had BCC, FCC, and HCP crystal structures, respectively. The ratio between tension and compression in plastic flow significantly influences the fracture shape produced by damage propagation as well as affecting the localized neck.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.922-933
• /
• 2016

IP header compression schemes offer a valuable measure for bandwidth preservation. Such schemes have been practically implemented in infrastructure-based IP networks for point-to-point links. However, minimal research and practical implementation efforts have been conducted in the direction of an IP header compression strategy that can meet the peculiar requirements of multi-hop ad hoc wireless networks. In this paper, we present a practically implemented multi-hop IP header compression scheme using the Robust Header Compression (ROHC) protocol suite. The scheme runs on a novel identifier (ID) based networking architecture, known as an ID-based ad hoc network (IDHOCNET). IDHOCNET additionally solves a number of bottlenecks of pure IP-based ad hoc networks that have emerged owing to IP address auto-configuration service, distributed naming and name resolution, and the role of an IP address as an identifier at the application layer. The proposed scheme was tested on a multi-hop test bed. The results show that the implemented scheme has better gain and requires only O (1) ROHC contexts.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.131-143
• /
• 2007

The current trends in information technology and intelligent systems use data mining techniques to discover patterns and extract rules from distributed databases. In distributed environment, the extracted rules from data mining techniques can be used in dynamic replications, adaptive load balancing and other schemes. However, transmission of large data through the system can cause errors and unreliable results. This paper proposes the intelligent distributed platform based on dynamic group binding using mobile agents which addresses the use of intelligence in distributed environment. The proposed grouping service implements classification scheme of objects. Data compressor agent and data miner agent extracts rules and compresses data, respectively, from the service node databases. The proposed algorithm performs preprocessing where it merges the less frequent dataset using neuro-fuzzy classifier before sending the data. Object group classification, data mining the service node database, data compression method, and rule extraction were simulated. Result of experiments in efficient data compression and reliable rule extraction shows that the proposed algorithm has better performance compared to other methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.10
• /
• pp.901-913
• /
• 1991

Data compression has important application in the areas of file storage and distributed computer systems. The universal data compression achieves asymptotically optimum cimpression ratio for strings generated by any stationary ergodic source without a priori source probabilities.The paper describes the principle and the recent research trends on universal data compression. And its applications.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2014.10a
• /
• pp.994-995
• /
• 2014

Supporting stiffness of seats is an important component affecting dynamic characteristics cognized by a passenger. To analyze dynamic characteristic of a seat for vehicles operating on various road conditions, the seat vibration from road irregularity should be understood and compared. In this study, the seat is analyzed as distributed supporting system. The dynamic stiffness is measured using masses. The characteristic of the seats is analyzed by measuring distributed dynamic stiffness. The distributed dynamic stiffness of the seat is estimated on various locations and the effects of each component such as spatial distribution, compression level and vibration amplitude are analyzed. The influence of seat cover, elastic support and flexible polyurethane foam on the measured stiffness was analyzed.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.152-158
• /
• 2015

We consider the problem of designing independently operating local quantizers at nodes in distributed estimation systems, where many spatially distributed sensor nodes measure a parameter of interest, quantize these measurements, and send the quantized data to a fusion node, which conducts the parameter estimation. Motivated by the discussion that the estimation accuracy can be improved by using the quantized data with a high probability of occurrence, we propose an iterative algorithm with a simple design rule that produces quantizers by searching boundary values with an increased likelihood. We prove that this design rule generates a considerably reduced interval for finding the next boundary values, yielding a low design complexity. We demonstrate through extensive simulations that the proposed algorithm achieves a significant performance gain with respect to traditional quantizer designs. A comparison with the recently published novel algorithms further illustrates the benefit of the proposed technique in terms of performance and design complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.702-708
• /
• 2000

In this paper, we designed one-dimensional VLSI array with optimal pipeline period for high speed processing fractal image compression. The algorithm is derived which is suitable for VLSI array from axed block partition algorithm. Also the algorithm satisfies high quality of image and high compression-ratio. The designed VLSI array has optimal pipeline relied because the required processing time of PEs is distributed as same as possible. As this result, we can improve the processing speed up to about 3 times. The number of input/output pins can be reduced by sharing the input/output and arithmetic unit of the domain blocks and the range blocks.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 1999.10c
• /
• pp.265-270
• /
• 1999

At this study, we investigated the chemical component and the mineral granular composition of sedimentary rock and others where were distributed in Taegu area and compared correlations with each data through the various physicla and mechanical characteristic test. As the result, d and E, they are kinds of granite, which contain much albite than others were proved to be strong by mechanical tests and the correlation moduli were proved to be more than 0.8 except P wave velocity-Poisson's ration relation when examined Elastic moduluous -Poisson's ration, P, wave velocity-Uniaxial compression strength, Elastic modulous -Uniaxial compression strength and Uniaxial compression strength-Poisson's ration correlation function graph.