• Title/Summary/Keyword: CDF (Cumulative Density Function)

Search Result 36, Processing Time 0.022 seconds

An Adaptive Color Enhancement Algorithm using the Preferred Color Reconstruction (선호색 보정을 이용한 화질 향상 알고리즘)

  • Yang, Kyoung-Ok;Hwang, Bo-Hyun;Lee, Seung-Jun;Yun, Jong-Ho;Chon, Myung-Ryul
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.57 no.1
    • /
    • pp.22-29
    • /
    • 2008
  • In this paper, we propose an adaptive color enhancement algorithm. It is used for the flat panel displays (FPDs) such as LCD, PDP, and so on. The proposed algorithm consists of an adaptive linear approximation CDF(Cumulative Density Function) algorithm and an adaptive saturation enhancement algorithm. The one is for contrast enhancement which prevents an image from the distortion by luminance transient of an input image. The other is the algorithm which improves the saturation without the contour artifact and over-saturation, whose problems are generated during the enhancing saturation. In addition, it allows to achieve the high quality image using the saturation enhancement method for a preferred color of original image. Visual test and standard deviation of their histograms have been applied to evaluate the resultant output images of the proposed algorithm.

Multiresolution Edge Detection in Speckle Imagery (스펙클 영상에서의 다해상도 에지 검출)

  • 남권문;박덕준;박래홍
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.10
    • /
    • pp.78-89
    • /
    • 1992
  • In this paper, a multiresolution edge detction algorithm for speckle images is proposed. Due to the signal dependency of speckle images, the number of edge points detected depends on the local average intensity. Thus the edge detection method independent of the average intensity is required to detect properly real significant changes in an original signal. In the proposed method, candidate area is first selected based on the statistical propeties of speckle images,i.e., based on the busyness measure such as the CoV(coefficient of variation) and the difference between the real and theoretical CDF(cumulative density function). Then the real edges are extracted in a multiresolution environment. Computer simulation with test images shows that the proposed method reduces significantly false edges in relatively homogeneous areas while detects fine details properly.

  • PDF

Performance Analysis of Distributed Antenna Systems with Antenna Selection over MIMO Rayleigh Fading Channel

  • Yu, Xiangbin;Tan, Wenting;Wang, Ying;Liu, Xiaoshuai;Rui, Yun;Chen, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3016-3033
    • /
    • 2014
  • The downlink performance of distributed antenna systems (DAS) with antennas selection is investigated in Rayleigh fading multicell environment, and the corresponding system capacity and bit error rate (BER) analysis are presented. Based on the moment generating function, the probability density function (PDF) and cumulative distribution function (CDF) of the effective signal to interference plus noise ratio (SINR) of the system are first derived, respectively. Then, with the available CDF and PDF, the accurate closed-form expressions of average channel capacity and average BER are further derived for exact performance evaluation. To simplify the expression, a simple closed-form approximate expression of average channel capacity is obtained by means of Taylor series expansion, with the performance results close to the accurate expression. Besides, the system outage capacity is analyzed, and an accurate closed-form expression of outage capacity probability is derived. These theoretical expressions can provide good performance evaluation for DAS downlink. It can be shown by simulation that the theoretical analysis and simulation are consistent, and DAS with antenna selection outperforms that with conventional blanket transmission. Moreover, the system performance can be effectively improved as the number of receive antennas increases.

A Kernel Density Signal Grouping Based on Radar Frequency Distribution (레이더 주파수 분포 기반 커널 밀도 신호 그룹화 기법)

  • Lee, Dong-Weon;Han, Jin-Woo;Lee, Won-Don
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.6
    • /
    • pp.124-132
    • /
    • 2011
  • In a modern electronic warfare, radar signal environments become more denser and complex. Therefor the capability of reliable signal analysis techniques is required for ES(Electronic warfare Support) system to identify and analysis individual emitter signals from received signals. In this paper, we propose the new signal grouping algorithm to ensure the reliable signal analysis and to reduce the cost of the signal processing steps in the ES. The proposed grouping algorithm uses KDE(Kernel Density Estimator) and its CDF(Cumulative Distribution Function) to compose windows considering the statistical distribution characteristics based on the radar frequency modulation type. Simulation results show the good performance of the proposed technique in the signal grouping.

CHARACTERIZATIONS BASED ON THE INDEPENDENCE OF THE EXPONENTIAL AND PARETO DISTRIBUTIONS BY RECORD VALUES

  • LEE MIN-YOUNG;CHANG SE-KYUNG
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.497-503
    • /
    • 2005
  • This paper presents characterizations on the independence of the exponential and Pareto distributions by record values. Let ${X_{n},\;n {\ge1}$ be a sequence of independent and identically distributed(i.i.d) random variables with a continuous cumulative distribution function(cdf) F(x) and probability density function(pdf) f(x). $Let{\;}Y_{n} = max{X_1, X_2, \ldots, X_n}$ for n \ge 1. We say $X_{j}$ is an upper record value of ${X_{n},{\;}n\ge 1}, if Y_{j} > Y_{j-1}, j > 1$. The indices at which the upper record values occur are given by the record times {u(n)}, n \ge 1, where u(n) = $min{j|j > u(n-1), X_{j} > X_{u(n-1)}, n \ge 2}$ and u(l) = 1. Then F(x) = $1 - e^{-\frac{x}{a}}$, x > 0, ${\sigma} > 0$ if and only if $\frac {X_u(_n)}{X_u(_{n+1})} and X_u(_{n+1}), n \ge 1$, are independent. Also F(x) = $1 - x^{-\theta}, x > 1, {\theta} > 0$ if and only if $\frac {X_u(_{n+1})}{X_u(_n)}{\;}and{\;} X_{u(n)},{\;} n {\ge} 1$, are independent.

An image enhancement Method for extracting multi-license plate region

  • Yun, Jong-Ho;Choi, Myung-Ryul;Lee, Sang-Sun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.3188-3207
    • /
    • 2017
  • In this paper, we propose an image enhancement algorithm to improve license plate extraction rate in various environments (Day Street, Night Street, Underground parking lot, etc.). The proposed algorithm is composed of image enhancement algorithm and license plate extraction algorithm. The image enhancement method can improve an image quality of the degraded image, which utilizes a histogram information and overall gray level distribution of an image. The proposed algorithm employs an interpolated probability distribution value (PDV) in order to control a sudden change in image brightness. Probability distribution value can be calculated using cumulative distribution function (CDF) and probability density function (PDF) of the captured image, whose values are achieved by brightness distribution of the captured image. Also, by adjusting the image enhancement factor of each part region based on image pixel information, it provides a function that can adjust the gradation of the image in more details. This processed gray image is converted into a binary image, which fuses narrow breaks and long thin gulfs, eliminates small holes, and fills gaps in the contour by using morphology operations. Then license plate region is detected based on aspect ratio and license plate size of the bound box drawn on connected license plate areas. The images have been captured by using a video camera or a personal image recorder installed in front of the cars. The captured images have included several license plates on multilane roads. Simulation has been executed using OpenCV and MATLAB. The results show that the extraction success rate is more improved than the conventional algorithms.

Performance Analysis of Amplify-and-Forward Relaying in Cooperative Networks with Partial Relay Selection (부분 중계노드 선택 기반의 협력 네트워크에서 증폭 후 전송 방식에 대한 성능분석)

  • Hwang, Ho-seon;Ahn, Kyung-seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2317-2323
    • /
    • 2015
  • In this paper, we analyze the performance of dual-hop amplify-and-forward (AF) relaying in cooperative networks with partial relay selection. An AF relay gain considered in this paper includes channel-noise-assisted relay gain. Leveraging a received signal-to-noise ratio (SNR) model, we derive exact closed-form expressions for the probability density function (pdf) and cumulative distribution function (cdf) of the end-to-end SNR. Moreover, an exact closed-form expression of the ergodic capacity for dual-hop AF relaying with channel-noise-assisted relay gain and partial relay selection is investigated. The analytical results shown in this paper are confirmed by Monte-Carlo simulations.

Robust Histogram Equalization Using Compensated Probability Distribution

  • Kim, Sung-Tak;Kim, Hoi-Rin
    • MALSORI
    • /
    • v.55
    • /
    • pp.131-142
    • /
    • 2005
  • A mismatch between the training and the test conditions often causes a drastic decrease in the performance of the speech recognition systems. In this paper, non-linear transformation techniques based on histogram equalization in the acoustic feature space are studied for reducing the mismatched condition. The purpose of histogram equalization(HEQ) is to convert the probability distribution of test speech into the probability distribution of training speech. While conventional histogram equalization methods consider only the probability distribution of a test speech, for noise-corrupted test speech, its probability distribution is also distorted. The transformation function obtained by this distorted probability distribution maybe bring about miss-transformation of feature vectors, and this causes the performance of histogram equalization to decrease. Therefore, this paper proposes a new method of calculating noise-removed probability distribution by using assumption that the CDF of noisy speech feature vectors consists of component of speech feature vectors and component of noise feature vectors, and this compensated probability distribution is used in HEQ process. In the AURORA-2 framework, the proposed method reduced the error rate by over $44\%$ in clean training condition compared to the baseline system. For multi training condition, the proposed methods are also better than the baseline system.

  • PDF

Risk Analysis of Highway Investment by Private Sectors (민자유치대상고속도로 투자의 위험도분석)

  • 이용택;김상범;원제무
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.5
    • /
    • pp.33-42
    • /
    • 1999
  • 본 논문은 도로투자 사업성분석시 사업주체의 현금흐름을 결정하는 항목들을 고정값(Deterministic Value)이 아닌 확률적으로 추정함으로써, 사업의 재무적 변동으로 인한 위험도를 민간사업자의 견지에서 사업성분석과정에 내재화하는 모형을 개발하는 것이다. 즉, 확률적 비용추정기법으로 국소적으로 활용되던 위험도분석을 재무모형에 내재화함으로써 사업의 재무적 변동을 보다 포괄적으로 분석할 수 있는 틀을 제공한다. 본 연구에서는 몬테카를로 시뮬레이션기법을 이용한 위험도분석(Risk Analysis)을 적용하여 사업성 평가지표와 비용의 확률밀도함수(Probability Density Function : PDF), 누적확률분포함수(Cumulative Distribution Function : CDF)를 산출하고, 그 결과로 해당 사업의 위험도를 고려하여 사업성을 평가한다. 이 모형은 사업의 모든 변동요인을 복합적으로 추정하여 사업기간 내 사업주체의 현금흐름을 분석할 수 있다. 따라서 사업주체는 효용에 따라 합리적인 위험도 관리 목표값(Target Value)을 선정하고, 사업의 위험도를 고려하여 건설비, 예비비를 결정할 수 있다. 본 연구에서 정립된 모형을 서울외곽순환고속도로(일산-퇴계원 구간)와 대전당진고속도로를 대상으로 사례분석을 수행하였다. 그 결과, 대전당진고속도로의 경우 사업성이 없으며, 서울외곽순환고속도로의 경우, 일부 위험도 발생변수를 합리적으로 관리한다면, 사업성이 충분한 것으로 분석되었다. 본 사례분석은 사업의 위험도를 반영한 사업성분석 방법으로 우리나라 민자유치대상고속도로의 사업성분석의 하나의 지침이 될 것이다.

  • PDF

Frequency Sharing of TDD-OFDM/OFDMA Based Systems beyond 3G with Fixed Satellite Service Earth Station (TDD-OFDM/OFDMA 기반의 차세대 이동 통신 시스템과 고정 위성서비스 지구국 간의 주파수 공유 분석)

  • Jo Han-Shin;Yoon Hyun-Goo;Yook Jong-Gwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.17 no.5 s.108
    • /
    • pp.440-450
    • /
    • 2006
  • In this paper, the frequency sharing issue between time division duplex-orthogonal frequency division multiplexing/orthogonal frequency division multiple access(TDD-OFDM/OFDMA) based systems beyond third generation(B3G) and fixed Satellite Service(FSS) earth station has been studied. The conventional advanced minimum coupling loss(A-MCL) is adopted to assess the interference from a single base station(BS) of B3G systems. The aggregated interferences from base stations and mobile stations(MS) are evaluated by applying the extended A-MCL and analysed with a cumulative density function(CDF). The minimum distances that enable a single FSS earth station to sharing the frequency with a single BS are between 4 and 53.3 km. In the case of 20 MS per sector, the BS-to-BS distance and the minimum distance between a ES and BS are 6.5 and 2.8 km, respectively.