• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.37-45
• /
• 2007

We propose an adaptive image enhancement method for epigraphic images, which is based on local statistics. Local statistics of the image are utilized for adaptive realization of the enhancement, that controls the contribution of the smoothing or sharpening paths. Image contrast enhancement occurs in details and noises are suppressed in smooth areas. For modeling the epigraphic image, pre~process is achieved by HSDI(Hanzi squeezed digital image). We have calculated the local statistics from this HSDI model. Application of this approach to HSDI has shown that processing not only smooths the background areas but also improves the subtle variations of edges, so that the word regions can be enhanced. Experimental results show that the proposed algorithm has better performance than the conventional image enhancement ones.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.227-236
• /
• 2001

This paper proposes a frequency-domain partially adaptive algorithm, called a censoring algorithm, to reduce the computational complexity of the frequency domain adaptive array. The proposed censoring algorithm determines the existence of interferences in the frequency-domain at each frequency bin using a constant false alarm rate (CFAR) processor. The censoring algorithm adapts only those parts of the weights that correspond to the frequency bins expected to contain interferences. The censoring algorithm is also expanded to overcome the signal cancellation phenomenon caused by smart jammers. Accordingly, a censoring spatial smoothing, which combines the censoring algorithm with spatial smoothing, is proposed. Simulation results show that the proposed algorithms are effective in removing interferences with only part of the computational complexity of conventional algorithms yet with the same level of performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.16-22
• /
• 2011

This paper presents the multi-object tracking approach using the background difference and particle filtering by monte carlo sampling. We apply particle filters based on probabilistic importance sampling to multi-object independently. We formulate the object observation model by the histogram distribution using color information and the object dynaminc model for the object motion information. Our approach does not increase computational complexity and derive stable performance. We implement the whole Bayesian maximum likelihood framework and describes robust methods coping with the real-world object tracking situation by the observation and transition model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.1-8
• /
• 2006

In this paper, we propose a new post-processing method, based on the theory of the projection onto convex sets (POCS) to reduce the blocking artifacts in decoded images. We propose a few smoothness constraint set (SCS) and its projection operator in the wavelet transform (WT) domain to remove unnecessary high-frequency components caused by blocking artifacts. We also propose a new method to find and preserve the original high frequency components of the image edge. Experimental results show that the proposed method can not only achieve a significantly enhanced subjective quality, but also have the PSNR improvement in the output image.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.145-152
• /
• 2010

This paper presents a digital auto-focusing algorithm using iterative unsharp mask filter. The proposed digital auto-focusing algorithm has the advantage of low computational complexity because it uses a simple filter instead of calculating the point spread function for the estimation of image degradation. The proposed iterative algorithm can control the number of iterations for image restoration according to the objective and the subjective criterion. We show that the proposed algorithm is mathematically equivalent to the conventional image restoration. Finally, in order to evaluate the performance of the proposed algorithm, various experiments are performed so that the proposed algorithm can provide good results in the sense of subjective and objective views.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.38-38
• /
• 2001

본 논문에서는 웨이브릿 영역에서의 영역 분류와 대역간 예측 및 선택적 벡터 양자화를 이용한 다분광 화상테이타 압축 기법을 제안하였다. 이 방법에서는 각 대역을 웨이브릿 변환 후, 각 대역의 기저밴드의 대역별 특성을 이용하여 영역 분류를 행하였다. 그리고, 다른 대역과 해상도가 동일하고 공간적 분산이 작으며 분광적 상관성이 큰 기준대역 (reference channel)을 결정한 뒤, 이를 영역별 스칼라 및 분류별 가변 벡터 양자화를 행하여 부호화 하였다. 또한 기준대역과의 대역간 상관성이 큰 대역들에 대해서는 영역별 대역간 예측을 행한 후, 활동도가 높은 블록에 대해서만 선택적 벡터 양자화로 부호화를 행하였다. 이때, 활동도가 높은 블록들의 위치정보는 기준대역으로부터 얻어지는 임계치 지도 (threshold map; THMAP)를 이용하였다. 즉, 제안한 방법에서는 각 대역에 대해 웨이브릿 영역에서의 영역 분류 후 영역별 대역간 예측을 행함으로써 다분광 화상데이타에 존재하는 대역간 중복성을 제거하고 선택적 벡터 양자화를 행함으로써 대역내 중복성을 효과적으로 제거하여 압축효율을 향상시킨다. 실제 원격 센싱된 인공위성 화상데이타에 대한 실험을 통하여 제안한 기법의 부호화 효율이 기존의 기법에 비하여 우수함을 확인하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.6
• /
• pp.712-720
• /
• 2001

In this paper, we propose an efficient method to detect abrupt shot changes in a video sequence using an unsupervised clustering. Conventional clustering-based shot change detection algorithms use multiple features in order to overcome the shortcomings of a single feature. In such methods it is very important to determine the appropriate initial cluster centers well. In this paper we propose a modified k-means clustering algorithm which estimates the initial cluster center adaptively. Experimental results show that the proposed algorithm works well.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.38-47
• /
• 2000

In pattern classification, the Bhattacharyya distance has been used as a class separability measure. Furthemore, it is recently reported that the Bhattacharyya distance can be used to estimate error of Gaussian ML classifier within 1-2% margin. In this paper, we propose a feature extraction method utilizing the Bhattacharyya distance. In the proposed method, we first predict the classification error with the error estimation equation based on the Bhauacharyya distance. Then we find the feature vector that minimizes the classification error using two search algorithms: sequential search and global search. Experimental reslts show that the proposed method compares favorably with conventional feature extraction methods. In addition, it is possible to determine how man, feature vectors arc needed for achieving the same classification accuracy as in the original space.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.76-82
• /
• 2000

To reduce the radiated noise of ships, the noises which are generated from onboard machinery, propulsion system and transfer characteristics of structure must be identified. While the ship is operating, however, we can not directly measure each signal of inputs and characteristics of transfer passage, because measured signals are superimposed by multi source and multi transfer passage. In this paper, the signal processing method for separating noise sources and transfer functions from the measured response signal by the cepstrum technique is proposed. The proposed method is verified by application of simulated signal and impact test and shows usefulness by application of real ship test.

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

In this paper, we propose a near-field range estimation method for a uniform linear array that can calibrate bearing estimation error which give a bad influence on a range estimation process. When a range is fixed, the bearing error is calibrated to maximize the beamformer output by the proposed algorithm based on the gradient method. Simulation results show that the proposed algorithm can compensate the bearing error which is less than the mainlobe beamwidth so that reduce the range estimation error as similar as the case of no bearing error.