• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.11
• /
• pp.152-161
• /
• 1996

This paper descrisbes the implementation of a 20D DCT that can be used for video conference, JPEG, and MPEG-related applications. The implemented DCT consists of two 1-D DCTs and a transposed memory between them, and uses ROM-based multipliers instead of conventional ones. As the system bit length, the minimum bit length that satisfies the accuracy specified by the ITU standard H.261 was chosen through the simulations using the C language. The proposed design uses a dual port RAM for the transposed memory, and processes two bits of input-pixel data simultaneously t ospeed up addition process using two sets of ROMs. The basic system architecture was designed using th Synopsys schematic editor, and internal modules were described in VHDL and synthesized to logic level after simulation. Then, the compass silicon compiler was used to create the final lyout with 0.8um CMOS libraries, using the standard cell approach. The final layout contains about 110, 000 transistors and has a die area of 4.68mm * 4.96mm, and the system has the processing speed of about 50M pixels/sec.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.6
• /
• pp.25-32
• /
• 1994

A new projection-based approach derived from the Radon transform for detecting and estimating 3-D locations of unresolved targets in a time-sequential set of infrared imageries is presented. Since the signal-to-noise ration per pixel is very low (a dim target) and target tracks which span over many image frames. Since the 2-D multiple representations along arbitary orientations utilizing the 3-D Radon transform, our projection-based transform method enables us to analyze the 3-D problem in terms of its 2-D projections. Our method not only alleviates the great computatioonal expense of processing entire set of images as a whole, but the results reveal that the proposed strategy produces a robust detection and estimation of 3-D target trajectories event at low SNRs.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.8 no.4 s.23
• /
• pp.110-119
• /
• 2005

In this paper, a new detection algorithm was proposed for finding the position of lenslet array spot pattern used to acquire laser wavefront. Based on the analysis of the required signal processing characteristics, we categorized into and designed four main signal processing functions. The proposed was designed in order to have robust feature against a variation of geometrical form of the spot and also implemented to have semi-automatic thresholding capability based on CCD noise analysis. For performance evaluation, we made qualitative and quantitative comparisons with Carvalho's algorithm which has been published in recent. In the given experimental spot images, the proposed could detect the spots which has 1/3 times lower than the least S/N of which Carvalho's can detect and could reach to a detection precision of 0.1 pixel at the S/N. In functional aspect, the proposed could separate all valid spots locally. From these results, the proposed could have a superior precision of location detection of spot pattern in wider S/N range.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.631-643
• /
• 2016

Due to the block-based discrete cosine transform (BDCT), JPEG compressed images usually exhibit blocking artifacts. When the bit rates are very low, blocking artifacts will seriously affect the image's visual quality. A bilateral filter has the features for edge-preserving when it smooths images, so we propose an adaptive-weighted bilateral filter based on the features. In this paper, an image-deblocking scheme using this kind of adaptive-weighted bilateral filter is proposed to remove and reduce blocking artifacts. Two parameters of the proposed adaptive-weighted bilateral filter are adaptive-weighted so that it can avoid over-blurring unsmooth regions while eliminating blocking artifacts in smooth regions. This is achieved in two aspects: by using local entropy to control the level of filtering of each single pixel point within the image, and by using an improved blind image quality assessment (BIQA) to control the strength of filtering different images whose blocking artifacts are different. It is proved by our experimental results that our proposed image-deblocking scheme provides good performance on eliminating blocking artifacts and can avoid the over-blurring of unsmooth regions.

• Korean Journal of Remote Sensing
• /
• v.10 no.2
• /
• pp.133-160
• /
• 1994

In this paper, we propose a comprehensive geometric correction algorithm of Along Track Scanning Radiometer(ATSR) images. The procedure consists of two cascaded modules; precorrection and fine co-location. The pre-correction algorithm is based on the navigation model which was derived in mathematical forms. This model was applied for correction raw(un-geolocated) ATSR images. The non-systematic geometric errors are also introduced as the limitation of the geometric correction by this analytical method. A fast and automatic algorithm is also presented in the paper for co-locating nadir and forward views of the ATSR images by using a binary cross-correlation matching technique. It removes small non-systematic errors which cannot be corrected by the analytic method. The proposed algorithm does not require any auxiliary informations, or a priori processing and avoiding the imperfect co-registratio problem observed with multiple channels. Coastlines in images are detected by a ragion segmentation and an automatic thresholding technique. The matching procedure is carried out with binaty coastline images (nadir and forward), and it gives comparable accuracy and faster processing than a patch based matching technique. This technique automatically reduces non-systematic errors between two views to .$\pm$ 1 pixel.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.154-154
• /
• 2021

Since the development of Bubble Image Velocimetry (BIV) technique as the complementary technique of Particle Image Velocimetry (PIV), the application of digital imaging technique in the field of hydraulic and coastal engineering increased rapidly. BIV works very well in multi-phase flow (air-water) flows where the PIV technique doesn't. However, the velocity field obtained from BIV technique often resulted in a velocity vector on the outside of the flow (false velocity) since the Field of View (FOV) usually not only cover the air-water flow but also the area outside the flow. In this study, a simple technique of post processing velocity field was developed. This technique works based on the average of the pixel value in the interrogation area. An image of multi-phase flow of wave overtopping was obtained through physical experiment using BIV technique. The velocity calculation was performed based on the similar method in PIV. A velocity masking technique developed in this study then applied to remove the false velocity vector. Result from non-masking, manually removed and auto removed false velocity vector were presented. The masking technique show a similar result as manually removed velocity vector. This method could apply in a large number of velocity field which is could increase the velocity map post-processing time.

• Journal of Broadcast Engineering
• /
• v.6 no.2
• /
• pp.139-147
• /
• 2001

Since various noises degrade not only image quality but also compression efficiency in MPEG and H.263, pre-processing is necessary to reduce spatial and temporal noise and to increase ceding efficiency as well. In this paper, we propose a simplified method for noise detection, spatial and temporal noise reduction. Noise detection is based on correlation of the current pixel with its neighboring 4 pixels. Spatial noose reduction utilizes a non-rectangular median filter that is less complex than the conventional rectangular median filter. The proposed temporal filter is an IIR average filter using LUT(Look-up Table) to enhance subjective video quality. The proposed pre-processing method is very simple and efficient.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.23-29
• /
• 2009

Blob detection is an essential ingredient process in some computer applications such as intelligent visual surveillance. However, previous blob detection algorithms are still computationally heavy so that supporting real-time multi-channel intelligent visual surveillance in a workstation or even one-channel real-time visual surveillance in a embedded system using them turns out prohibitively difficult. In this paper, we propose a fast and precise blob detection algorithm for visual surveillance. Blob detection in visual surveillance goes through several processing steps: foreground mask extraction, foreground mask correction, and connected component labeling. Foreground mask correction necessary for a precise detection is usually accomplished using morphological operations like opening and closing. Morphological operations are computationally expensive and moreover, they are difficult to run in parallel with connected component labeling routine since they need much different processing from what connected component labeling does. In this paper, we first develop a fast and precise foreground mask correction method utilizing on neighbor pixel checking which is also employed in connected component labeling so that the developed foreground mask correction method can be incorporated into connected component labeling routine. Through experiments, it is verified that our proposed blob detection algorithm based on the foreground mask correction method developed in this paper shows better processing speed and more precise blob detection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4866-4888
• /
• 2020

One major and time-consuming task in fish production is obtaining an accurate estimate of the number of fish produced. In most Nigerian farms, fish counting is performed manually. Digital image processing (DIP) is an inexpensive solution, but its accuracy is affected by noise, overlapping fish, and interfering objects. This study developed a catfish recognition and counting algorithm that introduces detection before counting and consists of six steps: image acquisition, pre-processing, segmentation, feature extraction, recognition, and counting. Images were acquired and pre-processed. The segmentation was performed by applying three methods: image binarization using Otsu thresholding, morphological operations using fill hole, dilation, and opening operations, and boundary segmentation using edge detection. The boundary features were extracted using a chain code algorithm and Fourier descriptors (CH-FD), which were used to train an artificial neural network (ANN) to perform the recognition. The new counting approach, based on the geometry of the fish, was applied to determine the number of fish and was found to be suitable for counting fish of any size and handling overlap. The accuracies of the segmentation algorithm, boundary pixel and Fourier descriptors (BD-FD), and the proposed CH-FD method were 90.34%, 96.6%, and 100% respectively. The proposed counting algorithm demonstrated 100% accuracy.

• Journal of Korean Society of Transportation
• /
• v.17 no.1
• /
• pp.105-112
• /
• 1999

Image Processing Technique has been used as an efficient method to collect traffic information on the road such as vehicle counts, speed, queues, congestion and incidents. Most of the current methods which have been used to detect vehicles by the image processing are based on point processing, dealing with the local gray level of each pixel in the small window. However, these methods have some drawbacks. Firstly, detection is restricted by image quality. Secondly, they can not deal with occlusion and perspective projection problems, In this research, a new method which possibly deals with occlusion and perspective problems will be proposed. It extracts spatial information such as the position, the relationship of vehicles in 3-dimensional space, as well as vehicle detection in the image. The main algorithm used in this research is based on an extension of the Hough Transform. The Hough Transform which is proposed to estimates parameters of vertices and directed edges analytically on the Hough Space, is a valuable method for the 3-dimensional analysis of static scenes, motion detection and the estimation of viewing parameters.