• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.52-53
• /
• 2012

Belief propagation (BP) is a commonly used global energy minimization algorithm for solving stereo matching problem in 3D reconstruction. However, it requires large memory bandwidth and data size. In this paper, we propose a novel memory-efficient algorithm of BP in stereo matching on the Graphics Processing Units (GPU). The data size and transfer bandwidth are significantly reduced by storing only a part of the whole message. In order to maintain the accuracy of the matching result, the local messages are reconstructed using shared memory available in GPU. Experimental result shows that there is almost an order of reduction in the global memory consumption, and 21 to 46% saving in memory bandwidth when compared to the conventional algorithm. The implementation result on a recent GPU shows that we can obtain 22.8 times speedup in execution time compared to the execution on CPU.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.133-142
• /
• 1993

This paper prrsents shape matching of two-dimensional object. This shape matching is applied to two-dimensional simple c10sedcurves represented by polygons. A large number of shape matching procedures have proposed baseed on teh view that shape can be represented by a vector of numerical features, and that this representation can be matched using techniques from statical pattern recognition. The varieties of features that have been extracted from shapes and used to represent them are numerous. But all of these feature-based approches suffer from the shortcoming that the descriptor of a segment of a shape do not ordinarily bear any simple relations hip to the description for the entire shape. We solve the segment matching problem of shape matching, defined as the recognition of a piece of a shape as approximate match to a part of large shape, by using relaxation labeling technique.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.221-228
• /
• 2010

Since string operations were applied to computational biology, security and search for Internet, various data structures and algorithms for computing efficient string operations have been studied. The all-pairs suffix-prefix matching is to find the longest suffix and prefix among given strings. The matching algorithm is importantly used for fast approximation algorithm to find the shortest superstring, as well as for bio-informatics and data compressions. In this paper, we propose an algorithm to find all-pairs suffix-prefix matching using the suffix array, which takes O($k{\cdot}m$)�� time complexity. The suffix array algorithm is proven to be better than the suffix tree algorithm by showing it takes less time and memory through experiments.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.5
• /
• pp.69-75
• /
• 2001

In this paper, a fast and easy impedance matching method, which could give the impedance matching component for the general 1 or 2-port network was introduced. First, the entire network structure was defined which consists of the network part to be matched and the impedance matching part composed of inductors and capacitors. Next, the transmission matrix and input and output impedances of the entire network from the terminal impedance conditions were calculated, then the exact solutions for the matching components were obtained. To verify the efficiency of this method, this method was applied to the CDMA If band withdrawal weighted SAW transversal filter, and investigated the effects of the impedance matching before and after, through the simulation and experiment. As the result, the performance of a fractional bandwidth of 1.2%, insertion loss of 29 dB, and VSWR of 80 have improved to a factional bandwidth of 1.8％, insertion loss of 9 dB, VSWR of 3 at 85.38 MHz center frequency. The result shows that this impedance matching method could be used in the SAW devices and other types of 1 or 2-port network.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.9
• /
• pp.351-358
• /
• 2006

In this paper, DSPOCS(Digital Switchgear-Panel Operation and Control Solution) is designed, which is the intelligent inference based operation and control solution to obtain the safety and reliability of electric power supply in substation based on IED. DSPOCS is designed as a scheduled monitoring and control task and a real-time alarm inference task, and is interlinked with BRES(Bus Reconfiguration Expert System) in the required case. The intelligent alarm inference task consists of the alarm knowledge generation part and the real-time pattern matching part. The alarm knowledge generation part generates automatically alarm knowledge from DB saves it in alarm knowledge base. On the other hand, the pattern matching part inferences the real-time event by comparing the real-time event information furnished from IEDs of substation with the patterns of the saved alarm knowledge base.; Especially, alarm knowledge base includes the knowledge patterns related with fault alarm, the overload alarm and the diagnosis alarm. In order to design the database independently in substation structure, busbar is represented as a connectivity node which makes the more generalized graph theory possible. Finally, DSPOCS is implemented in MS Visual $C^{++}$, MFC, the effectiveness and accuracy of the design is verified by simulation study to the typical distribution substation.

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.113-122
• /
• 2012

This paper presents a new stereo matching technique which is based on the matching of feature windows and feature links. The proposed method uses the FAST feature detector to find image features in stereo images and determines the correspondences of the detected features in the stereo images. We define a feature window which is an image region containing several image features. The proposed technique consists of two matching steps. First, a feature window is defined in a standard image and its correspondence is found in a reference image. Second, the corresponding features between the matched windows are determined by using the feature link technique. If there is no correspondence for an image feature in the standard image, it's disparity is interpolated by neighboring feature sets. We evaluate the accuracy of the proposed technique by comparing our results with the ground truth of in a stereo image database. We also compare the matching accuracy and computation time with two conventional feature-based stereo matching techniques.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.377-382
• /
• 2006

In this paper, two methods based on the use of morphology and pattern matching prior to detect classified defects automatically on the back light unit which is a part of display equipments are proposed. One is the template check method which detects small size defects by using closing and opening method, and the other is the block matching method which detects big size defects by comparing with four regions of uniform blocks. The TC algorithm also can detect defects on the non-uniform pattern of BLU by using revised Otsu method. The proposed method has been implemented on the automatic defect detection system we developed and has been tested image data of BLU captured by the system.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.15 no.4
• /
• pp.274-281
• /
• 2010

This paper proposes a DFPS (Dual Frequency Power Source) impedance matching device for uniformity improvement of a semiconductor plasma etching system. The DFPS consists of two parts for safe plasma processing on large-area substrates. The first part is an ICP (Inductively Coupled Plasma) for high integration by using ferrite core. The second part is a CCP (Capacitive Coupled Plasma) to control uniformity of whole cells. Proposed DFPS can achieve high productivity improvement required for semiconductor equipment industry. The proposed plasma system is analyzed, simulated and experimentally verified with a matching equipment at 27.12MHz and 400kHz.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.115-122
• /
• 2005

The sub-mage matching problem in which one image contains some part of the other image, has been mostly investigated on natural images. In this paper, we propose two sub-image matching techniques: mesh-based method and correlation-based method, that are efficiently used to match text images. Mesh-based method consists of two stages, box alignment and similarity measurement by extracting the mesh feature from the two images. Correlation-based method determines the similarity using the correlation of the two images based on FFT function. We have applied the two methods to the text verification in a postal automation system and observed that the accuracy of correlation-based method is $92.7\%$ while that of mesh-based method is $90.1\%$.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.445-452
• /
• 2002

In Korean-English mixed documents, translated technical words are usually used with the attached full words or original words enclosed with parenthesis. In this paper, a collective method is presented to recognize and extract the translation phrases with using a base translation dictionary. In order to process the unregistered title words and translation words in the dictionary, a phonetic similarity matching method, a translation partial matching method, and a compound word matching method are newly proposed. The experiment result of each method was measured in F-measure(the alpha is set to 0.4) ; exact matching of dictionary terms as a baseline method showed 23.8%, the hybrid method of translation partial matching and phonetic similarity matching 75.9%, and the compound word matching method including the hybrid method 77.3%, which is 3.25 times better than the baseline method.