• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.2
• /
• pp.133-138
• /
• 2002

In this paper, we propose an integrated GUI environment of parallel fuzzy inference system fur pattern classification of remote sensing data. In this, as 4 fuzzy variables in condition part and 104 fuzzy rules are used, a real time and parallel approach is required. For frost fuzzy computation, we use the scan line conversion algorithm to convert lines of each fuzzy linguistic term to the closest integer pixels. We design 4 fuzzy processor unit to be operated in parallel by using FPGA. As a GUI environment, PCI transmission, image data pre-processing, integer pixel mapping and fuzzy membership tuning are considered. This system can be used in a pattern classification system requiring a rapid inference time in a real-time.

• Korean Journal of Optics and Photonics
• /
• v.19 no.4
• /
• pp.276-286
• /
• 2008

The representative alignments for taking a stereo image by using a stereoscopic camera are the toed-in and the parallel alignment. In this paper, we tried to find important factors in the process that captures the stereo image by modifying parallel type 3D camera alignment to take the same object information as, for instance, when toed-in type was used. The modified parallel type 3D camera has merits in both types. As a result, three important factors are found by simulation to be inter-camera distance, field of view and convergence angle for both types. And the change of the convergence angle is known to be the most important factor at the stereo fusible area in processing. The effective ranges of these factors to simulate perfectly toed-in type by modified parallel type are strongly dependent on a user's circumstances such as mobile, official, theater and so on. Additionally, the error of the simulation is reduced when the focal length of the stereo camera is short and the convergence angle becomes smaller.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2749-2756
• /
• 2015

Recently, Depending on the quality of data increases, the problem of time-consuming to process the image is raised by being required to accelerate the image processing algorithms, in a traditional CPU and CUDA(Compute Unified Device Architecture) based recognition system for computing speed and performance gains compared to OpenMP When character recognition has been learned by the system to measure the input by the character data matching is implemented in an environment that recognizes the region of the well, so that the font of the characters image learning English alphabet are each constant and standardized in size and character an image matching method for calculating the matching has also been implemented. GPGPU (General Purpose GPU) programming platform technology when using the CUDA computing techniques to recognize and use the four cores of Intel i5 2500 with OpenMP to deal quickly and efficiently an algorithm, than the performance of existing CPU does not produce the rate of four times due to the delay of the data of the partition and merge operation proposed a method of improving the rate of speed of about 3.2 times, and the parallel processing of the video card that processes a result, the sequential operation of the process compared to CPU-based who performed the performance gain is about 21 tiems improvement in was confirmed.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.12
• /
• pp.110-119
• /
• 1996

A novel high speed VLSI architecture and its VLSI realization methodologies for a motion estimation processor based on full search block matching algorithm are presentd. The presented architecture is designed in order to be suitable for highly parallel and pipelined processing with identical PE's and adjustable in performance and hardware amount according to various application areas. Also, the throughput is maximized by enhancing PE utilization up to 100% and the chip pin count is reduced by reusing image data with embedded image memories. Also, the uniform and identical data processing structure of PE's eases VLSI implementation and the clock rate of external I/O data can be made slower compared to internal clock rate to resolve I/O bottleneck problem. The logic and spice simulation results of the proposed architecture are presented. The performances of the proposed architecture are evaluated and compared with other architectures. Finally, the chip layout is shown.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.3 no.3
• /
• pp.151-157
• /
• 2008

In this paper, we propose a three dimensional distance measurement method for a stereo system by using web cams. Using a parallel stereo system, a robot gets two images from each webcam and equalize brightness of both images. And we suggest an image processing method such as labeling, isolating an object from background and finding center of an object. We also propose a method of calculating the focal distance by using least square algorithm based on triangulation and we can reduce calculation error by this method. From experimental results, we show that the proposed method can be effective for 3D distance measurement.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.1
• /
• pp.206-213
• /
• 1996

Third order correlation funciton is to be advantageous to detect unique features embedded in various random signals that are undetectable with second order correlation or power spectrum. In this paper, we will introduce optical modulator which consists of a laser light source, 2-dimensional ultrasonic diffractor cell with signal controlling circuitry, and a CCD camera connected to personal computer for image processing. With this modulator, the third order correlaiton pattern of signal can be immediately obtained at the camera due to parallel nature of optical computing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1109-1116
• /
• 1992

Mathematical morphology, theoretical foundation for morphological filter, is very efficient for the analysis of the geometrical characteristics of signals and systems and is used as a predominant tool for smoothing the data with noise. In this study, H/W design of morphological filter is implemented to process the gray scale dilation and the erosion in the same circuit and to choose the maximum and minimum value by a selector, resulting in their education of the complexity of the circuit and an architecture for parallel processing. The structure of morphological filter consists of the structuring-element block, the image data block, the control block, the ADD block, the MIN/MAX block, etc, and is designed on an one-chip for real time operation.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.3
• /
• pp.39-52
• /
• 2009

Scale Invariant Feature Transform (SIFT) is an effective algorithm in object recognition, panorama stitching, and image matching, however, due to its complexity, real time processing is difficult to achieve with software approaches. This paper proposes using a reconfigurable hardware processor with integer half kernel. The integer half kernel Gaussian reduces the Gaussian pyramid complexity in about half [] and the reconfigurable processor carries out a parallel implementation of a full search Fast SIFT algorithm. We use a low memory, fine grain single instruction stream multiple data stream (SIMD) pixel processor that is currently being developed. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and I/O capabilities of the processor which results in a system that can perform real time image and video compression. We apply this novel implementation to images and measure the effectiveness. Experimental simulation results indicate that the proposed implementation is capable of real time applications.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.163-169
• /
• 2017

There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.147-148
• /
• 2010

Recently, advancement in the visual technology has lead to the further development of the three dimensional (3D) imaging systems. The visual perception to view a pair of images simultaneously, is a crucial factor to build a stereoscopic 3D image. In this paper, we present the depth cues between the intensities of the two images when viewing with both eyes. Due to this stereoscopic effect, objects at different distances from the eyes differ in their horizontal positions, giving the depth cue of horizontal disparity. By simple image processing technique, we also present the binocular disparity map between the two images. A median filter has been used to filter out all the noises occurring in the disparity map image.