• Title/Summary/Keyword: Weighted Mean Filter

Search Result 54, Processing Time 0.034 seconds

Content Analysis-based Adaptive Filtering in The Compressed Satellite Images (위성영상에서의 적응적 압축잡음 제거 알고리즘)

  • Choi, Tae-Hyeon;Ji, Jeong-Min;Park, Joon-Hoon;Choi, Myung-Jin;Lee, Sang-Keun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.5
    • /
    • pp.84-95
    • /
    • 2011
  • In this paper, we present a deblocking algorithm that removes grid and staircase noises, which are called "blocking artifacts", occurred in the compressed satellite images. Particularly, the given satellite images are compressed with equal quantization coefficients in row according to region complexity, and more complicated regions are compressed more. However, this approach has a problem that relatively less complicated regions within the same row of complicated regions have blocking artifacts. Removing these artifacts with a general deblocking algorithm can blur complex and undesired regions as well. Additionally, the general filter lacks in preserving the curved edges. Therefore, the proposed algorithm presents an adaptive filtering scheme for removing blocking artifacts while preserving the image details including curved edges using the given quantization step size and content analysis. Particularly, WLFPCA (weighted lowpass filter using principle component analysis) is employed to reduce the artifacts around edges. Experimental results showed that the proposed method outperforms SA-DCT in terms of subjective image quality.

Temporally-Consistent High-Resolution Depth Video Generation in Background Region (배경 영역의 시간적 일관성이 향상된 고해상도 깊이 동영상 생성 방법)

  • Shin, Dong-Won;Ho, Yo-Sung
    • Journal of Broadcast Engineering
    • /
    • v.20 no.3
    • /
    • pp.414-420
    • /
    • 2015
  • The quality of depth images is important in the 3D video system to represent complete 3D contents. However, the original depth image from a depth camera has a low resolution and a flickering problem which shows vibrating depth values in terms of temporal meaning. This problem causes an uncomfortable feeling when we look 3D contents. In order to solve a low resolution problem, we employ 3D warping and a depth weighted joint bilateral filter. A temporal mean filter can be applied to solve the flickering problem while we encounter a residual spectrum problem in the depth image. Thus, after classifying foreground andbackground regions, we use an upsampled depth image for a foreground region and temporal mean image for background region.Test results shows that the proposed method generates a time consistent depth video with a high resolution.

Co-registration of PET-CT Brain Images using a Gaussian Weighted Distance Map (가우시안 가중치 거리지도를 이용한 PET-CT 뇌 영상정합)

  • Lee, Ho;Hong, Helen;Shin, Yeong-Gil
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.7
    • /
    • pp.612-624
    • /
    • 2005
  • In this paper, we propose a surface-based registration using a gaussian weighted distance map for PET-CT brain image fusion. Our method is composed of three main steps: the extraction of feature points, the generation of gaussian weighted distance map, and the measure of similarities based on weight. First, we segment head using the inverse region growing and remove noise segmented with head using region growing-based labeling in PET and CT images, respectively. And then, we extract the feature points of the head using sharpening filter. Second, a gaussian weighted distance map is generated from the feature points in CT images. Thus it leads feature points to robustly converge on the optimal location in a large geometrical displacement. Third, weight-based cross-correlation searches for the optimal location using a gaussian weighted distance map of CT images corresponding to the feature points extracted from PET images. In our experiment, we generate software phantom dataset for evaluating accuracy and robustness of our method, and use clinical dataset for computation time and visual inspection. The accuracy test is performed by evaluating root-mean-square-error using arbitrary transformed software phantom dataset. The robustness test is evaluated whether weight-based cross-correlation achieves maximum at optimal location in software phantom dataset with a large geometrical displacement and noise. Experimental results showed that our method gives more accuracy and robust convergence than the conventional surface-based registration.

Improvement of LMS Algorithm Convergence Speed with Updating Adaptive Weight in Data-Recycling Scheme (데이터-재순환 구조에서 적응 가중치 갱신을 통한 LMS 알고리즘 수렴 속 도 개선)

  • Kim, Gwang-Jun;Jang, Hyok;Suk, Kyung-Hyu;Na, Sang-Dong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.4
    • /
    • pp.11-22
    • /
    • 1999
  • Least-mean-square(LMS) adaptive filters have proven to be extremely useful in a number of signal processing tasks. However LMS adaptive filter suffer from a slow rate of convergence for a given steady-state mean square error as compared to the behavior of recursive least squares adaptive filter. In this paper an efficient signal interference control technique is introduced to improve the convergence speed of LMS algorithm with tap weighted vectors updating which were controled by reusing data which was abandoned data in the Adaptive transversal filter in the scheme with data recycling buffers. The computer simulation show that the character of convergence and the value of MSE of proposed algorithm are faster and lower than the existing LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of LMS algorithm.

A study on the subset averaged median methods for gaussian noise reduction (가우시안 잡음 제거를 위한 부분 집합 평균 메디안 방법에 관한 연구)

  • 이용환;박장춘
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.2
    • /
    • pp.120-134
    • /
    • 1999
  • Image processing steps consist of image acquisition, pre-processing, region segmentation and recognition, and the images are easily corrupted by noise during the data transmission, data capture, and data processing. Impulse noise and gaussian noise are major noises, which can occur during the process. Many filters such as mean filter, median filter, weighted median filter, Cheikh filter, and Kyu-cheol Lee filter were proposed as spatial noise reduction filters so far. Many researches have been focused on the reduction of impulse noise, but comparatively the research in the reduction of gaussian noise has been neglected. For the reduction of gaussian noise, subset averaged median filter, using median information and subset average information of pixels in a window. was proposed. At this time, consider of the window size as 3$^{*}$3 pixel. The window is divided to 4 subsets consisted of 4 pixels. First of all, we calculate the average value of each subset, and then find the median value by sorting the average values and center pixel's value. In this paper, a better reduction of gaussian noise was proved. The proposed algorithms were implemented by ANSI C language on a Sun Ultra 2 for testing purposes and the effects and results of the filter in the various levels of noise and images were proposed by comparing the values of PSNR, MSE, and RMSE with the value of the other existing filtering methods.thods.

  • PDF

The Bi-directional Least Mean Square Algorithm and Its Application to Echo Cancellation (양방향 최소 평균 제곱 알고리듬과 반향 제거로의 응용)

  • Kwon, Oh-Sang
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.12
    • /
    • pp.1337-1344
    • /
    • 2014
  • The objective of an echo canceller connected to any end of a communication line such as digital subscriber line (DSL) is to compensate the outgoing transmit signal in the receiving path that the hybrid circuit leaks. The echo canceller working in a full duplex environment is an adaptive system driven by the local signal. Conventional echo canceller that implement the least mean square (LMS) algorithm provides a low computational burden but poor convergence properties. The length of the echo canceller will directly affect both the degree of performance and the convergence speed of the adaptation process. To cancel long time-varying echoes, the number of tap coefficients of a conventional echo canceller must be large, which decreases the convergence speed of the adaptive filter. This paper proposes an alternative technique for the echo cancellation in a telecommunication channel. The new technique employs the bi-directional least mean square (LMS) algorithm for adaptively computing the optimal set of the coefficients of the echo canceller, which is composed of weighted combination of both feedforward and feedback algorithms. Finally, Simulation results as well as mathematical analysis demonstrates that the proposed echo canceller has faster convergence speed than the conventional LMS echo canceller with nearly equivalent complexity of computation.

Boundary-preserving Stereo Matching based on Confidence Region Detection and Disparity Map Refinement (신뢰 영역 검출 및 시차 지도 재생성 기반 경계 보존 스테레오 매칭)

  • Yun, In Yong;Kim, Joong Kyu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.5
    • /
    • pp.132-140
    • /
    • 2016
  • In this paper, we propose boundary-preserving stereo matching method based on adaptive disparity adjustment using confidence region detection. To find the initial disparity map, we compute data cost using the color space (CIE Lab) combined with the gradient space and apply double cost aggregation. We perform left/right consistency checking to sort out the mismatched region. This consistency check typically fails for occluded and mismatched pixels. We mark a pixel in the left disparity map as "inconsistent", if the disparity value of its counterpart pixel differs by a value larger than one pixel. In order to distinguish errors caused by the disparity discontinuity, we first detect the confidence map using the Mean-shift segmentation in the initial disparity map. Using this confidence map, we then adjust the disparity map to reduce the errors in initial disparity map. Experimental results demonstrate that the proposed method produces higher quality disparity maps by successfully preserving disparity discontinuities compared to existing methods.

Determination of 2D solar wind speed maps from LASCO C3 observations using Fourier motion filter

  • Cho, Il-Hyun;Moon, Yong-Jae;Lee, Jin-Yi;Nakariakov, Valery;Cho, Kyung-Suk
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.42 no.2
    • /
    • pp.68-68
    • /
    • 2017
  • Measurements of solar wind speed near the Sun (< 0.1 AU) are important for understanding acceleration mechanism of solar wind as well as space weather predictions, but hard to directly measure them. For the first time, we provide 2D solar wind speed maps in the LASCO field of view using three consecutive days data. By applying the Fourier convolution and inverse Fourier transform, we decompose the 3D intensity data (r, PA, t) into the 4D one (r, PA, t, v). Then, we take the weighted mean along speed to determine the solar wind speeds that gives V(r, PA, t) in every 30 min. The estimated radial speeds are consistent with those given by an artificial flow and plasma blobs. We find that the estimated speeds are moderately correlated with those from slow CMEs and those from IPS observations. A comparison of yearly solar wind speed maps in 2000 and 2009 shows that they have very remarkable differences: azimuthally uniform distribution in 2000 and bi-modal distribution (high speed near the poles and low speed near the equator) in 2009.

  • PDF

Transceiver Design Method for Finitely Large Numbers of Antenna Systems (유한 대용량 안테나 시스템에서 송수신기 설계 방법)

  • Shin, Joonwoo
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.39 no.3
    • /
    • pp.280-285
    • /
    • 2015
  • We consider a linear transceiver design method for multi-user multiple-input multiple-output (MIMO) downlink channels where a base station (BS) equipped with a finitely large number of antennas. Although a matched-filter precoder is a capacity-achieving method in massive MIMO downlink systems, it cannot guarantee to achieve the multi-user MIMO capacity in a finitely large number of antennas due to inter-user interferences. In this paper, we propose a two-stage precoder design method that maximizes the sum-rate of cell-edge users when the BS equipped with a finitely large number of antennas. At the first stage, a matched-filter precoder is adopted to exploit both beamforming gain and the reduction of the dimension of effective channels. Then, we derive the second stage precoder that maximizes the sum-rate by minimizing the weighted mean square error (WMSE). From simulation and analysis, we verify the effectiveness of the proposed method.

Fruit Grading Algorithms of Multi-purpose Fruit Grader Using Black at White Image Processing System (흑백영상처리장치를 이용한 다목적 과실선별기의 등급판정 알고리즘 개발)

  • 노상하;이종환;황인근
    • Journal of Biosystems Engineering
    • /
    • v.20 no.1
    • /
    • pp.95-103
    • /
    • 1995
  • A series of study has been conducted to develop a multi-purpose fruit grader using a black & white image processing system equipped with a 550 nm interference filter. A device and high performance algorithms were developed for sizing and color grading of Fuji apple in the previous study. In this study an emphasis was put on finding correlations between weights of several kinds of fruits and their area fractions(AF), and on compensating the blurring effect upon sizing and color grading by conveying speed of fruit. Also, the effect of orientation and direction of fruit on conveyor during image forming was analyzed to identify any difficulty (or utilizing an automatic fruit feeder. The results are summarized as follows. 1. The correlation coefficients(r) between the weights of fruits and their image sizes were 0.984~0.996 for apples, 0.983~0.990 for peachs, 0.995 for tomato, 0.986 for sweet persimmon and 0.970~0.993 for pears. 2. It was possible to grade fruits by color with the area weighted mean gray values(AWMGV) based on the mean gray valves of direct image and the compensated values of reflected image of a fruit, and also possible to sort fruits by size with AF. Accuracies in sizing and color grading ranged over 81.0% ~95.0% and 82.0% ~89.7% respectively as compared with results from sizing by electronic weight scale and grading by expert. 3. The blurring effect on the sizing and color grading depending on conveying speed was identified and regression equations were derived. 4. It was found that errors in sizing and coloring grading due to the change in direction and orientation of Fuji apple on the conveyor were not significant as far as the stem end of apple keeping upward.

  • PDF