• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.107-115
• /
• 2014

The reduced-bit transform based bit-plane matching algorithm (BPM) can obtain the block matching result through its simple calculation and hardware design compared to the conventional block matching algorithms (BMAs), but the block matching accuracy of BPMs is somewhat low. In this paper, reduced-bit transform based sum of the absolute difference (R-SAD) is proposed to improve the block matching accuracy in comparison with the conventional BPMs and it is shown that the matching process can be obtained using the logical operations. Firstly, this method transforms the current and the reference images into their respective 2-bit images and then a truth table is obtained from the relation between input and output 2-bit images. Next, a truth table is simplified by Karnaugh map and the absolute difference is calculated by using simple logical operations. Finally, the simulation results show that the proposed R-SAD can obtain higher accuracy in block matching results compared to the conventional BPMs through the PSNR analysis in the motion compensation experiments.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.115-124
• /
• 2010

Stereo matching techniques are categorized in two major schemes, local and global matching techniques. In global matching schemes, several investigations are introduced, where cost accumulation is performed in multiple matching lines. In this paper, we introduce a new multi-line stereo matching techniques which expands a conventional single-line matching scheme to multiple one. Matching cost is based on simple normalized cross correlation. We expand the scan-line optimization technique to a multi-line scan-line optimization technique. The proposed technique first generates a reliability image, which is iteratively updated based on the previous reliability measure. After some number of iterations, the reliability image is completed by a hole-filling algorithm. The hole-filling algorithm introduces a disparity score table which records the disparity score of the current pixel. The disparity of an empty pixel is determined by comparing the scores of the neighboring pixels. The proposed technique is tested using the Middlebury and CMU stereo images. The error analysis shows that the proposed matching technique yields better performance than using conventional global matching algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.2007-2012
• /
• 2011

To reduce huge computation in the block matching, this paper proposes a fast block matching algorithm which limits search points in the search area. On the basis of two facts that most motion vectors are located in central part of search area and matching error is monotonic decreasing toward the best similar block, the proposed algorithm moves a matching pattern between steps by the one pixel, predicts the motion direction for the best similar block from similar blocks decided in previous steps, and limits movements of search points to ${\pm}45^{\circ}C$ on it. As a result, it could remove the needless search points and reduce the block matching computation. In comparison with the conventional similar algorithms, the proposed algorithm caused the trivial image degradation in images with fast motion but kept the equivalent image quality in images with normal motion, and it, meanwhile, reduced from about 20% to over 67% of the their block matching computation.

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

This paper proposes a new template matching algorithm and its chip design. The CC and SAD algorithms require the massive amount of computation. Hence, several algorithms using quantization schemes have been proposed to reduce the amount of computation and its hardware cost. the proposed algorithm called the EMPPM improves at least 22% of the noise margin compared with the MPPM algorithm. In addition, the proposed architecture can reduce the gate count by more than 60% of that used in the SAD algorithm without usig quantization schemes and 28% of the MPPM algorithm. The VHDL models have been simulated by using the CADANCETEX>$^{TM}$ and logic synthesis has been performed by using the SYNOPSYSTEX>$^{TM}$ with $0.6\mu\textrm{m}$ SOG(sea-of-gate) cell library. The implemented chip consists of 35,829 gates, operates at 100 MHz (worst case 53 MHz) and performs the template maching with the speed of 200 Mpixels/sec.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.1
• /
• pp.54-59
• /
• 2004

We suggest a 3D vision inspection algorithm which is based on the external shape feature. Because many electronic parts have the regular shape, if we have the database of pattern and can recognize the object using the database of the object s pattern, we can inspect many types of electronic parts. Our proposed algorithm uses the geometrical pattern matching method and 3D database on the electronic parts. We applied our suggested algorithm fer inspecting several objects including typical IC and capacitor. Through the experiments, we could find that our suggested algorithm is more effective and more robust to the inspection environment(rotation angle, light source, etc.) than conventional 2D inspection methods. We also compared our suggested algorithm with the feature space trajectory method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.121-128
• /
• 2003

In this paper, we propose a new disparity estimation method called object based block matching algorithm(OBMA) for stereoscopic images which is able to reduce the blocking artifact. In the proposed algorithm, edge information of the given image is first extracted and then we estimate the disparity of each segmented object to remove the blocking artifact. In the experimental results, it is proven that the proposed algorithm has about the same performance as the old BMA algorithm while it achieves much better subjective quality.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.372-379
• /
• 2000

In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.4
• /
• pp.373-382
• /
• 2016

In this study, an EKF (Extended Kalman Filter) based database reference navigation using both gravity gradient and terrain data was performed to complement the weakness of using only one type of geophysical DB (Database). Furthermore, a new algorithm which combines the EKF and profile matching was developed to improve the stability and accuracy of the positioning. On the basis of simulations, it was found that the overall navigation performance was improved by the combination of geophysical DBs except the two trajectories in which the divergence of TRN (Terrain Referenced Navigation) occurred. To solve the divergence problem, the profile matching algorithm using the terrain data is combined with the EKF. The results show that all trajectories generate the stable performance with positioning error ranges between 14m to 23m although not all trajectories positioning accuracy is improved. The average positioning error from the combined algorithm for all nine trajectories is about 18 m. For further study, a development of a switching geophysical DB or algorithm between the EKF and the profile matching to improve the navigation performance is suggested.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Journal of information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.447-451
• /
• 2011

Recently, various in-vehicle networks have been developed respectively in order to accomplish their own purposes such as CAN and MOST. Especially, the MOST network is usually adapted to provide entertainment service. The car navigation system is also widely used for guiding driving paths to driver. The position for the navigation system is usually acquired by GPS technology. However, the GPS technique has two serious problems. The first is unavailability in urban canyons. The second is inherent positional error rate. The problems have been studied in many literatures. However, the second still leads to incorrect locational information in some area, especially parallel roads. This paper proposes a performance tuning method of image matching algorithm for the car navigation system. The method utilizes images obtained from in-vehicle MOST network and a real-time image matching algorithm which determines the direction of moving vehicle in parallel section of road. In order to accuracy improvement of image matching algorithm, three conditions are applied. The experimental tests show that the proposed system increases the accuracy.