• Title/Summary/Keyword: adaptive window

Search Result 241, Processing Time 0.032 seconds

Analysis of the Generalized Order Statistics Constant False Alarm Rate Detector

  • Kim, Chang-Joo;Lee, Hwang-Soo
    • ETRI Journal
    • /
    • v.16 no.1
    • /
    • pp.17-34
    • /
    • 1994
  • In this paper, we present an architecture of the constant false alarm rate (CFAR) detector called the generalized order statistics (GOS) CFAR detector, which covers various order statistics (OS) and cell-averaging (CA) CFAR detectors as special cases. For the proposed GOS CFAR detector, we obtain unified formulas for the false alarm and detection probabilities. By properly choosing coefficients of the GOS CFAR detector, one can utilize any combination of ordered samples to estimate the background noise level. Thus, if we use a reference window of size N, we can realize $(2^N-1)$ kinds of CFAR processors and obtain their performances from the unified formulas. Some examples are the CA, the OS, the censored mean level, and the trimmed mean CFAR detectors. As an application of the GOS CFAR detector to multiple target detection, we propose an algorithm called the adaptive mean level detector, which censors adaptively the interfering target returns in a reference window.

  • PDF

Denosing of images using locally adaptive wiener filter in wavelet domain (웨이브렛 변환 영역에서의 국부적응 Wiener 필터에 의한 영상 신호의 잡음 제거)

  • 장익훈;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2772-2782
    • /
    • 1997
  • In this paepr, a Wiener filtering method in wavelet domain is proposed for restoring an image corrupted by additive white noise. The proposed method utilizes the characteristics of wavelet transform signals and the local statistics of each subband. When estimating the local statistics in each subband, the size of filter window is varied according to each scale. At this point, the local statistics in each wavelet subband is estimated only by using pixedls which have similar statistical property. Experimental results show that the proposed method has better performance over the conventional Lee filter with a window of fixed size.

  • PDF

Comprehensive Comparisons among LIDAR Fitering Algorithms for the Classification of Ground and Non-ground Points (지면.비지면점 분류를 위한 라이다 필터링 알고리즘의 종합적인 비교)

  • Kim, Eui-Myoung;Cho, Du-Young
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.1
    • /
    • pp.39-48
    • /
    • 2012
  • Filtering process that separates ground and non-ground points from LIDAR data is important in order to create the digital elevation model (DEM) or extract objects on the ground. The purpose of this research is to select the most effective filtering algorithm through qualitative and quantitative analysis for the existing filtering method used to extract ground points from LIDAR data. For this, four filtering methods including Adaptive TIN(ATIN), Perspective Center-based filtering method(PC), Elevation Threshold with Expand Window(ETEW) and Progressive Morphology(PM) were applied to mountain area, urban area and the area where building and mountains exist together. Then the characteristics for each method were analyzed. For the qualitative comparison of four filtering methods used for the research, visual method was applied after creating shaded relief image. For the quantitative comparison, an absolute comparison was conducted by using control points observed by GPS and a relative comparison was conducted by the digital elevation model of the National Geographic Information Institute. Through the filtering experiment of the LIDAR data, the Adaptive TIN algorithm extracted the ground points in mountain area and urban area most effectively. In the area where buildings and mountains coexist, progressive morphology algorithm generated the best result. In addition, as a result of qualitative and quantitative comparisons, the applicable filtering algorithm regardless of topographic characteristics appeared to be ATIN algorithm.

Effective Reconstruction of Stereo Image through Regularized Adaptive Disparity Estimation Scheme (평활화된 적응적 변이추정 기법을 이용한 스테레오 영상의 효과적인 복원)

  • Kim, Yong-Ok;Bae, Kyung-Hoon;Kim, Eun-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4C
    • /
    • pp.424-432
    • /
    • 2003
  • In this paper, an effective method of stereo image reconstruction through the regularized adaptive disparity estimation is proposed. Althougth the conventional adaptive disparity estimation method can sharply improve the PSNR of a reconstructed stereo image, but some problems of overlapping between the matching windows and disallocation of the matching windows can be occurred, because the matching window size changes adaptively in accordance with the magnitude of feature values. Accordingly, in thia paper, a new regularized adaptive disparity estimation technique is proposed. That is, by regularizing the estimated disparity vector with the neughboring disparity vectors, problems of the conventional adaptive disparity estimated scheme might be solved, and also the predicted stereo image can be more effectively reconstructed. From some experiments using the CCETT'S stereo image pairs of 'Man' and 'Claude', it is analyzed that the proposed disparity estimation scheme can improve PSNRs of the reconstructed images to 10.89dB, 6.13dB for 'Man' and 1.41dB, 0.81dB for 'Claude' by comparing with those of the conventional pixel-based and adaptive estimation method, respectively.

An Adaptive Motion Estimation Algorithm Using Spatial Correlation (공간 상관성을 이용한 적응적 움직임 추정 알고리즘)

  • 박상곤;정동석
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.43-46
    • /
    • 2000
  • In this paper, we propose a fast adaptive diamond search algorithm(FADS) for block matching motion estimation. Fast motion estimation algorithms reduce the computational complexity by using the UESA (Unimodal Error Search Assumption) that the matching error monotonically increases as the search moves away from the global minimum error. Recently many fast BMAs(Block Matching Algorithms) make use of the fact that the global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the adjacent blocks. We change the origin of search window according to the spatially adjacent motion vectors and their MAE(Mean Absolute Error). The computer simulation shows that the proposed algorithm has almost the same computational complexity with UCBDS(Unrestricted Center-Biased Diamond Search)〔1〕, but enhance PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS(Full Search), even for the large motion case, with half the computational load.

  • PDF

A Motion Adaptive Multi-Frame Interpolation Algorithm (움직임 적응형 멀티프레임 보간 알고리즘)

  • 김희철;채종석;최철호;권병헌;최명렬
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.54-57
    • /
    • 2000
  • In this paper, we propose a new interpolation method by using the motion between two moving image frames. In the proposed method, the movement is detected by using neighborhood pixels of target pixel in the past frame and the present frame. Then, H-shaped pseudomedian filter (below HPMED) is used for the still part of the image and Delta-shaped interpolation filter (below $\Delta$-shaped) for used in the moving part of the image. We detect the movement by comparing the differences between pixels in 4${\times}$5 window of the past frame and the present frame; the difference has a critical value. We simultaneously accomplish checking PSNR(peak signal noise ratio) and subjective assessment that is placed the focus on edge characteristic for assessment of result in computer simulation. The results show that the proposed adaptive method is better than the conventional methods.

  • PDF

Widely Tunable Adaptive Resolution-controlled Read-sensing Reference Current Generation for Reliable PRAM Data Read at Scaled Technologies

  • Park, Mu-hui;Kong, Bai-Sun
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.17 no.3
    • /
    • pp.363-369
    • /
    • 2017
  • Phase-change random access memory (PRAM) has been emerged as a potential memory due to its excellent scalability, non-volatility, and random accessibility. But, as the cell current is reducing due to cell size scaling, the read-sensing window margin is also decreasing due to increased variation of cell performance distribution, resulting in a substantial loss of yield. To cope with this problem, a novel adaptive read-sensing reference current generation scheme is proposed, whose trimming range and resolution are adaptively controlled depending on process conditions. Performance evaluation in a 58-nm CMOS process indicated that the proposed read-sensing reference current scheme allowed the integral nonlinearity (INL) to be improved from 10.3 LSB to 2.14 LSB (79% reduction), and the differential nonlinearity (DNL) from 2.29 LSB to 0.94 LSB (59% reduction).

Dynamic Contention Window based Congestion Control and Fair Event Detection in Wireless Sensor Network

  • Mamun-Or-Rashid, Md.;Hong, Choong-Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1288-1290
    • /
    • 2007
  • Congestion in WSN increases energy dissipation rates of sensor nodes as well as loss of packets and thereby hinders fair and reliable event detections. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic media access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control. Our proposed mechanism ensures load adaptive media access to the nodes and thus achieves fairness in event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio with retry limit 1, even under bursty traffic condition which is good enough for reliable event perception.

  • PDF

An Adaptive MAC Protocol for Wireless LANs

  • Jamali, Amin;Hemami, Seyed Mostafa Safavi;Berenjkoub, Mehdi;Saidi, Hossein
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.311-321
    • /
    • 2014
  • This paper focuses on contention-based medium access control (MAC) protocols used in wireless local area networks. We propose a novel MAC protocol called adaptive backoff tuning MAC (ABTMAC) based on IEEE 802.11 distributed coordination function (DCF). In our proposed MAC protocol, we utilize a fixed transmission attempt rate and each node dynamically adjusts its backoff window size considering the current network status. We determined the appropriate transmission attempt rate for both cases where the request-to-send/clear-to-send mechanism was and was not employed. Robustness against performance degradation caused by the difference between desired and actual values of the attempt rate parameter is considered when setting it. The performance of the protocol is evaluated analytically and through simulations. These results indicate that a wireless network utilizing ABTMAC performs better than one using IEEE 802.11 DCF.

Adaptive Thresholding Technique for Binarization of License Plate Images

  • Kim, Min-Ki
    • Journal of the Optical Society of Korea
    • /
    • v.14 no.4
    • /
    • pp.368-375
    • /
    • 2010
  • Unlike document images, license plate images are mostly captured under uneven lighting conditions. In particular, a shadowed region has sharp intensity variation and sometimes that region has very high intensity by reflected light. This paper presents a new technique for thresholding license plate images. This approach consists of three parts. In the first part, it performs a rough thresholding and classifies the type of license plate to adjust some parameters optimally. Next, it identifies a shadow type and binarizes license plate images by adjusting the window size and location according to the shadow type. And finally, post-processing based on the cluster analysis is performed. Experimental results show that the proposed method outperformed five well-known methods.