• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.34D no.7
• /
• pp.88-96
• /
• 1997

As the need of automatized system has been increased recently together with the development of industrial and military technologies, the adaptive real-time target detection technologies that can be embedded on vehicles, planes, ships, robots and so on, are hgihly demanded. Accordingly, this paper proposes a novel approach to detect and segment the moving targets using the binary phase extraction joint transform correlator (BPEJTC), the advanced image subtraction filter and convex hull processing. The BPEJTC which was used as a target detection unit mainly for target tracking compensating the camera movement. The target region has been detected by processing the successful three frames using the advanced image subtraction filter, and has become more accurate by applying the developed convex hull filter. As shown by some experimental results, it is expected that the proposed approaches for compensation of the camera movement and segmentationof of target region, can be used for th emissile guiddance, aero surveillance, automatic inspectin system as well as the target detection unit of automatic target recognition system that request adaptive real-time processing.

• Journal of Korea Multimedia Society
• /
• v.19 no.7
• /
• pp.1127-1136
• /
• 2016

Speech enhancement algorithm plays an important role in numerous speech signal processing applications. Over the last few decades, many algorithms have been studied for speech enhancement. The algorithms are based on spectral subtraction, Wiener filter, and subspace method etc. They have good performance of speech enhancement, but the performance can be deteriorated in specific noises or low SNR environment. In this paper, a new speech enhancement algorithms are proposed based on adaptive noise canceller. And the proposed algorithm improved performance of adaptive noise cancelling using 2-D binary mask. From objective experimental index, it is confirmed that the proposed algorithm is useful and has better performance than recently proposed speech enhancement algorithms.

• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.322-331
• /
• 2016

Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.

• The Journal of the Korea Contents Association
• /
• v.2 no.4
• /
• pp.46-50
• /
• 2002

This paper suggests the adaptive binary method which applies advanced silt sum technique, so that threshold value can be changed heuristically according to the brightness of captured fingerprint image. Through this research, we tried to resolve threshold value setting issue by the local differences of brightness of fingerprint image in the binary image preprocessing. The experimental results show that our proposed preprocessing method demonstrates the better recognition accuracy and can be applied to minutiae extraction algorithm for fingerprint recognition system.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.215-224
• /
• 1994

In this paper, the rotation and size invariant fingerprint recognition using the neural network EART (Extended Adaptive Resonance Theory) is studied ($515{\times}512$) gray level fingerprint images are converted into the binary thinned images based on the adaptive threshold and a thinning algorithm. From these binary thinned images, we extract the ending points and the bifurcation points, which are the most useful critical feature points in the fingerprint images, using the $3{\times}3$ MASK. And we convert the number of these critical points and the interior angles of convex polygon composed of the bifurcation points into the 40*10 critical using the weighted code which is invariant of rotation and size as the input of EART. This system produces very good and efficient results for the rotation and size variations without the restoration of the binary thinned fingerprints.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.543-550
• /
• 2000

An adaptive bit-reduced mean absolute difference (ABRMAD) is presented as a criterion for the block-matching algorithm (BMA) to reduce the complexity of the VLSI Implementation and to improve the processing time. The ABRMAD uses the lower pixel resolution of the significant bits instead of full resolution pixel values to estimate the motion vector (MV) by examining the pixels Ina block. Simulation results show that the 4-bit ABRMAD has competitive mean square error (MSE)results and a half less hardware complexity than the MAD criterion, It has also better characteristics in terms of both MSE performance and hardware complexity than the Minimax criterion and has better MSE performance than the difference pixel counting(DPC), binary block-matching with edge-map(BBME), and bit-plane matching(BPM) with the same number of bits.

• International Journal of Contents
• /
• v.11 no.3
• /
• pp.7-13
• /
• 2015

One of the biggest problems of skeletonization is the occurrence of distortions at the junction point of the final binary image. At the junction area, a single point usually becomes a small stroke, and the corresponding trajectory task, as well as the OCR, consequently becomes more complicated. We therefore propose an adaptive post-processing method that uses an adaptive threshold technique to correct the distortions. Our proposed method transforms the distorted segments into a single point so that they are as similar to the original image as possible, and this improves the static handwriting images after the skeletonization process. Further, we attained promising results regarding the usage of the enhanced skeletonized images in other applications, thereby proving the expediency and efficiency of the proposed method.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.1
• /
• pp.113-118
• /
• 2011

This paper proposes computer visual inspection algorithms for PCB defects which are found in a manufacturing process. The proposed method can detect open circuit and short circuit on bare PCB without using any reference images. It performs adaptive threshold processing for the ROI (Region of Interest) of a target image, median filtering to remove noises, and then analyzes connected components of the binary image. In this paper, the connected components of circuit pattern are defined as 6 types. The proposed method classifies the connected components of the target image into 6 types, and determines an unclassified component as a defect of the circuit. The analysis of the original target image detects open circuits, while the analysis of the complement image finds short circuits. The machine vision inspection system is implemented using C language in an embedded Linux system for a high-speed real-time image processing. Experiment results show that the proposed algorithms are quite successful.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.438-441
• /
• 2004

Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.292-298
• /
• 2017

The complexity of image compression algorithms has increased in order to improve image compression efficiency. One way to resolve high computational complexity is parallel processing. However, entropy coding, which is lossless compression, does not fit into the parallel processing form because of the correlation between consecutive symbols. This paper proposes a new application-specific instruction set processor (ASIP) platform by adding new context-adaptive binary arithmetic coding (CABAC) instructions to the existing platform to quickly process a variety of entropy coding. The newly added instructions work without conflicts with all other existing instructions of the platform, providing the flexibility to handle many coding standards with fast processing speeds. CABAC software is implemented for High Efficiency Video Coding (HEVC) and the performance of the proposed ASIP platform was verified with a field programmable gate array simulation.