• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.1227-1232
• /
• 2015

Several works help make sliding window object detection fast, nevertheless, computational demands remain prohibitive for numerous applications. This paper proposes a fast object detection method based on three strategies: cascade classifier, selective window search and fast feature extraction. Experimental results show that the proposed method outperforms the compared methods and achieves both high detection precision and low computation cost. Our approach runs at 17ms per frame on 640×480 images while attaining state-of-the-art accuracy.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.11
• /
• pp.505-513
• /
• 2001

This paper presents the new three-level optimal control scheme for the large scale nonlinear systems, which is based on fast walsh transform. It is well known that optimization for nonlinear systems leads to the resolution of a nonlinear two point boundary value problem which always requires a numerical iterative technique for their solution. However, Three-level costate coordination can avoid two point boundary condition in subsystem. But this method also has the defect that must solve high order differential equation in intermediate level. The proposed method makes use of fast walsh transform, therefore, is simple in computation because of solving algebra equation instead of differential equation.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.57-60
• /
• 2000

This paper presents a new adaptive fast motion estimation algorithm along with its architecture. The conventional algorithm such as full - search algorithm, three step algorithm have some disadvantages which are related to the amount of computation, the quality of image and the implementation of hardware, the proposed algorithm uses spatial correlation and a slope of motion vector in order to reduce the amount of computation and preserve good image quality, The proposed algorithm is better than the conventional Block Matching Algorithm(BMA) with regard to the amount of computation and image quality. Also, we propose an efficient at chitecture to implement the proposed algorithm. It is suitable for real time processing application.

• Journal of Biomedical Engineering Research
• /
• v.22 no.3
• /
• pp.223-229
• /
• 2001

In this paper, we have compared the direct fan-beam reconstruction method with the rebinning method in terms of computation time and spatial resolution using computer simulation. As a result, the direct fan-beam method is superior to the rebinning method in the spatial resolution though the former needs longer computation time. However, if we adopt the quarter-detector-offset technique to improve the spatial resolution, the rebinning method outperforms the direct fan-beam method. The computation times have been evaluated using the fast algorithms optimized to reduce the number of interpolation calculations at the back-projection, and the spatial resolutions have been compared using the computer generated phantoms.

• 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.

• Aerospace Engineering and Technology
• /
• v.8 no.2
• /
• pp.26-32
• /
• 2009

In the satellite image fusion, the most important point is to preserve both the spatial detail of panchromatic(PAN) image and the spectral information of multispectral(MS) image. Among various image fusion techniques, fusion technique using Intensity-Hue-Saturation(IHS) transform is widely used and it has advantage that computation is very simple. In this study, a fusion technique using fast IHS transform and trade-off parameter $\alpha^i$ proposed. Proposed fusion technique permits customization of the trade-off between the spectral information and spatial detail quality of the fused image through the evaluation of two quality indices: a spectral index(the spectral ERGAS) and a spatial one(the spatial ERGAS). Based on the result of experiment using IKONOS image, we confirmed the proposed fusion technique was more effective in preserving spatial detail and spectral information than existing fusion techniques using fast IHS transform.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.4
• /
• pp.21-30
• /
• 2016

Risk management system should be able to support a decision making within a short time to analyze stream data in real time. Many analytical systems consist of CPU computation and disk based database. However, it is more problematic when existing system analyzes stream data in real time. Stream data has various production periods from 1ms to 1 hour, 1day. One sensor generates small data but tens of thousands sensors generate huge amount of data. If hundreds of thousands sensors generate 1GB data per second, CPU based system cannot analyze the data in real time. For this reason, it requires fast processing speed and scalability for analyze stream data. In this paper, we present a fast visualization technique that consists of hybrid database and GPU computation. In order to evaluate our technique, we demonstrate a visual analytics system that analyzes pipeline leak using sensor and tweet data.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.808-815
• /
• 2013

In this paper, we propose a novel fast and low-complexity Motion Estimation (ME) algorithm for Ultra High Definition (UHD) High Efficiency Video Coding (HEVC). Motion estimation occupies 77~81% of the amount of computation in HEVC. After all, the main key of video codec implementation is to find a fast and low-complexity motion estimation algorithm and architecture. We analyze the previous motion estimation algorithms and propose three optimal algorithm to reduce the computation proportion for HEVC. The proposed algorithm uses only 0.36% of the amount of operations compared to full search algorithm while maintaining compression performance with slight loss of 1.1%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.9-15
• /
• 2007

We propose the fast full search algorithm that reduces the computation of the block matching algorithm which is used for motion estimation of the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion pictures. However the proposed method is good for the fast and slow motion because it estimates the motion in the new search order after partitioning the search window. Also, when finding the motion vector, this paper presents the method that reduces the complexity by computing the matching error in the order which is determined by local image complexity. The proposed algorithm reduces the computation up to 99% for block matching error compared with the conventional spiral full search algorithm without any loss of image quality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3103-3120
• /
• 2015

This paper presents a single-phase energy metering chip with built-in calibration function to measure electric power quantities. The entire chip consists of an analog front end, a filter block, a computation engine, a calibration engine, and an external interface block. The key design issues are how to reduce the implementation costs of the computation engine from repeatedly used arithmetic operations and how to simplify calibration procedure and reduce calibration time. The proposed energy metering chip simplifies the computation engine using time-division multiplexed arithmetic units. It also provides a simple and fast calibration scheme by using integrated digital calibration functionality. The chip is fabricated with 0.18-μm six-layer metal CMOS process and housed in a 32-pin quad-flat no-leads (QFN) package. It operates at a clock speed of 4096 kHz and consumes 9.84 mW in 3.3 V supply.