• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1057-1068
• /
• 2022

This paper compares the combination performance of feature point-based matching algorithms as a study to confirm the matching possibility between image taken by a user and a virtual texture image with the goal of developing mobile-based real-time image positioning technology. The feature based matching algorithm includes process of extracting features, calculating descriptors, matching features from both images, and finally eliminating mismatched features. At this time, for matching algorithm combination, we combined the process of extracting features and the process of calculating descriptors in the same or different matching algorithm respectively. V-World 3D desktop was used for the virtual indoor texture image. Currently, V-World 3D desktop is reinforced with details such as vertical and horizontal protrusions and dents. In addition, levels with real image textures. Using this, we constructed dataset with virtual indoor texture data as a reference image, and real image shooting at the same location as a target image. After constructing dataset, matching success rate and matching processing time were measured, and based on this, matching algorithm combination was determined for matching real image with virtual image. In this study, based on the characteristics of each matching technique, the matching algorithm was combined and applied to the constructed dataset to confirm the applicability, and performance comparison was also performed when the rotation was additionally considered. As a result of study, it was confirmed that the combination of Scale Invariant Feature Transform (SIFT)'s feature and descriptor detection had the highest matching success rate, but matching processing time was longest. And in the case of Features from Accelerated Segment Test (FAST)'s feature detector and Oriented FAST and Rotated BRIEF (ORB)'s descriptor calculation, the matching success rate was similar to that of SIFT-SIFT combination, while matching processing time was short. Furthermore, in case of FAST-ORB, it was confirmed that the matching performance was superior even when 10° rotation was applied to the dataset. Therefore, it was confirmed that the matching algorithm of FAST-ORB combination could be suitable for matching between virtual texture image and real image.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.28-34
• /
• 2012

Various feature extraction algorithms are widely applied to real-time image processing applications for extracting significant features from images. Feature extraction algorithms are mostly combined with image processing algorithms mostly for image tracking and recognition. Feature extraction function is used to supply feature information to the other image processing algorithms and it is mainly implemented in a preprocessing stage. Nowadays, image processing applications are faced with embedded system implementation for a real-time processing. In order to satisfy this requirement, it is necessary to reduce execution time so as to improve the performance. Reducing the time for executing a feature extraction function dose not only extend the execution time for the other image processing algorithms, but it also helps satisfy a real-time requirement. This paper explains FAST (Feature from Accelerated Segment Test algorithm) of E. Rosten and presents FPGA-based embedded hardware accelerator architecture. The proposed acceleration scheme can be implemented by using approximately 2,217 Flip Flops, 5,034 LUTs, 2,833 Slices, and 18 Block RAMs in the Xilinx Vertex IV FPGA. In the Modelsim - based simulation result, the proposed hardware accelerator takes 3.06 ms to extract 954 features from a image with $640{\times}480$ pixels and this result shows the cost effectiveness of the propose scheme.

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

Recently, we can easily create high resolution images with digital cameras for high-performance and make use them at variety fields. Especially, the image stitching method which adjusts couple of images has been researched. Image stitching can be used for military purposes such as satellites and reconnaissance aircraft, and computer vision such as medical image and the map. In this paper, we have proposed fast image stitching based on improved SURF algorithm using meaningful features in the process of images matching after extracting features from scenery image. The features are extracted in each image to find out corresponding points. At this time, the meaningful features can be searched by removing the error, such as noise, in extracted features. And these features are used for corresponding points on image matching. The total processing time of image stitching is improved due to the reduced time in searching out corresponding points. In our results, the processing time of feature matching and image stitching is faster than previous algorithms, and also that method can make natural-looking stitched image.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.2
• /
• pp.315-323
• /
• 1987

Generally, general-purpose image processing system is so expensive that not so many users easily can access the system. In this paper attemps have been made to design and describe a general and economical image processing system for real-time aplications such as image data compression, pattern recognition and target tracking. The system comprises an operator console, image data acquisition/display sistem and IBM PC/XT. The system also utilizes a high speed Fairchild 16-bit microprocessor with ALU speed of 375 nsec for system control, algrithm execution and user computation. The system also can digitize /display a 256x 256x 8 bit image in real time and store two frames of images. All image pixels are directly accessible by the microprocessor for fast and efficient computation. Some experimental and illustrative results such as target tracking are presented to show the efficient performance of the system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2707-2715
• /
• 1999

Recently, there have been researches to automate processing and analysing images in the medical field using image processing technique, a fast communication network, and high performance hardware. In this paper, we propose a system to be able to analyze morphological abnormality of red-blood cells for peripheral blood image using image processing techniques. To do this, we segment red-blood cells in the blood image acquired from microscope with CCD camera and then extract UNL fourier features to classify them into 15 classes. We reduce the number of multi-variate features using PCA to construct a more efficient classifier. Our system has the best performance in recognition rate, compared with two other algorithms, LVQ3 and k-NN. So, we show that it can be applied to a pathological guided system.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.41-51
• /
• 2014

This paper describes a method to estimate the noise power using the minimum statistics approach, which was originally proposed for audio processing. The proposed minimum statistics-based method separates a noisy image into multiple frequency bands using the three-level discrete wavelet transform. By assuming that the output of the high-pass filter contains both signal detail and noise, the proposed algorithm extracts the region of pure noise from the high frequency band using an appropriate threshold. The region of pure noise, which is free from the signal detail part and the DC component, is well suited for minimum statistics condition, where the noise power can be extracted easily. The proposed algorithm reduces the computational load significantly through the use of a simple processing architecture without iteration with an estimation accuracy greater than 90% for strong noise at 0 to 40dB SNR of the input image. Furthermore, the well restored image can be obtained using the estimated noise power information in parametric image restoration algorithms, such as the classical parametric Wiener or ForWaRD image restoration filters. The experimental results show that the proposed algorithm can estimate the noise power accurately, and is particularly suitable for fast, low-cost image restoration or enhancement applications.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.498-503
• /
• 2009

As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.

• Journal of Biosystems Engineering
• /
• v.25 no.5
• /
• pp.409-414
• /
• 2000

A machine vision system was built to obtain single stationary image from an egg. This system includes a CCD camera, an image processing board and a lighting system. A computer program was written to acquire, enhance and get histogram from an image. To minimize the evaluation time, the artificial neural network with the histogram of the image was used for eggshell evaluation. Various artificial neural networks with different parameters were trained and tested. The best network(64-50-1 and 128-10-1) showed an accuracy of 87.5% in evaluating eggshell. The comparison test for the elapsed processing time per an egg spent by this method(image processing and artificial neural network) and by the processing time per an egg spent by this method(image processing and artificial neural network) and by the previous method(image processing only) revealed that it was reduced to about a half(5.5s from 10.6s) in case of cracked eggs and was reduced to about one-fifth(5.5s from 21.1s) in case of normal eggs. This indicates that a fast eggshell evaluation system can be developed by using machine vision and artificial neural network.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.814-817
• /
• 2005

Fast binary dilation and erosion algorithms using run-length encoding (RLE) are proposed. RLE is an alternative way of representing a binary image using a run, which is a sequence of '1' pixels. First, we derive the run-based representation of dilation and erosion and then present the full steps of the proposed algorithms in detail.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.3
• /
• pp.140-147
• /
• 2013

We present a vaguelette-curvelet decomposition based image deblurring algorithm. We first perform denoising based on the hard-thresholding rule by estimating unknown curvelet coefficients. The proposed algorithm then calculates vaguelette functions by deconvolving the curvelet bases by the point spread function. Vaguelette transform is finally performed to make a clearly restored image. Since the proposed algorithm uses the curvelet transform to sensitively express the edges in all directions, it is possible to restore images with more naturally preserved edges in all directions.