• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.124-129
• /
• 2013

This paper proposes a high-performance vector inner product calculation circuit for real-time object recognition based on SVM algorithm. SVM algorithm shows a higher detection rate than other object recognition algorithms. However, it requires a huge amount of computational efforts. Since vector inner product calculation is one of the major operations of SVM algorithm, it is important to implement a high-performance vector inner product calculation circuit for real-time object recognition capability. The proposed circuit adopts the pipeline architecture with six stages to increase the operating speed and makes it possible to recognize objects in real time based on SVM. The proposed circuit was described in Verilog HDL at RTL. For silicon verification, an MPW chip was fabricated using TSMC 180nm standard cell library. The operation of the implemented MPW chip was verified on the test board with test application software developed for the chip verification.

• Korean Journal of Remote Sensing
• /
• v.24 no.6
• /
• pp.641-644
• /
• 2008

In order to improve a camera rotation calculation based on the bundle adjustment in Chon's camera motion (Chon and Shankar, 2007, 2008), this paper introduces a method calculating the camera rotation. It estimates a unit vector in the optical axis of a camera through the angles between the optical axis and vectors passing a camera position and ground control points (GCP). The camera position is estimated by using the inner product method proposed by Chon. The horizontal and vertical unit vectors of the camera are determined by using Yakimovsky and Cunningham's camera model (CAHV) (1978).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.129-137
• /
• 2001

Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.579-583
• /
• 2001

In the area of data clustering in high dimensional space, one of the difficulties is the time-consuming process for computing vector similarities. It becomes worse in the case of the agglomerative algorithm with the group-average link and mean centroid method, because the cluster similarity must be recomputed whenever the cluster center moves after the merging step. As a solution of this problem, we present an incremental method of similarity computation, which substitutes the scalar calculation for the time-consuming calculation of vector similarity with several measures such as the squared distance, inner product, cosine, and minimum variance. Experimental results show that it makes clustering speed significantly fast for very high dimensional data.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1337-1344
• /
• 2016

As the visual effect frequently used in movies or animations, special effects are well suited for the creation of buildings or materials' destruction and collapse scenes. With the relevant programs developing technologically, the adoption of a real-time physically based-system makes it possible to realistically express dynamic simulations. In the large scale, the visual expression of such effects of destroying is satisfying enough, but most common programs of those effects fail to maximize visual effect generated with the cutting of small materials. Besides, to perform a heavy simulation process needs high-performance hardware and programs, where high costs would become a serious issue. For this reason, this paper suggests a solution optimized for the effect of small materials-cutting. The progress of each step shows technologies which trace movement with the state of the completion of the character's motions and then cut the material in real-time, finally led to the very realistic visual effect. Besides, using vector inner calculation to follow the motions of object and to realize cutting effect, this study provides an experiment that constructs visual effect for visualization from the basis of mathematical algorithm and it would be certainly as an educational material used for further researches.