• Title/Summary/Keyword: Threshold Map

Search Result 156, Processing Time 0.021 seconds

Clutter Rejection Method using Background Adaptive Threshold Map (배경 적응적 문턱치 맵(Threshold Map)을 이용한 클러터 제거 기법)

  • Kim, Jieun;Yang, Yu Kyung;Lee, Boo Hwan;Kim, Yeon Soo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.17 no.2
    • /
    • pp.175-181
    • /
    • 2014
  • In this paper, we propose a robust clutter pre-thresholding method using background adaptive Threshold Map for the clutter rejection in the complex coastal environment. The proposed algorithm is composed of the use of Threshold Map's and method of its calculation. Additionally we also suggest an automatic decision method of Thresold Map's update. Experimental results on some sets of real infrared image sequence show that the proposed method could remove clutters effectively without any loss of detection rate for the aim target and reduce processing time dramatically.

Obtaining Object by Using Optimal Threshold for Saliency Map Thresholding (Saliency Map을 이용한 최적 임계값 기반의 객체 추출)

  • Hai, Nguyen Cao Truong;Kim, Do-Yeon;Park, Hyuk-Ro
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.6
    • /
    • pp.18-25
    • /
    • 2011
  • Salient object attracts more and more attention from researchers due to its important role in many fields of multimedia processing like tracking, segmentation, adaptive compression, and content-base image retrieval. Usually, a saliency map is binarized into black and white map, which is considered as the binary mask of the salient object in the image. Still, the threshold is heuristically chosen or parametrically controlled. This paper suggests using the global optimal threshold to perform saliency map thresholding. This work also considers the usage of multi-level optimal thresholds and the local adaptive thresholds in the experiments. These experimental results show that using global optimal threshold method is better than parametric controlled or local adaptive threshold method.

Assessment of Chaotic-Threshold Model on Integral Pulse Frequency Modulation for HRV Analysis (심박변이도 해석을 위한 가상 심장박동 발진기의 카오스-임계치 모델 성능 평가)

  • Jeung, Gyeo-Wun;Kim, Jeong-Hwan;Lee, Jeong-Whan;Kim, Kyeong-Seop
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.3
    • /
    • pp.581-586
    • /
    • 2017
  • The well-known Integral Pulse Frequency Modulation (IPFM) cardiac oscillator has been used to generate the heart beat fluctuations as a representation of the modulatory autonomic nervous activity in terms of sympathetic and parasympathetic state. The IPFM model produces heartbeats by integrating the modulated sinusoid signals and applying the threshold of unity or chaotic threshold levels. This study aims at evaluating the performance of IPFM model by analyzing the influence of the threshold level with comparatively applying preset threshold of unity and Logistic-map and Henon-map chaotic-threshold. Based on our simulated results with interpreting the spectral features of Heart Rate Variability (HRV), we can conclude that the IPFM model with preset threshold level of unity can generate the optimal heartbeat variations int the sense of clinically valid heartbeats.

MAP Load Control and Route Optimization in HMIPv6 (HMIPv6에서의 MAP의 부하 제어 및 경로 최적화)

  • Nam, Sung-Hyun;Lee, Kyung-Geun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.120-127
    • /
    • 2008
  • HMIPv6 draws lots of attentions in recent years for providing an efficient handover and reducing the signaling overhead. HMIPv6 employs MAP(Mobility Anchor Point) in order to minimize a signaling overhead and a local mobility management. MAP completes an efficient mobility management in HMIPv6 network environment with frequent handover. However, HMIPv6 causes load concentration at a paricular MAP and may have unnecessary latency between HN(Mobile Node) and CN(Correspondent Node) within the same network. A MAP may also disturb the route optimization in HMIPv6 network because all packets must be transmitted through a MAP. In this paper, we propose a scheme to optimize the route in HMIPv6 networks according to MAP load. We configure a threshold in order to support the better service into MAP domain. The packets do not pass through MAP and are directly transmitted to AR(Access Router) if the number of current MNs attached to the MAP exceed the desired threshold. We simulate the performance of the proposed scheme and compare with HMIPv6. Resultly, the proposed scheme reduces signaling costs and mitigates concentration of a paticular MAP as well.

Blur Detection through Multinomial Logistic Regression based Adaptive Threshold

  • Mahmood, Muhammad Tariq;Siddiqui, Shahbaz Ahmed;Choi, Young Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.18 no.4
    • /
    • pp.110-115
    • /
    • 2019
  • Blur detection and segmentation play vital role in many computer vision applications. Among various methods, local binary pattern based methods provide reasonable blur detection results. However, in conventional local binary pattern based methods, the blur map is computed by using a fixed threshold irrespective of the type and level of blur. It may not be suitable for images with variations in imaging conditions and blur. In this paper we propose an effective method based on local binary pattern with adaptive threshold for blur detection. The adaptive threshold is computed based on the model learned through the multinomial logistic regression. The performance of the proposed method is evaluated using different datasets. The comparative analysis not only demonstrates the effectiveness of the proposed method but also exhibits it superiority over the existing methods.

Depth Map Coding Using Histogram-Based Segmentation and Depth Range Updating

  • Lin, Chunyu;Zhao, Yao;Xiao, Jimin;Tillo, Tammam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.1121-1139
    • /
    • 2015
  • In texture-plus-depth format, depth map compression is an important task. Different from normal texture images, depth maps have less texture information, while contain many homogeneous regions separated by sharp edges. This feature will be employed to form an efficient depth map coding scheme in this paper. Firstly, the histogram of the depth map will be analyzed to find an appropriate threshold that segments the depth map into the foreground and background regions, allowing the edge between these two kinds of regions to be obtained. Secondly, the two regions will be encoded through rate distortion optimization with a shape adaptive wavelet transform, while the edges are lossless encoded with JBIG2. Finally, a depth-updating algorithm based on the threshold and the depth range is applied to enhance the quality of the decoded depth maps. Experimental results demonstrate the effective performance on both the depth map quality and the synthesized view quality.

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.

A Study for Effective Speaker Adaptation and a priori Threshold Updating in Speaker Verification (화자 인증에서의 효과적인 화자 적응과 a priori Threshold Updating에 관한 연구)

  • 조영훈;이수호;홍대희;고한석
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.491-494
    • /
    • 2001
  • 실제 화자 인증기를 설계함에 있어서 발생하는 가장큰 문제는, 적은 Enrollment data로 화자 모델이 만들어 지므로 화자 인증기의 성능이 시간이 지남에 따라 굉장히 줄어들게 되는 것과, 미리 훈련된 데이터 만으로 Threshold를 설정함에 따라 차후 실제 사용 시에 발생하는 변이를 고려하지 못하여 역시 성능 저하의 문제를 발생시킨다는 것이다. 위의 문제를 해결하기 위해 이 논문은 화자 모델을 구성하는데 있어 MAP 방법을 적용하고, threshold를 Resetting하는 방법을 적용했다. 본 논문에서 제안한 방법으로 HTER값이 23%정도 줄어듦을 보여준다.

  • PDF

Developing Warning Map for Risk Monitoring on Personal Information Security (개인정보보호를 위한 리스크 모니터링: 경고맵)

  • Lee, Youngjai;Shin, Sangchul;Min, Geumyoung
    • Journal of Korean Society of societal Security
    • /
    • v.1 no.4
    • /
    • pp.33-40
    • /
    • 2008
  • Personal information security has been as risk ever since the development of information technology increased its internet use. As personal information security is compromised there will be a rise in personal privacy conflicts and this will become an important social issue. The following research is a presentation of the warning map for risk monitoring on personal information security. First, the personal information security process is identified then defined. Second, in order to achieve the personal information security's objective, a survey was taken and the data was collected. Third, factor in the Fishbone Diagram's analysis and figure out the key indicators that include metric and threshold. Last, develop the warning map which has the matrix table composed of the process and the risk. It displays the warning based on the threshold and the value of key indicators related to risks.

  • PDF

An Extraction Technique of Automatic Recognizing Regions on Power Distribution Facility Map by Partial Extension (부분확장에 의한 배전설비도면의 자동인식 대상영역 추출 방법)

  • Kim, Gye-Young;Lee, Bong-Jae;Cho, Seon-Ku;Woo, Hee-Gon
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.10
    • /
    • pp.1349-1355
    • /
    • 1999
  • A power distribution facility map is drawn on cadastral map. Besides, grid lines are added on the map for sectionalization. For automatic recognition of the map, we first extract recognizing regions. In this paper, we propose an extraction method of recognizing regions by partially extending thinned image. The proposed method is consist of three phases, binarization phase, thinning phase and partial extending phase. The first phase generate a binary image using threshold value which is obtained by histogram analysis. The binary image contains many part of recognizing regions, but not all. The second phase generate thinned image which is generated by appling thinning operator to the binary image. And the third phase extends thinned image from terminal point until satisfying termination condition. The proposed method is tested on several power distribution facility maps, and the results are presented.

  • PDF