• Title/Summary/Keyword: Predefined threshold

Search Result 63, Processing Time 0.038 seconds

Quantitative Assessment Technology of Small Animal Myocardial Infarction PET Image Using Gaussian Mixture Model (다중가우시안혼합모델을 이용한 소동물 심근경색 PET 영상의 정량적 평가 기술)

  • Woo, Sang-Keun;Lee, Yong-Jin;Lee, Won-Ho;Kim, Min-Hwan;Park, Ji-Ae;Kim, Jin-Su;Kim, Jong-Guk;Kang, Joo-Hyun;Ji, Young-Hoon;Choi, Chang-Woon;Lim, Sang-Moo;Kim, Kyeong-Min
    • Progress in Medical Physics
    • /
    • v.22 no.1
    • /
    • pp.42-51
    • /
    • 2011
  • Nuclear medicine images (SPECT, PET) were widely used tool for assessment of myocardial viability and perfusion. However it had difficult to define accurate myocardial infarct region. The purpose of this study was to investigate methodological approach for automatic measurement of rat myocardial infarct size using polar map with adaptive threshold. Rat myocardial infarction model was induced by ligation of the left circumflex artery. PET images were obtained after intravenous injection of 37 MBq $^{18}F$-FDG. After 60 min uptake, each animal was scanned for 20 min with ECG gating. PET data were reconstructed using ordered subset expectation maximization (OSEM) 2D. To automatically make the myocardial contour and generate polar map, we used QGS software (Cedars-Sinai Medical Center). The reference infarct size was defined by infarction area percentage of the total left myocardium using TTC staining. We used three threshold methods (predefined threshold, Otsu and Multi Gaussian mixture model; MGMM). Predefined threshold method was commonly used in other studies. We applied threshold value form 10% to 90% in step of 10%. Otsu algorithm calculated threshold with the maximum between class variance. MGMM method estimated the distribution of image intensity using multiple Gaussian mixture models (MGMM2, ${\cdots}$ MGMM5) and calculated adaptive threshold. The infarct size in polar map was calculated as the percentage of lower threshold area in polar map from the total polar map area. The measured infarct size using different threshold methods was evaluated by comparison with reference infarct size. The mean difference between with polar map defect size by predefined thresholds (20%, 30%, and 40%) and reference infarct size were $7.04{\pm}3.44%$, $3.87{\pm}2.09%$ and $2.15{\pm}2.07%$, respectively. Otsu verse reference infarct size was $3.56{\pm}4.16%$. MGMM methods verse reference infarct size was $2.29{\pm}1.94%$. The predefined threshold (30%) showed the smallest mean difference with reference infarct size. However, MGMM was more accurate than predefined threshold in under 10% reference infarct size case (MGMM: 0.006%, predefined threshold: 0.59%). In this study, we was to evaluate myocardial infarct size in polar map using multiple Gaussian mixture model. MGMM method was provide adaptive threshold in each subject and will be a useful for automatic measurement of infarct size.

Fast Scene Change Detection Algorithm

  • Khvan, Dmitriy;Ng, Teck Sheng;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.11a
    • /
    • pp.259-262
    • /
    • 2012
  • In this paper, we propose a new fast algorithm for effective scene change detection. The proposed algorithm exploits Otsu threshold matching technique, which was proposed earlier. In this method, the current and the reference frames are divided into square blocks of particular size. After doing so, the pixel histogram of each block is generated. According to Otsu method, every histogram distribution is assumed to be bimodal, i.e. pixel distribution can be divided into two groups, based on within-group variance value. The pixel value that minimizes the within-group variance is said to be Otsu threshold. After Otsu threshold is found, the same procedure is performed at the reference frame. If the difference between Otsu threshold of a block in the current frame and co-located block in the reference frame is larger than predefined threshold, then a scene change between those two blocks is detected.

  • PDF

Secure Beamforming with Artificial Noise for Two-way Relay Networks

  • Li, Dandan;Xiong, Ke;Du, Guanyao;Qiu, Zhengding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.6
    • /
    • pp.1418-1432
    • /
    • 2013
  • This paper studies the problem of secure information exchange between two sources via multiple relays in the presence of an eavesdropper. To this end, we propose a relay beamforming scheme, i.e., relay beamforming with artificial noise (RBwA), where the relay beamforming vector and the artificial noise vector are jointly designed to maintain the received signal-to-interference-ratio (SINR) at the two sources over a predefined Quality of Service (QoS) threshold while limiting the received SINR at the eavesdropper under a predefined secure threshold. For comparison, the relay beamforming without artificial noise (RBoA) is also considered. We formulate two optimization problems for the two schemes, where our goal is to seek the optimal beamforming vector to minimize the total power consumed by relay nodes such that the secrecy of the information exchange between the two sources can be protected. Since both optimization problems are nonconvex, we solve them by semidefinite program (SDP) relaxation theory. Simulation results show that, via beamforming design, physical layer secrecy of two-way relay networks can be greatly improved and our proposed RBwA outperforms the RBoA in terms of both low power consumption and low infeasibility rate.

Efficient Resource Allocation Scheme for Improving the Throughput in the PB/MC-CDMA System (PB/MC-CDMA 시스템에서 처리량 향상을 위한 효율적인 자원 할당 기법)

  • Lee, Kyujin;Seo, HyoDuck;Han, DooHee
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.1
    • /
    • pp.1-6
    • /
    • 2014
  • PB/MC-CDMA is an efficient system which divides the whole frequency band into several blocks, unlike a conventional MC-CDMA system. We propose an efficient resource allocation scheme in Multi-Block PB/MC-CDMA (Partial Block Multi-Carrier Code Division Multiple Access). This system aims to improve frequency efficiency and maximize the total throughput while satisfying predefined threshold over various channel conditions. Through computer simulations, we confirm that the performance of the proposed system is more effective in terms of throughput.

  • PDF

Performance Improvement of IP Handover by Data Link Trigger (데이터링크 트리거에 의한 IP 핸드오버 성능 개선)

  • Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.55-60
    • /
    • 2016
  • In the traditional wireless LAN model, scan procedure to search a new AP starts when the predefined number of Rx failure of beacon frames are occurred. In this case, lots of data packet loss occur during MN's handover because loss of the relatively longer data packet starts before the small-sized beacon loss. Newly developed scanning mechanism in this paper has the beacon counter that increases when the Rx power level of beacon frame is less than the threshold and the previous rx power level. New scan procedure starts when the counter exceeds the predefined number. Beacon Rx power threshold is verified and performance of the new WLAN model is evaluated under UDP and TCP traffic environment.

Rake-Based Cellular Radar Receiver Design for Moving Target Detection in Multipath Channel

  • Kim, Yeejung;Jeong, Myungdeuk;Han, Youngnam
    • ETRI Journal
    • /
    • v.36 no.5
    • /
    • pp.799-807
    • /
    • 2014
  • In this paper, we design a rake-based cellular radar receiver (CRR) scheme to detect a moving target located in a multipath environment. The modules of Doppler filter banks, threshold level test, and target detection module are newly introduced into the conventional rake receiver so that it can function as a radar system. The proposed CRR tests the Doppler-shift frequency and signal-to-noise ratio of the received signal against predefined threshold levels to determine detection and then calculates target velocities and ranges. The system performance is evaluated in terms of detection probability and the maximum detection range under a Nakagami-n channel that reflects the multipath environment.

Rain Cell Size Distribution Using Radar Data During Squall Line Episodes (레이더 자료를 이용한 강우입자분포의 통계적 분석 연구)

  • Ricardo S. Tenorio;Kwon, Byung-Hyuk;Lee, Dong-In
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.5
    • /
    • pp.971-976
    • /
    • 2000
  • The main objective of this paper is to present the rain cell size distribution observed during squall line episodes in the Sudano-Sahelian region. The used data were collected during the EPSAT Program [Etude des Precipitation par SATellite (Satellites Study of Precipitation)] which has been developed since 1958, on an experimental area located near Niamey, Niger (2 10′32"E, 13 28′38"N). The data were obtained with a C-band radar and a network composed of approximately 100 raingages over a 10,000 $\textrm{km}^2$. In this work a culling of the squall line episodes was made for the 1992 rainy season. After radar data calibration using the raingage network a number of PPI (Plan Position Indicator) images were generated. Each image was then treated in order to obtain a series of radar reflectivity (Z) maps. To describe the cell distribution, a contouring program was used to analyze the areas with rain rate greater than or equal to the contour threshold (R$\geq$$\tau$). 24700 contours were generated, where each iso-pleth belongs to a predefined threshold. Computing each cell surface and relating its area to an equi-circle (a circle having the same area as the cell), a statistical analysis was made. The results show that the number of rain cells having a given size is an inverse exponential function of the equivalent radius. The average and median equivalent radii ate 1.4 and 0.69 In respectively. Implications of these results for the precipitation estimation using threshold methods are discussed.

  • PDF

A Scene Change Detection Technique using the Weighted $\chi^2$-test and the Automated Threshold-Decision Algorithm (변형된 $\chi^2$- 테스트와 자동 임계치-결정 알고리즘을 이용한 장면전환 검출 기법)

  • Ko, Kyong-Cheol;Rhee, Yang-Won
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.4 s.304
    • /
    • pp.51-58
    • /
    • 2005
  • This paper proposes a robust scene change detection technique that uses the weighted chi-square test and the automated threshold-decision algorithms. The weighted chi-square test can subdivide the difference values of individual color channels by calculating the color intensities according to NTSC standard, and it can detect the scene change by joining the weighted color intensities to the predefined chi-square test which emphasize the comparative color difference values. The automated threshold-decision at algorithm uses the difference values of frame-to-frame that was obtained by the weighted chi-square test. At first, The Average of total difference values is calculated and then, another average value is calculated using the previous average value from the difference values, finally the most appropriate mid-average value is searched and considered the threshold value. Experimental results show that the proposed algorithms are effective and outperform the previous approaches.

Detection and Management of Misbehaving Node in Tactical Ad-Hoc Networks (전술 Ad-hoc 네트워크에서의 비정상행위 노드 탐지 및 관리)

  • Jang, Beom-Geun;Lee, Soo-Jin
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.12 no.3
    • /
    • pp.333-343
    • /
    • 2009
  • Tactical Information Communication Network(TICN) is a concept-type integrated Military Communication system that enables precise command control and decision making by unifying the diversified military communication network and conveying diverse range of battle field information on real-time, at right place at right time. TICN is designed to advance into high speed, large capacity, long distance wireless relay transmission. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. Ad-hoc network is consist of mobile nodes and nodes in the network depends on the cooperation of other nodes for forwarding of packets. In this context, some non-cooperating nodes may delay forwarding of packets or drop the packets. This may hamper the network as a whole and disrupt communication between the cooperating nodes. To solve this problem, we present a solution with a Node Weight Management Server(NWMS), which manages each node's weight according to its behavior in local area. When the NWMS detects misbehaving node, it increases the node's weight. If the node's weight exceeds a predefined threshold then the NWMS broadcasts the node's information into network to isolate the misbehaving node from the network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

Minimum Duration Outage of a DS-CDMA Cellular System Due to Cell Traffic Intensity (Cell Traffic Untensity 에 따른 DS-CDMA 셀룰러 시스템의 최소기간 차단율)

  • Kim, Nam-Soo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.12 no.4
    • /
    • pp.570-575
    • /
    • 2001
  • The minimum duration outage probability of a cellular system is defined the probability that the received signal level is hold under minimum required threshold duration. This definition is more realistic compared to the outage probability which is the received signal strength level is below predefined threshold level. Especially, in a DS-CDMA cellular system the received signal-to-interference ratio is a function of cell traffic, while the former researches are only considered the minimum duration outage probability independent of the cell traffic. We noticed that the minimum outage probability is rapidly increases as cell traffic increase.

  • PDF