• Title/Summary/Keyword: 검출확률

Search Result 483, Processing Time 0.025 seconds

Probabilistic Modeling of Photovoltaic Power Systems with Big Learning Data Sets (대용량 학습 데이터를 갖는 태양광 발전 시스템의 확률론적 모델링)

  • Cho, Hyun Cheol;Jung, Young Jin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.5
    • /
    • pp.412-417
    • /
    • 2013
  • Analytical modeling of photovoltaic power systems has been receiving significant attentions in recent years in that it is easy to apply for prediction of its dynamics and fault detection and diagnosis in advanced engineering technologies. This paper presents a novel probabilistic modeling approach for such power systems with a big data sequence. Firstly, we express input/output function of photovoltaic power systems in which solar irradiation and ambient temperature are regarded as input variable and electric power is output variable respectively. Based on this functional relationship, conditional probability for these three random variables(such as irradiation, temperature, and electric power) is mathematically defined and its estimation is accomplished from ratio of numbers of all sample data to numbers of cases related to two input variables, which is efficient in particular for a big data sequence of photovoltaic powers systems. Lastly, we predict the output values from a probabilistic model of photovoltaic power systems by using the expectation theory. Two case studies are carried out for testing reliability of the proposed modeling methodology in this paper.

Acquisition of Direct-Sequence Cellular Communication System for Code Division Mutlipie Access (부호 분할 다원 접속을 위한 직접 확산 셀룰라 통신 시스팀의 동기)

  • 전정식;한영열
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.2
    • /
    • pp.207-217
    • /
    • 1993
  • In this paper, knowing a priori probability of phase offset between transmitted codes and reference codes in the receiver, we construct the state diagram of acquisition process of the direct sequence spread-spectrum communication system using the expanding window search. The scannings are performed from the cell with higher probability code epoch synchronization to that with lower one. We expand window size from initial value by r times of its previous size in each search, construct the corresponding the state diagrams, and derive average synchronization time using the Markov process and Mason's gain formula. Average synchronization times versus number of search n and detection probability $P_d$ are calculated.

  • PDF

Steganalysis Based on Image Decomposition for Stego Noise Expansion and Co-occurrence Probability (스테고 잡음 확대를 위한 영상 분해와 동시 발생 확률에 기반한 스테그분석)

  • Park, Tae-Hee;Kim, Jae-Ho;Eom, Il-Kyu
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.2
    • /
    • pp.94-101
    • /
    • 2012
  • This paper proposes an improved image steganalysis scheme to raise the detection rate of stego images out of cover images. To improve the detection rate of stego image in the steganalysis, tiny variation caused by data hiding should be amplified. For this, we extract feature vectors of cover image and stego image by two steps. First, we separate image into upper 4 bit subimage and lower 4 bit subimage. As a result, stego noise is expanded more than two times. We decompose separated subimages into twelve subbands by applying 3-level Haar wavelet transform and calculate co-occurrence probabilities of two different subbands in the same scale. Since co-occurrence probability of the two wavelet subbands is affected by data hiding, it can be used as a feature to differentiate cover images and stego images. The extracted feature vectors are used as the input to the multilayer perceptron(MLP) classifier to distinguish between cover and stego images. We test the performance of the proposed scheme over various embedding rates by the LSB, S-tool, COX's SS, and F5 embedding method. The proposed scheme outperforms the previous schemes in detection rate to existence of hidden message as well as exactness of discrimination.

A Serial Acquisition Scheme for DS-SS Systems Using Antenna Arrays and Its Performance in a Fading Channel (안테나 배열을 사용한 DS-SS 시스템을 위한 직렬 포착 방식과 페이딩 채널에서의 성능)

  • 박민규;오성근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5B
    • /
    • pp.931-941
    • /
    • 2000
  • We propose a serial acquisition scheme using antenna arrays for initial acquisition of direct sequence spread spectrum (DS-SS) signals, which can lower substantially the range of detectable signal-to-noise ratio (SNR). The proposed scheme uses the sum of the independent decision samples form psedo-noise (PN) co-phased noncoherent I-Q matched filters (MFs) associated with antenna arrays as a decision variable in order to enhance SNR of the resulting signal. We analyze its mean acquisition time performance under an additive white Gaussian noise (AWGN) channel and a flat Rayleigh fading channel by deriving the expressions for the probabilities of detection and false alarm. From mumerical results, we see that the acquisition performance of the proposal scheme becomes improved continually as the number of antennas increses.

  • PDF

Reweighted L1-Minimization via Support Detection (Support 검출을 통한 reweighted L1-최소화 알고리즘)

  • Lee, Hyuk;Kwon, Seok-Beop;Shim, Byong-Hyo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.134-140
    • /
    • 2011
  • Recent work in compressed sensing theory shows that $M{\times}N$ independent and identically distributed sensing matrix whose entries are drawn independently from certain probability distributions guarantee exact recovery of a sparse signal with high probability even if $M{\ll}N$. In particular, it is well understood that the $L_1$-minimization algorithm is able to recover sparse signals from incomplete measurements. In this paper, we propose a novel sparse signal reconstruction method that is based on the reweighted $L_1$-minimization via support detection.

The Mutual Information for Bit-Linear Linear-Dispersion Codes (BLLD 부호의 Mutual Information)

  • Jin, Xiang-Lan;Yang, Jae-Dong;Song, Kyoung-Young;No, Jong-Seon;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.958-964
    • /
    • 2007
  • In this paper, we derive the relationship between the bit error probability (BEP) of maximum a posteriori (MAP) bit detection and the bit minimum mean square error (MMSE), that is, the BEP is greater than a quarter of the bit USE and less than a half of the bit MMSE. By using this result, the lower and upper bounds of the derivative of the mutual information are derived from the BEP and the lower and upper bounds are easily obtained in the multiple-input multiple-output (MIMO) communication systems with the bit-linear linear-dispersion (BLLD) codes in the Gaussian channel.

Out-of-band Collaborative Spectrum Sensing of CR System in Rayleigh Fading Channel (Rayleigh 페이딩 채널에서 CR 시스템의 외부대역 협력 스펙트럼 센싱)

  • Kang, Bub-Joo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.3
    • /
    • pp.564-571
    • /
    • 2009
  • In this paper, we propose out-of -band collaborative spectrum sensing scheme in the cognitive radio (CR) base station operated by the multiple frequency channels. Also this paper presents the signal detection results for ATSC digital TV signal as an incumbent signal and derives signal detection probability and false alarm probability for the out-of-band collaborative spectrum sensing scheme in frequency selective Rayleigh fading channel. Numerical results demonstrate that the sensing performance is improved by the out-of-band collaborative spectrum sensing in the case that the incumbent signal powers measured by the CR terminals of the multiple frequency channels are almost similar.

Layered Object Detection using Adaptive Gaussian Mixture Model in the Complex and Dynamic Environment (혼잡한 환경에서 적응적 가우시안 혼합 모델을 이용한 계층적 객체 검출)

  • Lee, Jin-Hyung;Cho, Seong-Won;Kim, Jae-Min;Chung, Sun-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.3
    • /
    • pp.387-391
    • /
    • 2008
  • For the detection of moving objects, background subtraction methods are widely used. In case the background has variation, we need to update the background in real-time for the reliable detection of foreground objects. Gaussian mixture model (GMM) combined with probabilistic learning is one of the most popular methods for the real-time update of the background. However, it does not work well in the complex and dynamic backgrounds with high traffic regions. In this paper, we propose a new method for modelling and updating more reliably the complex and dynamic backgrounds based on the probabilistic learning and the layered processing.

Real-Time Landmark Detection using Fast Fourier Transform in Surveillance (서베일런스에서 고속 푸리에 변환을 이용한 실시간 특징점 검출)

  • Kang, Sung-Kwan;Park, Yang-Jae;Chung, Kyung-Yong;Rim, Kee-Wook;Lee, Jung-Hyun
    • Journal of Digital Convergence
    • /
    • v.10 no.7
    • /
    • pp.123-128
    • /
    • 2012
  • In this paper, we propose a landmark-detection system of object for more accurate object recognition. The landmark-detection system of object becomes divided into a learning stage and a detection stage. A learning stage is created an interest-region model to set up a search region of each landmark as pre-information necessary for a detection stage and is created a detector by each landmark to detect a landmark in a search region. A detection stage sets up a search region of each landmark in an input image with an interest-region model created in the learning stage. The proposed system uses Fast Fourier Transform to detect landmark, because the landmark-detection is fast. In addition, the system fails to track objects less likely. After we developed the proposed method was applied to environment video. As a result, the system that you want to track objects moving at an irregular rate, even if it was found that stable tracking. The experimental results show that the proposed approach can achieve superior performance using various data sets to previously methods.

Dimension Reduction Method of Feature Vector for Real-Time Adaptation of Voice Activity Detection (음성 구간 검출기의 실시간 적응화를 위한 특징 벡터의 차원 축소 방법)

  • Kim Pyoung-Hwan;Han Hag-Yong;Kim Chang-Keun;Koh Si-Young;Hur Kang-In
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.53-56
    • /
    • 2004
  • 본 논문은 잡음 환경하에서 특징 벡터의 차원 축소를 통한 음성 구간 검출에 관한 연구이다. 음성/비음성 분류는 통계적 모델을 이용한 분류-기반 방법을 사용한다. 검출기에서 실시간 적응화를 위해 우도-기반의 특징 벡터에 대한 차원 축소 방법을 제안한다. 이 방법은 음성/비음성 클래스에 대한 가우시안 확률 밀도 함수에 의한 비선형적 우도값을 새로운 특징으로 취하는 방법이다. 음성/비음성 결정은 우도비 검증(Likelihood Ratio Test)의 방법을 이용하며, LDA(Linear Discriminant Analys)에 의한 축소 결과와 성능을 비교한다. 실험 결과 제안된 차원 축소 방법을 통하여 2차원으로 축소된 특징 벡터가 고차원에서의 결과와 대등함을 확인하였다.

  • PDF