• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.10a
• /
• pp.35-45
• /
• 2005

Data fusion is method to combination data. The purpose of this study is to design and implementation for street fashion information analysis system using data fusion. It can offer variety and actually information because it can fuse image data and survey data for street fashion. Data fusion method exists exact matching method, judgemental matching method, probability matching method, statistical matching method, data linking method, etc. In this study, we use exact matching method. Our system can be visual information analysis of customer's viewpoint because it can analyze both each data and fused data for image data and survey data.

• Asia pacific journal of information systems
• /
• v.2 no.1
• /
• pp.3-15
• /
• 1992

This paper proposes a new referential model for data retrieval as an alternative to exact matching. While exact matching is an effective data retrieval model, it is based on fairly strict assumptions and limits our capabilities in data retrieval. This study redefines data retrieval to include non-binary data retrieval in addition to binary data retrieval, proposes Double Anchor Preference Model (DAPM), and analyzes its logical charateristics. DAPM supports non-binary data retrieval. Further, it produces the same result as exact matching for the conventional binary data retrieval. These findings show that, at the logical level, the proposed DAPM retains all the desirable features for data retrieval.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.2
• /
• pp.256-264
• /
• 1996

In this paper, the decentralized suboptimal H$_{2}$ filtering problem is considered. An additional term is added to the centralized optimal H$_{2}$ filter so that the whole filter is decentralized. We derive a necessary and sufficient condition for existence of proposed decentralized filters By employing the solution procedure for the exact model matching problem, we obtain a set of decentralized H$_{2}$ filters, and choose a suboptimal filter from this set of decentralized H$_{2}$ filters.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1195-1207
• /
• 2005

In this paper, we describe image matching techniques which is automatically retrieving the exact matching area using geometry-phase information. We proposed a Matching Method which is rapidly estimating the correspondent points between adjacent images that included big-rotation and top-bottom movement element. It is a method that reduce computation quantity to be required to find an exact correspondent position using geometry-phase information of extracted points in images and DT map which set the distance value among feature points and other points on the basis of each feature point of a image. The proposed method shows good performance especially in the part to search a exact correspondent position between adjacent images that included big-rotation and top-bottom movement element.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.10
• /
• pp.1015-1019
• /
• 2010

An extensive research on exact string matching has been done, but there have been few researches on the matching in multi-byte character set texts such as EUC~KR. This paper shows that false matches may occur in multi-byte character set texts such as EUC-KR when using KMP algorithm, and presents a refined KMP algorithm without false matches applying a character-based prefix function. And also, Experimental results show that our algorithm is faster than string matching algorithms of widely used editors, Vim and Emacs, and the existing automata-based algorithm.

• Korean Journal of Remote Sensing
• /
• v.11 no.1
• /
• pp.47-64
• /
• 1995

In this paper, an algorithm that finds man-made structures in a praylevel aerial images is proposed to perform stereo matching. An extracted contour of buildings must have a high accuracy in order to get a good feature-based stereo matching result. Therefore this study focuses on the use of edge following in the original image rather than use of ordinary edge filters. The Algorithm is composed of two main categories; one is to find candidate regions in the whole image and the other is to extract exact contours of each building which each candidate region.. The region growing method using the centroid linkage method of variance value is used to find candidate regions of building and the contour line tracing algorithm based on an adge following method is used to extract exact contours. The result shows that the almost contours of building composed of line segments are extracted.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.267-272
• /
• 2007

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching fur expanding results from an exact matching engine to query the OWL MIT Process Handbook. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We perform retrieval experiments to compare the performance of the devised similarity algorithms.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.34D no.10
• /
• pp.53-59
• /
• 1997

In this paper, we present a 20 GHz low-loss dual-mode channel filter designed by using mode matching method. The performance of dual-mode channel filter mainly depends on iris characteristics. Therefore the exact design of iris is the key point to get good frequncy response of the filter. MOde matching technique is widely used ot design several kinds of waveguide filters because it is simple in theory and can easily calculate the scattering matrices at the discontinuities with simple structure like iris coupled filters. Additionally the effect for finite thickness of the iris in the dual-mode cavity iflter is analyzed by te full-wave method, providing the exact filter implementation without trial and error.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2228-2230
• /
• 1998

This paper presents the development of depth extraction algorithm for the stereoscopic endoscope data using a stereo matching method. generally, the purpose of existing stereo algorithms is to reconstruct stereo object surface and depth map. but the main purpose of our processing is to give exact depth feeling to doctor showing depth information in some points. for this purpose, this paper presents two stereo matching algorithms which are to measure exact depth. one is using variable window, and the other is reference points-based algorithm for a fast processing.