• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.1
• /
• pp.55-63
• /
• 1998

This paper presents a new maching algorithm by Hopfield Neural Network for 3-D object recognition. In the proposed method, a model object is represented by a set of polygons in a single coordinate. And each polygon is described by a set of features; feature attributes. In case of 3-D object recognition, the scale and poses of the object are important factors. So we propose a strategy for 3-D object recognition independently to its scale and poses. In this strategy, the respective features of the input or the model objects are changed to the startegical constants when they are compared with one another. Finally, we show that the proposed method has a robustness through the results of experiments which included the classification of the input objects and the matching sequence to its 3-D rotation and scale.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.77-83
• /
• 1997

We present a fast adaptive block matching algorithm using variable search area and subsampling to estimate motion vector more exactly. In the presented method, the block is classified into one of three motion categories: zero motion vector block, medium-motion bolck or high-motion block according to mean absolute difference of the block. By the simulation, the computation amount of the presented methoe comparable to three step search algorithm and new three step search algorithm. In the fast image sequence, the PSNR of our algorithm increased more than TSS and NTSS, because our algorithm estimated motion vector more accurately.

• Genomics & Informatics
• /
• v.4 no.2
• /
• pp.65-70
• /
• 2006

Peptide mass mapping is the matching of experimentally generated peptides masses with the predicted masses of digested proteins contained in a database. To identify proteins by matching their constituent fragment masses to the theoretical peptide masses generated from a protein database, the peptide mass fingerprinting technique is used for the protein identification. Thus, it is important to know the theoretical mass distribution of the database. However, few researches have reported the peptide mass distribution of a database. We analyzed the peptide mass distribution of non-redundant protein sequence database in the NCBI after digestion with 15 different types of enzymes. In order to characterize the peptide mass distribution with different digestion enzymes, a power law distribution (Zipfs law) was applied to the distribution. After constructing simulated digestion of a protein database, rank-frequency plot of peptide fragments was applied to generalize a Zipfs law curve for all enzymes. As a result, our data appear to fit Zipfs law with statistically significant parameter values.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2007.11a
• /
• pp.508-509
• /
• 2007

For the safty driving of an automobile which is become individual requisites, a new Neural Network algorithm which recognized the load vehicles in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. The most reliable algorithm derived for real time recognition of vehicles, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates.

• Journal of Korea Multimedia Society
• /
• v.24 no.6
• /
• pp.796-804
• /
• 2021

In computer vision, visual tracking method addresses the problem of localizing an specific object in video sequence according to the bounding box. In this paper, we propose a tracking method by introducing the feature correlation comparison into the siamese network to increase its matching identification. We propose a way to compute location of object to improve matching performance by a correlation operation, which locates parts for solving the searching problem. The higher layer in the network can extract a lot of object information. The lower layer has many location information. To reduce error rate of the object center point, we built a siamese network that extracts the distribution and location information of target objects. As a result of the experiment, the average center error rate was less than 25%.

• The Journal of the Korea Contents Association
• /
• v.17 no.3
• /
• pp.42-52
• /
• 2017

Panorama image is a single image obtained by combining images taken at several viewpoints through matching of corresponding points. Existing panoramic image generation methods that find the corresponding points are extracting local invariant feature points in each image to create descriptors and using descriptor matching algorithm. In the case of video sequence, frames may be a lot, so therefore it may costs significant amount of time to generate a panoramic image by the existing method and it may has done unnecessary calculations. In this paper, we propose a method to quickly create a single panoramic image from a video sequence. By assuming that there is no significant changes between frames of the video such as in locally, we use the FAST algorithm that has good repeatability and high-speed calculation to extract feature points and the Lucas-Kanade algorithm as each feature point to track for find the corresponding points in surrounding neighborhood instead of existing descriptor matching algorithms. When homographies are calculated for all images, homography is changed around the center image of video sequence to warp images and obtain a planar panoramic image. Finally, the spherical panoramic image is obtained by performing inverse transformation of the spherical coordinate system. The proposed method was confirmed through the experiments generating panorama image efficiently and more faster than the existing methods.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.381-396
• /
• 2003

Subsequence matching is an operation that finds subsequences whose changing patterns are similar to a given query sequence from time-series databases. This paper points out the performance bottleneck in subsequence matching, and then proposes an effective method that improves the performance of entire subsequence matching significantly by resolving the performance bottleneck. First, we analyze the disk access and CPU processing times required during the index searching and post processing steps through preliminary experiments. Based on their results, we show that the post processing step is the main performance bottleneck in subsequence matching, and them claim that its optimization is a crucial issue overlooked in previous approaches. In order to resolve the performance bottleneck, we propose a simple but quite effective method that processes the post processing step in the optimal way. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancy of disk accesses and CPU processing occurred in the post processing step. We formally prove that our method is optimal and also does not incur any false dismissal. We show the effectiveness of our method by extensive experiments. The results show that our method achieves significant speed-up in the post processing step 3.91 to 9.42 times when using a data set of real-world stock sequences and 4.97 to 5.61 times when using data sets of a large volume of synthetic sequences. Also, the results show that our method reduces the weight of the post processing step in entire subsequence matching from about 90% to less than 70%. This implies that our method successfully resolves th performance bottleneck in subsequence matching. As a result, our method provides excellent performance in entire subsequence matching. The experimental results reveal that it is 3.05 to 5.60 times faster when using a data set of real-world stock sequences and 3.68 to 4.21 times faster when using data sets of a large volume of synthetic sequences compared with the previous one.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.4
• /
• pp.419-426
• /
• 1999

A novel motion analysis system is presented in this paper. The proposed system is inspired by processing functions observed in the fly visual system, which detects changes in input light intensities, determines motion on both the local and the wide-field levels. The system has several differences from conventional motion analysis system. First, conventional systems usually focused on matching similar feature or optical flow, but neural network is applied in this system. Back propagation is used by learning method, and Tine Delay Neural Network (TDNN) is also used as analysis method. Second, while conventional systems usually limited on only two frames of sequence, the proposed system accept multiple frames of sequence. The experimental results showed a 94.7% correct rate with a speed of 71.47 milli seconds for real and synthetic images.

• Nuclear Engineering and Technology
• /
• v.28 no.5
• /
• pp.467-481
• /
• 1996

An integrated framework of modeling the human operator cognitive behavior during nuclear power plant accident scenarios is presented. It incorporates both plant and operator models. The basic structure of the operator model is similar to that of existing cognitive models, however, this model differs from those existing ones largely in too aspects. First, using frame and membership function, the pattern matching behavior, which is identified as the dominant cognitive process of operators responding to an accident sequence, is explicitly implemented in this model. Second, the non-task-related human cognitive activities like effect of stress and cognitive biases such as confirmation bias and availability bias, are also considered. A computer code, OPEC is assembled to simulate this framework and is actually applied to an SGTR sequence, and the resultant simulated behaviors of operator are obtained.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.158-173
• /
• 1993

The formulated mechanization packages for grain maize production have performed to the expected limit generating encouraging information. Besides physical feasibility , management factors viz ; production operation sequence, operations scheduling and machinery matching with respect to environment can still limit system suitability. A new production operation sequence was introduced to overcome weed problems and limitations of available working days. Proper operations scheduling will improve the initial soil-crop environment for better seedling establishment, and reduce the (). been identified as key factors to reduce capital investment and cost of proudction .