• Journal of electromagnetic engineering and science
• /
• v.13 no.3
• /
• pp.151-157
• /
• 2013

Marine radars are affected by sea and rain clutters, which can make target discrimination difficult. The clutter standard deviation and improvement factor are applied using multiple parameters-moving speed of radar, antenna speed, angle, etc. When a radar signal is processed, a Data Matrix Bank (DMB) filter can be applied to remove sea clutters. This filter allows detection of a target, and since it is not affected by changes in adjacent clutters resulting from a multi- target signal, sea state clutters can be removed. In this paper, we study the level for clutter removal and the method for target detection. In addition, we design a signal processing algorithm for marine radars, analyze the performance of the DMB filter algorithm, and provide a DMB filter algorithm design. We also perform a DMB filter algorithm analysis and simulation, and then apply this to the DMB filter and cell-average constant false alarm rate design to show comparative results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.6
• /
• pp.462-467
• /
• 2002

A new approach for reducing the blocking artifact is proposed in this paper. This method can be applied to conventional transform coding, without introducing additional information or significant blurring. Main drawbacks of the Discrete Cosine Transform(DCT) are visible block boundaries due to coarse quantization of the coefficients. Therefore, restoration techniques result in unnecessary blurring of the image. The proposed deblocking algorithm is based on the heuristic approach for edge detection. All edges of the standard still images are categorized, and the best edges are selected. Several images are used fer experiments, and several other previous algorithms are compared with the proposed approach. The results show that the proposed algorithm works better than those of other previous researches. This algorithm can be used for JPEG, MPEG, and H.261 standard images.

• Journal of Sensor Science and Technology
• /
• v.13 no.6
• /
• pp.446-453
• /
• 2004

A portable electronic tongue (E-Tongue) system using an array of ion-selective electrode (ISE) and personal digital assistants (PDA) for recognizing and analyzing food and drink have been designed. By the employment of PDA, the complex algorithm such as fuzzy c-means algorithm (FCMA) could be used in E-Tongue, PUMA could iteratively solve the cluster centers of pre-determined standard patterns. And the membership between the standard patterns and unknown pattern could be analyzed easily by the present E-Tongue combined with PDA.

• Smart Structures and Systems
• /
• v.21 no.2
• /
• pp.235-248
• /
• 2018

An efficient method utilizing the multi-stage improved differential evolution algorithm (MSIDEA) as an optimization solver is presented here to detect the multiple-damage of structural systems. Natural frequency changes of a structure are considered as a criterion for damage occurrence. The structural damage detection problem is first transmuted into a standard optimization problem dealing with continuous variables, and then the MSIDEA is utilized to solve the optimization problem for finding the site and severity of structural damage. In order to assess the performance of the proposed method for damage identification, an experimental study and two numerical examples with considering measurement noise are considered. All the results demonstrate the effectiveness of the proposed method for accurately determining the site and severity of multiple-damage. Also, the performance of the MSIDEA for damage detection compared to the standard differential evolution algorithm (DEA) is confirmed by test examples.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.18-25
• /
• 1992

In this paper, a rule checker which aids in composing a consistent knowledge base by checking redundancies and inconsistencies in a knowledge base is proposed. The proposed algorithm checks the rules by representing the rule connections as a network . The standard model of the rules adapted in this algorithm is in the Conjunctive Normal Form which includes NOT's, and rules of conventional expert system can be checked by converting them into the standard form by a rule form at converter. When compared with Ginsberg's KB-reducer which is conceptually most similar to the proposed algorithm among existing methods,it is shown by a computer simulation that with 360 rules, the checking time is three times faster and the rate increased as the number of rules increased, but the total memory requirement of the proposed agorithm is 1.2 times larger. The proposed algorithm has further advantages in that it can check circular rule chains and can find the paths of the redundant and inconsistent rules.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.1-8
• /
• 1997

The main purpose of the Boolean equivalence problem is to verify that two Boolean expressions have the same functionality. Simulation has been extensively used as the standard method for the equivalence problem. Obviously, the number of tests required to perform a satisfactory coverage grows exponentially with the number of input variables. However, formal methods as opposed to simulation are getting more attention from the community. We propose a new algorithm called the Cover-Merge Algorithm based on a derivational method using the concept of cover and merge for the equivalence problem and investigate its theoretical aspects. Because of the difficulty of the problem, we emphasize simplification techniques in order to reduce the search space or problem size. Heuristics based on types of merges are developed to speed up the derivation process by allowing simplifications. In comparison with widely used technique called Binary Decision Diagram or BDD, the algorithm proposed outperforms BDD in nearly all cases of input including standard benchmark problems.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.713-716
• /
• 1998

We propose the dejittering method against the jitter originated from the cell losses in ATM network when CBR traffic is transfereed on AAL5. Cell numbering algong with maintaining a timer at receier side introduces 0.669 times peak-to-peak PDV of the AAL5 PDU to that in ITU-T AAL5 standard, and the AAL5 user-HDTV decoder-receives the same or more error-free transport packets in the proposed algorithm than those in the ITU-T AAL5 standard for the same network simulation environment.

• Korean Journal of Mathematics
• /
• v.21 no.3
• /
• pp.223-236
• /
• 2013

Schensted algorithm was first described in 1938 by Robinson [5], in a paper dealing with an attempt to prove the correctness of the Littlewood-Richardson rule. Schensted [9] rediscovered Schensted algorithm independently in 1961 and Viennot [12] gave a geometric interpretation for Schensted algorithm in 1977. In this paper we describe some properties of Schensted algorithm using Viennot's geometric interpretation.

• The Journal of the Korea Contents Association
• /
• v.7 no.4
• /
• pp.10-19
• /
• 2007

In this paper, Class-1 Air-interface protocols of EPCglobal applied to RFID system in UHF band are analyzed, and the standard anticollision algorithms are realized. Also, the improved anticollision algorithms of the Class-1 Generation-1 and Generation-2 protocol are proposed and the performances of anticollision algorithms are compared. As the results, reduction ratio of total tag recognition time of the improved Generation-1 algorithm is 54.5% for 100 tags and 63.4% for 1000 tags with respect to standard algorithm, respectively. And the reduction ratio of the improved Generation-2 algorithm is 7.9% for 100 tags and 11.7% for 1000 tags. Total recognition times of the improved algorithms are shorter than those of standard algorithms according to increasing the number of tag. Therefore, the improved anticollision algorithm proposed in this paper is the advanced method improving the performance of tag recognition in the RFID system.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.9-15
• /
• 1994

This paper proposes a image compression algorithm which stores and transmites image data efficiently. The proposed compression algorithm modify enhances compression rate by modified ZIG-ZAG Scanning in JPEG standard algorithm which is based on 2D-DCT. And the up-compatible method of proposed algorithm can solve compatible problem with JPEG that is cased by modified ZIG-ZAG Scanning. And this paper presentes a block diagram of hardware for real-time processing.