• Journal of Sensor Science and Technology
• /
• v.19 no.2
• /
• pp.99-111
• /
• 2010

This paper proposes an efficient hardware architecture to estimate disparities between 2D images for generating 3D depth images in a stereo vision system. Stereo matching methods are classified into global and local methods. The local matching method uses the cost functions based on pixel windows such as SAD(sum of absolute difference), SSD(sum of squared difference) and NCC(normalized cross correlation). The NCC-based cost function is less susceptible to differences in noise and lighting condition between left and right images than the subtraction-based functions such as SAD and SSD, and for this reason, the NCC is preferred to the other functions. However, software-based implementations are not adequate for the NCC-based real-time stereo matching, due to its numerous complex operations. Therefore, we propose a fast pipelined hardware architecture suitable for real-time operations of the NCC function. By adopting a block-based box-filtering scheme to perform NCC operations in parallel, the proposed architecture improves processing speed compared with the previous researches. In this architecture, it takes almost the same number of cycles to process all the pixels, irrespective of the window size. Also, the simulation results show that its disparity estimation has low error rate.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.885-888
• /
• 2000

Among the previous searching methods, there are the typical methods such as full search and three-step search, etc. Block motion estimation using exhaustive search is too computationally intensive. To apply in practice, recently proposed fast algorithms have been focused on reducing the computational complexity by limiting the number of searching points. According to the reduction of searching points, the quality performance is aggravated in those algorithms. In this paper, We present a fast and efficient search algorithm for block motion estimation that produces better quality performance and less computational time compared with a three-step search (TSS). Previously the proposed Two Step Search Algorithm (TWSS) by Fang-Hsuan Cheng and San-Nan sun is based on the ideas of dithering pattern for pixel decimation using a part of a block pixels for BMA (Block Matching Algorithm) and multi-candidate to compensate quality performance with several locations. This method has good quality performance at slow moving images, but has bad quality performance at fast moving images. To resolve this problem, the proposed algorithm in this paper considers spatial and temporal correlation using neighbor and previous blocks to improve quality performance. This performance uses neighbor motion vectors and previous motion vectors in addition, thus it needs more searching points. To compensate this weakness, the proposed algorithm uses statistical character of dithering matrix. The proposed algorithm is superior to TWSS in quality performance and has similar computational complexity

• Korean Journal of Remote Sensing
• /
• v.39 no.6_3
• /
• pp.1791-1799
• /
• 2023

The Korea Aerospace Research Institute is responsible for supplying and supporting the utilization of imagery data from the Arirang satellite series for organizations affiliated with the Government Satellite Information Application Consultation. Most of them primarily utilize optical imagery, and there is a relative lack of utilization of Synthetic Aperture Radar (SAR) imagery. In this paper, as part of supporting the use of SAR images, we investigated SAR intensity-based change detection algorithms and their use cases that have been researched to determine SAR intensity-based change detection algorithms to be developed in the future. As a result of the research, we found that various algorithms utilizing intensity difference, correlation coefficients, histograms, or polarimetric information have been researched by numerous researchers to detect and analyze change pixels and the applications of change detection algorithms have been studied in various fields such as a city, flood, forest fire, and vegetation. This study will serve as a reference for the development of SAR change detection algorithms, intended for utilization in the Government Satellite Information Application Consultation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.37-47
• /
• 2009

When H.264 encoded video streams are transmitted over wireless network, packet loss is unavoidable. Responding on this environment, we propose methods to recover missed motion vector in the decoder: At first, A candidate vector set for missing macroblock is estimated from high correlation coefficient of neighboring motion vectors and missing block vectors the algorithm clusters candidate vectors through distances amongst motion vectors of neighboring blocks. Then the optimal candidate vector is determined by the median value of the clustered motion vector set. In next stage, from the candidate vector set, the final candidate vector of missing block is determined it has minimum distortion value considering directions of neighboring pixels' boundary. Test results showed that the proposed algorithm decreases the candidate motion vectors $23{\sim}61%$ and reduces $3{\sim}4sec$ on average processing(decoding) time comparing the existing H.264 codec. The PSNR, in terms of visual quality is similar to existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8C
• /
• pp.583-590
• /
• 2008

In this paper, we present a spatially adaptive post-processing algorithm for H.264 video coding standard to remove blocking artifacts. The loop filter of H.264 increases computational complexity of the encoder. Furthermore it doesn't clearly remove the blocking artifacts, resulting in over-blurring. For overcoming them, we combine the projection method with the Constraint Least Squares(CLS) method to restore the high quality image. To reflect the Human Visual System, we adopt the weight norm CLS method. Particularly pixel location-based local variance and laplacian operator are newly defined for the CLS method. In addition, the fact that correlation among adjoining pixels is high is utilized to constrain the solution space when the projection method is applied. Quantization Index(QP) of H.264 is also used to control the degree of smoothness. The simulation results show that the proposed post-processing filter works better than the loop filter of H.264 and converges more quickly than the CLS method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.113-123
• /
• 2007

In Ubiquitous communication environment, various conversions of images are essential, and most digital images are compressed by standard methods such as the Joint Photographic Expert Group (JPEG) and Motion Picture Expert Group (MPEG) which are based on the discrete cosine transform (DCT). In this paper, various image resizing algorithms in the DCT domain are analyzed, and a new image resizing algorithm, which shows superior performance compared with the conventional methods, is proposed. For arbitrary-ratio image resizing in the DCT domain, several blocks of $8{\times}8$ DCT coefficients are converted into one block using the conversion formula in the proposed algorithm, and the size of the inverse discrete cosine transform (IDCT) is decided optimally. The performance is analyzed by comparing the peak signal to noise ratio (PSNR) between original images and converted images. The performance of the proposed algorithm is better than that of the conventional algorithm, since the correlation of pixels in images is utilized more efficiently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2343-2348
• /
• 2006

Image magnification is among the basic image processing operations. The most commonly used technique for image magnification are based on interpolation method(such as nearest neighbor, bilinear and cubic interpolation). However, the magnified images produced by the techniques that often appear a variety of undesirable image artifacts such as 'blocking' and 'blurring' or too takes the processing time into the several processing for image magnification. In this paper, we propose image magnification method which uses input image's sub-band information such as edge information to enhance the image magnification method. We use the whole image and not use the one's neighborhood pixels to detect the edge information of the image that isn't occurred the blocking phenomenon. And then we emphasized edge information to remove the blurring phenomenon which incited of edge information. Our method, which improves the performance of the traditional image magnification methods in the processing time, is presented. Experiment results show that the proposed method solves the drawbacks of the image magnification such as blocking and blurring phenomenon, and has a higher PSNR and Correlation than the traditional methods.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.592-608
• /
• 2016

Recently, many researches on digital holograms, which retain almost perfect 3 dimensional image information, have been performed actively that it seems for them to be serviced soon. Accordingly, this paper proposes a data compression technique for a digital hologram video for this service. It uses H.265/HEVC, the most recent international 2 dimensional video compression standard, for which we consider various domain transform methods to increase the correlation among the pixels in a digital hologram. Also we consider the various parameters on H.265/HEVC. The purpose of this paper is to find empirically the optimal condition for the domain transform method, the size of transform unit, and the H.265/HEVC parameters. The proposed method satisfying the optimal parameter set found is compared to the existing methods to prove that ours shows better performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.4
• /
• pp.512-517
• /
• 2011

In this paper, we propose an Active Shape Model (ASM) and Lucas-Kanade (LK) optical flow-based feature extraction and analysis method for analyzing the emotional features from facial images. Considering the facial emotion feature regions are described by Facial Action Coding System, we construct the feature-related shape models based on the combination of landmarks and extract the LK optical flow vectors at each landmarks based on the centre pixels of motion vector window. The facial emotion features are modelled by the combination of the optical flow vectors and the emotional states of facial image can be estimated by the probabilistic estimation technique, such as Bayesian classifier. Also, we extract the optimal emotional features that are considered the high correlation between feature points and emotional states by using common spatial pattern (CSP) analysis in order to improvise the operational efficiency and accuracy of emotional feature extraction process.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3692-3697
• /
• 2012

Landsat 7 ETM+ sensor is getting imageries in the SLC-off state since May 31, 2003 due to mechanical defect of SLC(Scan Line Corrector). Therefore additional correction works are required to use these imageries. In this study, Landsat 7 SLC-off imageries were corrected using Gapfill function and compared with Landsat 5 around the same time. Most of pixels in omitted areas due to SLC-off by producing SLC-off imageries and imageries without visual incompatibility could be achieved as there were not unnatural noises. Also, the corrected imageries were performed land cover classification which was compared with the classification result using reference image. To do this, it could be suggested the possibility of SLC-off imagery. Landsat 7 SLC-off corrected imageries will improve the difficult conditions to detect changes of large areas and be used to detect changes of large areas and classify imageries as well as to recover imagery loss arising regionally such as small scale cloud, etc.