• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.2
• /
• pp.251-254
• /
• 2016

An energy-efficient object matching accelerator is proposed for mobile object recognition based on matching prediction scheme. Conventionally, vocabulary tree has been used to save the external memory bandwidth in object matching process but involved massive internal memory transactions to examine each object in a database. In this paper, a novel object matching accelerator is proposed based on matching predictions to reduce unnecessary internal memory transactions by mitigating non-target object examinations, thereby improving the energy-efficiency. Experimental results show a 26% reduction in power-delay product compared to the prior art.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.78-86
• /
• 2014

Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.

• Journal of Information Processing Systems
• /
• v.8 no.3
• /
• pp.389-398
• /
• 2012

Texture is an important visual feature for image analysis. Many approaches have been proposed to model and analyze texture features. Although these approaches significantly contribute to various image-based applications, most of these methods are sensitive to the changes in the scale and orientation of the texture pattern. Because textures vary in scale and orientations frequently, this easily leads to pattern mismatching if the features are compared to each other without considering the scale and/or orientation of textures. This paper suggests an Orientation Matching Scheme (OMS) to ease the problem of mismatching rotated patterns. In OMS, a pair of texture features will be compared to each other at various orientations to identify the best matched direction for comparison. A database including rotated texture images was generated for experiments. A synthetic retrieving experiment was conducted on the generated database to examine the performance of the proposed scheme. We also applied OMS to the similarity computation in a K-means clustering algorithm. The purpose of using K-means is to examine the scheme exhaustively in unpromising conditions, where initialized seeds are randomly selected and algorithms work heuristically. Results from both types of experiments show that the proposed OMS can help improve the performance when dealing with rotated patterns.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.92.3-92
• /
• 2002

A lot of localization algorithms have been developed in order to achieve autonomous navigation. However, most of localization algorithms are restricted to certain conditions. In this paper, Monte Carlo localization scheme with a map-matching algorithm is suggested as a robust localization method for the Public Service Robot to accomplish its tasks autonomously. Monte Carlo localization can be applied to local, global and kidnapping localization problems. A range image based measure function and a geometric pattern matching measure function are applied for map matching algorithm. This map matching method can be applied to both polygonal environments and un-polygonal environments and achieves...

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.423-425
• /
• 2003

In this paper, we propose a new scheme for matching specified areas in a satellite image, which is a very efficient method because it can be effectively applied to images that have various features. These features may include different spatial resolution and brightness; sometimes they may different geometrical property. The proposed method can be applied to some application fields such as mosaicing of satellite imagery, GCP matching.

• Current Optics and Photonics
• /
• v.5 no.4
• /
• pp.458-465
• /
• 2021

Borate nonlinear optical crystals have been used as frequency conversion devices in many fields due to their unique transparency and nonlinearity from ultraviolet to visible spectral range. In this study, we theoretically and numerically investigate the properties of broadband second harmonic generation (SHG) in the recently reported Pna2₁-Ba₃Mg₃(BO₃)₃F₃ (BMBF) crystal. The technique is based on the simultaneous achievement of birefringence phase matching and group velocity matching between interacting waves. We discussed all factors required for broadband SHG in the BMBF in terms of two types of phase matching and group velocity matching conditions, the beam propagation direction and the corresponding effective nonlinearity and spatial walk-off, and the spectral responses. The results show that bandwidths calculated in the broadband SHG scheme are 220.90 nm (for Type I) and 165.85 nm (for Type II) in full-width-half-maximum (FWHM). The central wavelength in each case is 2047.76 nm for Type I and 1828.66 nm for Type II at room temperature. The results were compared with the non-broadband scheme at the telecom C-band.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.1-8
• /
• 1994

In this paper, we propose an efficient two-step pattern matching method which promises shape distortion-tolerant recognition of handwritten of handwritten Hangul syllables. In the first step, nonlinear shape normalization is carried out to compensate for global shape distortions in handwritten characters, then a preliminary classification based on simple pattern matching is performed. In the next step, nonlinear pattern matching which achieves best matching between input and reference pattern is carried out to compensate for local shape distortions, then detailed classification which determines the final result of classification is performed. As the performance of recognition systems based on pattern matching methods is greatly effected by the quality of reference patterns. we construct reference patterns by combining the proposed nonlinear pattern matching method with a well-known averaging techniques. Experimental results reveal that recognition performance is greatly improved by the proposed two-step pattern matching method and the reference pattern construction scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.1
• /
• pp.27-37
• /
• 2011

The IDS/IPS(Intrusion Detection/Prevention System) has been widely deployed to protect the internal network against internet attacks. Reducing the packet inspection time is one of the most important challenges of improving the performance of the IDS/IPS. Since the IDS/IPS needs to match multiple patterns for the incoming traffic, we may have to apply the multiple pattern matching schemes, some of which use finite automata, while the others use the shift table. In this paper, we first show that the performance of those schemes would degrade with various kinds of pattern sets and payload, and then propose a hybrid multiple pattern matching scheme which combines those two schemes. The proposed scheme is organized to guarantee an appropriate level of performance in any cases. The experimental results using real traffic show that the time required to do multiple pattern matching could be reduced effectively.

• Journal of Information Display
• /
• v.5 no.4
• /
• pp.31-37
• /
• 2004

In this paper, an effective method for reconstruction of stereoscopic image pair through the regularized adaptive disparity estimation is proposed. Although the conventional adaptive disparity window matching can sharply improve the PSNR of a reconstructed stereo image, but there still exist some problems of overlapping between the matching windows and disallocation of the matching windows, because the size of the matching window tend to changes adaptively in accordance with the magnitude of the feature values. In the proposed method, the problems relating to the conventional adaptive disparity estimation scheme can be solved and the predicted stereo image can be more effectively reconstructed by regularizing the extimated disparity vector with the neighboring disparity vectors. From the experimental results, it is found that the proposed algorithm show improvements the PSNR of the reconstructed right image by about 2.36${\sim}$2.76 dB, on average, compared with that of conventional algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.659-664
• /
• 1994

In this paper we deal with a synthesis of flight control system via nonlinear model matching theory. First, the longitudinal and lateral-directional equations of aircraft motion an CCV mode are considered except the assumption "variations on steady straight flight due to disturbances are very small". Next, a design method of the dynamic model matching control system based on Hirschorn's Algorithm is proposed to the above nonlinear system. Finally, the proposed control system is applied to the small sized, high speed aircraft, T-2 on CCV mode and numerical simulations are shown to justify the proposed scheme.ed scheme.