• 대한산업공학회지
• /
• 제25권2호
• /
• pp.233-239
• /
• 1999

With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.

• ETRI Journal
• /
• 제43권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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 추계학술대회 논문집
• /
• pp.307-310
• /
• 2000

The measuring method of large object using the pattern matching is discussed in the paper. It is hard and expensive to get the complete 3D data when the object is large or exceeds the limit of measuring devices. The large object is divided into several smaller areas and is scanned several times to get the data of all the pieces. These data are aligned to get the complete 3D data using the pattern matching method. The point pattern matching method and transform matrix algorithm are used for aligning. The laser slit beam and CCD camera is applied for experimental measurement. Visual C++ on Window98 is implemented in processing the algorithm.

• 제어로봇시스템학회논문지
• /
• 제9권9호
• /
• pp.714-719
• /
• 2003

We propose a measuring method of large object using the pattern matching. It is hard and expensive to get the complete 3D data when the object is large and exceeds the limit of measuring devices. The large object is divided into several smaller areas and is scanned several times to get the data of all the pieces. These data are aligned to get the complete 3D data using the pattern matching method such as point pattern matching method and transform matrix algorithm. The laser slit beam and CCD camera are applied for the experimental measurement. Visual C＋＋ on Windows 98 is implemented in processing the algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.224-241
• /
• 2015

Multiview plus depth (MVD) videos are widely used in free-viewpoint TV systems. The best-known technique to determine depth information is based on stereo vision. In this paper, we propose a novel local stereo matching algorithm which is radiometric invariant. The key idea is to use a combined matching cost of intensity and gradient based similarity measure. In addition, we realize an adaptive cost aggregation scheme by constructing an adaptive support window for each pixel, which can solve the boundary and low texture problems. In the disparity refinement process, we propose a four-step post-processing technique to handle outliers and occlusions. Moreover, we conduct stereo reconstruction tests to verify the performance of the algorithm more intuitively. Experimental results show that the proposed method is effective and robust against local radiometric distortion. It has an average error of 5.93% on the Middlebury benchmark and is compatible to the state-of-art local methods.

• 한국인터넷방송통신학회논문지
• /
• 제8권4호
• /
• pp.67-73
• /
• 2008

마코브 랜덤 필드로 모델링한 마코브 네트워크에서 신뢰확산 알고리즘은 각각의 화소에 대응하는 노드들 사이의 메시지 이동에 의해 동작한다. 신뢰확산 알고리즘은 정확한 결과를 얻기 위해 많은 수의 반복 연산을 요구하게 된다. 본 논문에서는 다해상도 영역에서 신뢰확산 알고리즘을 적용한 스테레오 정합 알고리즘을 제안한다. 웨이브렛 또는 리프팅에 기반한 다해상도 변환은 스테레오 정합 알고리즘에서 탐색 영역을 줄일 수 있는 장점 갖기 때문에 고속의 연산을 통해 변이 영상을 생성할 수 있다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 춘계학술발표대회
• /
• pp.521-524
• /
• 2005

This paper proposes a fusion algorithm which merges multiple vein pattern images into a single image, larger than those images. As a preprocessing step of template matching, during the verification of biometric data such as fingerprint image, vein pattern image of hand, etc., the fusion technique is used to make reference image larger than the candidate images in order to enhance the matching performance. In this paper, a new algorithm, called BSA (Boundary Stitching Algorithm) is proposed, in which the boundary rectilinear parts extracted from the candidate images are stitched to the reference image in order to enlarge its matching space. By applying BSA to practical vein pattern verification system, its verification rate was increased by about 10%.

• 한국통신학회논문지
• /
• 제32권4A호
• /
• pp.379-386
• /
• 2007

본 논문에서는 효율적인 다중 고착 고장 진단 알고리듬을 제안하겠다. 제안하는 고장 진단 알고리듬은 완전일치공통부분을 고장 진단의 중요한 기준으로 사용함으로써 단일 고착 고장 시뮬레이터 환경에서도 다중 고착 고장을 진단할 수 있다. 또한 각 고장간의 식별성을 높여 다중 고착 고장을 진단함에도 불구하고, 고장 후보의 수를 획기적으로 줄일 수 있었다. 이를 위하여 출력단의 수에 따른 가중치 개념과 가산, 감산 연산을 사용하였다. 이 알고리듬은 ISCAS85회로와 완전 주사 스캔이 삽입된 ISCAS89회로에서 실험하여 성능을 입증하였다.

• Nuclear Engineering and Technology
• /
• 제36권3호
• /
• pp.219-228
• /
• 2004

[1] and [2] present an approach to diagnosing possible defects in the mechanical systems of a nuclear power plant. In this paper, by using a fault library as a database and training data, we develop a diagnostic algorithm 1) to decide whether an Air Operated Valve system is sound or not and 2) to identify the defect from which an Air-Operated Valve system suffers, if any. This algorithm is composed of three stages: a neural net stage, a non-neural net stage, and an integration stage. The neural net stage is a simple perceptron, a pattern-recognition module, using a neural net. The non-neural net stage is a simple pattern-matching algorithm, which translates the degree of matching into a corresponding number. The integration stage collects each output and makes a decision. We present a simulation result and confirm that the developed algorithm works accurately, if the input matches one in the database.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.278-281
• /
• 2000

Matching pursuit algorithm is a signal expansion technique whose efficiency for motion compensated residual image has already been demonstrated in the MPEG-4 framework. However, one of the practical concerns related to applying matching pursuit algorithm to real-time scalable video coding is its massive computation required for finding dictionary elements. In this respective, this paper proposes a fast algorithm, which is composed of three sub-methods. The first method utilizes the property of symmetry in 1-D dictionary element and the second uses mathematical elimination of inner product calculation in advance, and the last one uses frequency property of 2-D dictionary. Experimental results show that our algorithm needs about 30% computational load compared to the conventional fast algorithm using separable property of 2-D gabor dictionary with negligible quality degradation.