• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.336-340
• /
• 2011

Many approaches to image restoration are aimed at removing either gauss or impulse noise. This is because both types of degradation processes are distinct in nature, and hence they are easier to manage when considered separately. Nevertheless, it is possible to find them operating on the same image, which produces a hard damage. This happens when an image, already contaminated by Gaussian noise in the image acquisition procedure, undergoes impulsive corruption during its digital transmission. Here we proposed an algorithm first judge the type of the noise according to the difference values of pixel's neighborhood region and impulse noise's characteristic. Then removes the gauss noise by modified weighted mean filter and removes the impulse noise by modified nonlinear filter. The result of computer simulation on test images indicates that the proposed method is superior to traditional filtering algorithms. The proposed method can not only remove mixed noise effectively, but also preserve image details.

• Kyungpook Mathematical Journal
• /
• v.48 no.3
• /
• pp.465-472
• /
• 2008

For a nonnegative real matrix A of rank 1, A can be factored as $ab^t$ for some vectors a and b. The perimeter of A is the number of nonzero entries in both a and b. If B is a matrix of rank k, then B is the sum of k matrices of rank 1. The perimeter of B is the minimum of the sums of perimeters of k matrices of rank 1, where the minimum is taken over all possible rank-1 decompositions of B. In this paper, we obtain characterizations of the linear operators which preserve perimeters 2 and k for some $k\geq4$. That is, a linear operator T preserves perimeters 2 and $k(\geq4)$ if and only if it has the form T(A) = UAV or T(A) = $UA^tV$ with some invertible matrices U and V.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1946-1952
• /
• 1999

A new image compression method to preserve edge characteristics in reconstructed images using an unsupervised learning neural is proposed in this paper. By the unsupervised competitive learning which generalizes previously proposed Centroid Neural Network(CNN) algorithm with the geometric characteristics of edge area and statistical characteristics of image data, more codevectors are allocated in the edge areas to provide the more accurate edges in reconstructed image. Experimental results show that the proposed method gives improved edge in reconstructed images when compared with SOM, Modified SOM and M/R-CNN.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.130-135
• /
• 2001

When a networked virtual reality system handles composite media audio and video as well as three dimensional computer graphics, the quality of the virtual space is greatly affected by the current available network, and end system resources. Even if the network can preserve a certain amount of resources, the required resources change dynamically according to the user\`s navigation of a large virtual space, and then it may decrease the quality of the virtual space. In this paper, a method for resource allocation is proposed and the proposed system copes with the deterioration of quality of virtual spaces in case that the starvation of system resources occurs. The experimental results show that the proposed method is efficient.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.195-198
• /
• 2005

UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MBOFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MBOFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

• Proceedings of the Safety Management and Science Conference
• /
• 2001.05a
• /
• pp.275-280
• /
• 2001

DESIGNIN AND OPERATION OF DIGITAL EVIDENCE MANAGEMENT SYSTEM APPLYING COMPUTER FORENSICS AND ELECTRONIC CERTIFICATION Digital evidence will be used as a term, which means the electronic form of information which is necessary to confirm or prove the factum of all kinds of behaviors committed through the devices which have data processing ability including computer. It is expected that there will be the increase of legal conflicts surrounding electronic commerce activities as well as the increase of cyber crimes, as the number of Internet users are getting bigger. In order to solve the problems of conflicts derived from electronic commerce, the factum of electronic commerce activities must be confirmed. In order to confirm the factum of electronic commerce activities, the evidence is prerequisite. Almost all evidences relating to the electronic commerce activities exist in digital form. For the reason that the digital evidence can be easily damaged and changed, special management is required to collect, analyze, and preserve the digital evidence. In order to meet this requirement, this study proposes a basic model of digital evidence management system applying computer forensics and electronic authentication.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2001.11a
• /
• pp.929-934
• /
• 2001

As the notion of environment protection changes throughout the world, construction engineers, as part of the effort to resolve environmental problems, have been actively doing research on environmental friendly porous concrete using large and non-uniform aggregate. Concrete having a great deal of continuous porosity enable water and air to pass freely through firmly hardened material, allowing necessary nutrients to reach roots of vegetation, thereby sustaining them. It is possible to prevent the exhaustion of natural resources by recycling waste concrete and industrial by-products, to reduce damage caused by the destruction of nature through effective management of natural resources, to preserve the natural environment and vegetation in urban areas by activating the soil, protecting the underground ecology system, and growing garden plants through the application of environmentally friendly concrete.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.229-232
• /
• 2001

Recently, several promising multiobjective evolutionary algorithms, e,g, SPEA, NSGA-ll, PESA, and SPEA2, have been developed. In this paper, we also propose a new multiobjective evolutionary algorithm that compares to them. In the algorithm proposed in this paper, we introduce a novel concept, "inherited age" and total algorithm is executed based on the inherited age concept. Also, we propose a new sharing algorithm, called objective classication sharing algorithm(OCSA) that can preserve the diversity of the population. We will show the superior performance of the proposed algorithm by comparing the proposed algorithm with other promising algorithms for the test functions.

• Journal of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.713-731
• /
• 2009

In this paper, a three-dimensional eco-epidemiological model with delay is considered. The stability of the two equilibria, the existence of Hopf bifurcation and the permanence are investigated. It is found that Hopf bifurcation occurs when the delay ${\tau}$ passes though a sequence of critical values. The estimation of the length of delay to preserve stability has also been calculated. Numerical simulation with a hypothetical set of data has been done to support the analytical findings.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.825-832
• /
• 2010

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.