• Title/Summary/Keyword: 적응적 임계치

Search Result 79, Processing Time 0.028 seconds

Speed-up of Document Image Binarization Method Based on Water Flow Model (Water flow model에 기반한 문서영상 이진화 방법의 속도 개선)

  • 오현화;김도훈;이재용;김두식;임길택;진성일
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.4
    • /
    • pp.75-86
    • /
    • 2004
  • This paper proposes a method to speed up the document image binarization using a water flow model. The proposed method extracts the region of interest (ROI) around characters from a document image and restricts pouring water onto a 3-dimensional terrain surface of an image only within the ROI. The amount of water to be filed into a local valley is determined automatically depending on its depth and slope. The proposed method accumulates weighted water not only on the locally lowest position but also on its neighbors. Therefore, a valley is filed enough with only one try of pouring water onto the terrain surface of the ROI. Finally, the depth of each pond is adaptively thresholded for robust character segmentation, because the depth of a pond formed at a valley varies widely according to the gray-level difference between characters and backgrounds. In our experiments on real document images, the Proposed method has attained good binarization performance as well as remarkably reduced processing time compared with that of the existing method based on a water flow model.

Unsupervised Segmentation of Objects using Genetic Algorithms (유전자 알고리즘 기반의 비지도 객체 분할 방법)

  • 김은이;박세현
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.4
    • /
    • pp.9-21
    • /
    • 2004
  • The current paper proposes a genetic algorithm (GA)-based segmentation method that can automatically extract and track moving objects. The proposed method mainly consists of spatial and temporal segmentation; the spatial segmentation divides each frame into regions with accurate boundaries, and the temporal segmentation divides each frame into background and foreground areas. The spatial segmentation is performed using chromosomes that evolve distributed genetic algorithms (DGAs). However, unlike standard DGAs, the chromosomes are initiated from the segmentation result of the previous frame, then only unstable chromosomes corresponding to actual moving object parts are evolved by mating operators. For the temporal segmentation, adaptive thresholding is performed based on the intensity difference between two consecutive frames. The spatial and temporal segmentation results are then combined for object extraction, and tracking is performed using the natural correspondence established by the proposed spatial segmentation method. The main advantages of the proposed method are twofold: First, proposed video segmentation method does not require any a priori information second, the proposed GA-based segmentation method enhances the search efficiency and incorporates a tracking algorithm within its own architecture. These advantages were confirmed by experiments where the proposed method was success fully applied to well-known and natural video sequences.

Region-Based Moving Object Segmentation for Video Monitoring System (비디오 감시시스템을 위한 영역 기반의 움직이는 물체 분할)

  • 이경미;김종배;이창우;김항준
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.1
    • /
    • pp.30-38
    • /
    • 2003
  • This paper presents an efficient region-based motion segmentation method for segmenting of moving objects in a traffic scene with a focus on a Video Monitoring System (VMS). The presented method consists of two phases: motion detection and motion segmentation. Using the adaptive thresholding technique, the differences between two consecutive frames are analyzed to detect the movements of objects in a scene. To segment the detected regions into meaningful objects which have the similar intensity and motion information, the regions are initially segmented using a k-means clustering algorithm and then, the neighboring regions with the similar motion information are merged. Since we deal with not the whole image, but the detected regions in the segmentation phase, the computational cost is reduced dramatically. Experimental results demonstrate robustness in the occlusions among multiple moving objects and the change in environmental conditions as well.

Adaptive VM Allocation and Migration Approach using Fuzzy Classification and Dynamic Threshold (퍼지 분류 및 동적 임계 값을 사용한 적응형 VM 할당 및 마이그레이션 방식)

  • Mateo, John Cristopher A.;Lee, Jaewan
    • Journal of Internet Computing and Services
    • /
    • v.18 no.4
    • /
    • pp.51-59
    • /
    • 2017
  • With the growth of Cloud computing, it is important to consider resource management techniques to minimize the overall costs of management. In cloud environments, each host's utilization and virtual machine's request based on user preferences are dynamic in nature. To solve this problem, efficient allocation method of virtual machines to hosts where the classification of virtual machines and hosts is undetermined should be studied. In reducing the number of active hosts to reduce energy consumption, thresholds can be implemented to migrate VMs to other hosts. By using Fuzzy logic in classifying resource requests of virtual machines and resource utilization of hosts, we proposed an adaptive VM allocation and migration approach. The allocation strategy classifies the VMs according to their resource request, then assigns it to the host with the lowest resource utilization. In migrating VMs from overutilized hosts, the resource utilization of each host was used to create an upper threshold. In selecting candidate VMs for migration, virtual machines that contributed to the high resource utilization in the host were chosen to be migrated. We evaluated our work through simulations and results show that our approach was significantly better compared to other VM allocation and Migration strategies.

Noise-Biased Compensation of Minimum Statistics Method using a Nonlinear Function and A Priori Speech Absence Probability for Speech Enhancement (음질향상을 위해 비선형 함수와 사전 음성부재확률을 이용한 최소통계법의 잡음전력편의 보상방법)

  • Lee, Soo-Jeong;Lee, Gang-Seong;Kim, Sun-Hyob
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.1
    • /
    • pp.77-83
    • /
    • 2009
  • This paper proposes a new noise-biased compensation of minimum statistics(MS) method using a nonlinear function and a priori speech absence probability(SAP) for speech enhancement in non-stationary noisy environments. The minimum statistics(MS) method is well known technique for noise power estimation in non-stationary noisy environments. It tends to bias the noise estimate below that of true noise level. The proposed method is combined with an adaptive parameter based on a sigmoid function and a priori speech absence probability (SAP) for biased compensation. Specifically. we apply the adaptive parameter according to the a posteriori SNR. In addition, when the a priori SAP equals unity, the adaptive biased compensation factor separately increases ${\delta}_{max}$ each frequency bin, and vice versa. We evaluate the estimation of noise power capability in highly non-stationary and various noise environments, the improvement in the segmental signal-to-noise ratio (SNR), and the Itakura-Saito Distortion Measure (ISDM) integrated into a spectral subtraction (SS). The results shows that our proposed method is superior to the conventional MS approach.

Performance Analysis of an Adaptive Hybrid Search Code Acquisition Algorithm for DS-CDMA Systems (DS-CDMA 시스템을 위한 적응 혼합 검색형 동기획득 알고리즘의 성능 분석)

  • Park Hyung rae;Yang Yeon sil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3C
    • /
    • pp.83-91
    • /
    • 2005
  • We analyze the performance of an adaptive hybrid search code acquisition algorithm for direct-sequence code division multiple access (DS-CDMA) systems under slowly-moving mobile environments. The code acquisition algorithm is designed to provide the desired feature of constant false alarm rate (CFAR) to cope with nonstationarity of the interference in CDMA forward links. An analytical expression for the mean acquisition time is first derived and the probabilities of detection, miss, and false alarm are then obtained for frequency-selective Rayleigh fading environments. The fading envelope of a received signal is assumed to be constant over the duration of post-detection integration (PDI), considering slow fading environments. Finally, the performance of the designed code acquisition algorithm shall be evaluated numerically to examine the effect of some design parameters such as the sub-window size, size of the PDI, decision threshold, and so on, considering cdma2000 environments.

Random Early Beacon Broadcast (REB2) for Cooperative Vehicle Safety Applications (차량안전 응용을 위한 임의 조기 비컨방송)

  • Jeong, Han-You;Nguyen, Hoa-Hung
    • Journal of IKEEE
    • /
    • v.24 no.4
    • /
    • pp.1017-1021
    • /
    • 2020
  • In the V2X communications, each vehicle periodically broadcasts a message, called a beacon, so that its neighbor vehicles can accurately predict the near-future positions of the sending vehicle. In particular, the mobility-adaptive beacon broadcast (MAB2) scheme keeps the tracking error of a sending vehicle below a fixed threshold within a few consecutive beacon losses. In this paper, we present a random-early beacon broadcast (REB2) scheme that addresses the beacon aging problem of the MAB2 scheme. The simulation results show that, for a neighbor vehicle within 100 m distance, the tracking failure probability of REB2 scheme can be reduced to less than 1/10 of that of MAB2 scheme.

A Wireless Traffic Load-Balancing Algorithm based on Adaptive Bandwidth Reservation Scheme in Mobile Cellular Networks (셀룰러 망에서 적응적 대역폭 예약 기법을 이용한 무선 트래픽 부하 균형 알고리즘)

  • 정영석;우매리;김종근
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.21-24
    • /
    • 2001
  • For very large multimedia traffic to be supported successfully in wireless network environment, it is necessary to provide Quality-of-Service(QoS) guarantees between mobile hosts(clients). In order to guarantee the Qos, we have to keep the call blocking probability below target value during handoff session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic in the new cell, since mobile clients should be able to continue their on-going sessions. In this paper we propose a efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. We design a new method to predict the mobility of clients using MPT(mobility profile table). This method is then used to reserve a part of bandwidths for handoff calls to its adjacent cells and this reserved bandwidth can be used for handoff call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with a adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure the metrics such as the blocking probability of new calls and dropping probability of handoff calls, and compare with other existing schemes.

  • PDF

A Frame-based Coding Mode Decision for Temporally Active Video Sequence in Distributed Video Coding (분산비디오부호화에서 동적비디오에 적합한 프레임별 모드 결정)

  • Hoangvan, Xiem;Park, Jong-Bin;Shim, Hiuk-Jae;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.3
    • /
    • pp.510-519
    • /
    • 2011
  • Intra mode decision is a useful coding tool in Distributed Video Coding (DVC) for improving DVC coding efficiency for video sequences having fast motion. A major limitation associated with the existing intra mode decision methods, however, is that its efficiency highly depends on user-specified thresholds or modeling parameters. This paper proposes an entropy-based method to address this problem. The probabilities of intra and Wyner?Ziv (WZ) modes are determined firstly by examining correlation of pixels in spatial and temporal directions. Based on these probabilities, entropy of the intra and the WZ modes are computed. A comparison based on the entropy values decides a coding mode between intra coding and WZ coding without relying on any user-specified thresholds or modeling parameters. Experimental results show its superior rate-distortion performance of improvements of PSNR up to 2 dB against a conventional Wyner?Ziv coding without intra mode decision. Furthermore, since the proposed method does not require any thresholds or modeling parameters from users, it is very attractive for real life applications.

An Adaptive Tone Reservation Scheme for PAPR Reduction of OFDM Signals (OFDM 신호의 PAPR 감소를 위한 적응적 톤 예약 기법)

  • Yang, Mo-Chan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.817-824
    • /
    • 2019
  • We propose an ATR (Adaptive Tone Reservation) scheme based on clipping noise for PAPR (Peak-to-Average Power Ratio) reduction of OFDM (Orthogonal Frequency Division Multiplexing) signals. The proposed scheme is composed of three steps: clipping, tone selection, and TR procedures. In the first step, the peak samples in the IFFT (Inverse Fast Fourier Transform) outputs are scaled down by clipping. In the second step, the sub-carrier position where the power of the clipping noise is the maximum, is selected. Finally, the generic TR procedure is performed. Simulation results show that the proposed scheme does not require all the possible combinations for the original TR procedures, while maintaining the PAPR reduction performance.