• Journal of Korea Multimedia Society
• /
• v.22 no.3
• /
• pp.374-385
• /
• 2019

A Web Crawler is a program, which is commonly used by search engines to find the new brainchild on the internet. The use of crawlers has made the web easier for users. In this paper, we have used unstructured data by structuralization to collect data from the web pages. Our system is able to choose the word near our keyword in more than one document using unstructured way. Neighbor data were collected on the keyword through word2vec. The system goal is filtered at the data acquisition level and for a large taxonomy. The main problem in text taxonomy is how to improve the classification accuracy. In order to improve the accuracy, we propose a new weighting method of TF-IDF. In this paper, we modified TF-algorithm to calculate the accuracy of unstructured data. Finally, our system proposes a competent web pages search crawling algorithm, which is derived from TF-IDF and RL Web search algorithm to enhance the searching efficiency of the relevant information. In this paper, an attempt has been made to research and examine the work nature of crawlers and crawling algorithms in search engines for efficient information retrieval.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.122-133
• /
• 1999

Uses can share information and use resources effectively by using TCP/IP-based networks. So, a protocol to manage complex networks effectively is needed. For the management of the distributed networks, the SNMP(Simple Network Management Protocol) has been adopted as an international standard in 1989, and the SNMPv2 in which a security function was added was published in 1993. There are two encryption schemes in SNMPv2, the one is a DES using symmetric encryption scheme and the other is a MD5(Message Digest5) hash function for authentication. But the DES has demerits that a key length is a few short and the encryption and the authentication is executed respectively. In order to solve these problems, wer use a RSA cryptography in this paper. In this paper, we examine the items related with SNMP. In addition to DES and MD5 propose in SNMPv3, we chance security functionality by adopting RSA, a public key algorithm executing the encryption and the authentication simultaneously. The proposed SNMPv3 security module is written in JAVA under Windows NT environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.113-120
• /
• 2004

In this paper, we propose an efficient feature extraction and image retrieval algorithm for content-based retrieval method. First, we extract the object using Gaussian edge detector for input image which is key frames of MPEG video and extract the object features that are location feature, distributed dimension feature and invariant moments feature. Next, we extract the characteristic color feature using the proposed HAQ(Histogram Analysis md Quantization) algorithm. Finally, we implement an retrieval of four features in sequence with the proposed matching method for query image which is a shot frame except the key frames of MPEG video. The purpose of this paper is to propose the novel content-based image retrieval algerian which retrieves the key frame in the shot boundary of MPEG video belonging to the scene requested by user. The experimental results show an efficient retrieval for 836 sample images in 10 music videos using the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12B
• /
• pp.1766-1774
• /
• 2010

This paper proposes a real-time algorithm of recognizing speed limit signs for intelligent vehicles. Contrary to previous works which use all the pixel values in the ROI (Region Of Interest) after preprocessing image at ROI and need a lot of operations, the proposed algorithm uses fewer DCT coefficients in the ROI as features of each image to reduce the number of operations. Choosing a portion of DCT coefficients which satisfy discriminant criteria for recognition, the proposed algorithm recognizes the speed limit signs using the information obtained in the selected features through LDA and MD. It selects one having the highest probability among the recognition results calculated by accumulating the classification results of consecutive individual frames. Experimental results show that the recognition rate for consecutive frames reaches to 100% with test images. When compared with the previous algorithm, the numbers of multiply and add operations are reduced by 58.6% and 38.3%, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.296-306
• /
• 2003

In this paper, algorithm for non-iterative decoding method is proposed and fractal image decoder based on non-iterative fractal decoding algorithm used general purpose digital signal processors is designed and implemented. The algorithm is showed that the attractor image can be obtained analytically whe n the image is encoded using the fractal algorithm proposed by Monro and Dudbridge, in which the corresponding domain block for a range block is fifed. Using the analytical formulas, we can obtain the attractor image without iteration procedure. And we get general formulas of obtained analytical formulas. Computer simulation results for various test images show that we can increase the image decoding speed by more than five times when we use the analytical formulas compared to the previous iteration methods. The fractal image decoder contains two ADSP2181's and perform image decoding by three stage pipeline structure. The performance tests of the implemented decoder is elapsed 31.2ms/frame decoding speed for QCIF data when all the frames are decoded. The results enable us to process the real-time fractal decoding over 30 frames/sec.

• Journal of the Korean GEO-environmental Society
• /
• v.25 no.4
• /
• pp.13-20
• /
• 2024

In this paper, a parallel analysis algorithm for Smoothed Particle Hydrodynamics (SPH), one of the numerical methods for fluidic materials, is introduced. SPH, which is a meshless method, can represent the behavior of a continuum using a particle-based approach, but it demands substantial computational resources. Therefore, parallel analysis algorithms are essential for SPH simulations. The domain decomposition algorithm, which divides the computational domain into partitions to be independently analyzed, is the most representative method among parallel analysis algorithms. In Discrete Element Method (DEM) and Molecular Dynamics (MD), the Cartesian coordinate-based domain decomposition method is popularly used because it offers advantages in quickly and conveniently accessing particle positions. However, in SPH, it is important to share particle information among partitioned domains because SPH particles are defined based on information from nearby particles within the smoothing length. Additionally, maintaining CPU load balance is crucial. In this study, a highly parallel efficient algorithm is proposed to dynamically minimize the size of orthogonal domain partitions to prevent excess CPU utilization. The efficiency of the proposed method was validated through numerical analysis models. The parallel efficiency of the proposed method is evaluated for up to 30 CPUs for fluidic models, achieving 90% parallel efficiency for up to 28 physical cores.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.2
• /
• pp.120-125
• /
• 2014

Conventional handheld metal detectors use a single induction coil to detect the metallic parts of explosive objects, and the detector generates an acoustic signal from its magnetic response to a metallic object so that an operator can confirm the existence of mines. Though metal detectors have very useful detection mechanisms to find mines, it is easy to cause a high false alarm ratio due to the detection of non-explosive metallic items such as cans, nails and other pieces of metal, etc. Also, because of the physical characteristic of a metal detector it is hard to detect non-metallic objects such as mines made of wood or plastic. Furthermore, the operator must move it to the left and right slowly and repeatedly to attain enough sensor signals to confirm the existence of mines using only a monotonous acoustic signal. To resolve the disadvantages of handheld detectors, many new approaches have been attempted, such as an arrayed detector and a visualization algorithm based on metal/non-metal sensor. In this paper, we introduce a visualization algorithm with a metal/non-metal complex sensor, an arrayed metal/non-metal sensor and the their testing and evaluation.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2017.04a
• /
• pp.42-42
• /
• 2017

Prediction of rice yield during a growing season would be very helpful to magnify rice yield as it also allows better farm practices to maximize yield with greater profit and lesser costs. UAV imagery based automatic detection of rice can be a relevant solution for early prediction of yield. So, we propose an image processing technique to predict rice yield using low altitude UAV images. We proposed $L^*a^*b^*$ color space based image segmentation algorithm. All images were captured using UAV mounted RGB camera. The proposed algorithm was developed to find out rice grain area from the image background. We took RGB image and applied filter to remove noise and converted RGB image to $L^*a^*b^*$ color space. All color information contain in both $a^*$ and $b^*$ layers and by using k-mean clustering classification of these colors were executed. Variation between two colors can be measured and labelling of pixels was completed by cluster index. Image was finally segmented using color. The proposed method showed that rice grain could be segmented and we can recognize rice grains from the UAV images. We can analyze grain areas and by estimating area and volume we could predict rice yield.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.73-81
• /
• 2006

This paper proposes the improved orthogonal projection method as a new technique advancing the performance of the acoustic echo canceller. Comparing with the widely used NLMS adaptive algorithm which is simple and stable, it shows that this method has the improvement of the convergence speed for signals with the large auto-correlation, and has small computational quantities. In order to testify performances of the orthogonal projection method whom this paper proposes, we have coded a simulation program md executed computer simulations. We observed convergence curves by using two adaptive algorithm for noises and speeches. From simulation results for two input signals, the proposed method shows the high ERLE and the fast convergence and the stable operation in case of using speeches as well as noises.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.324-326
• /
• 2011

As development of education contents has become more active, it is not much that way to preserve copyright of S/W consuming contents. So this paper studied way to preserve copyright of S/W from MAC address of ethernet and hard disk volume serial number. This study realizes the simple but powerful security algorithm to preserve copyright. So this tightens to preserve copyright of S/W of education contents and will contributes to decrease damages because of using illegal S/W.