• Title/Summary/Keyword: Predefined threshold

Search Result 63, Processing Time 0.024 seconds

Wavelet-based Fusion of Optical and Radar Image using Gradient and Variance (그레디언트 및 분산을 이용한 웨이블릿 기반의 광학 및 레이더 영상 융합)

  • Ye, Chul-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.26 no.5
    • /
    • pp.581-591
    • /
    • 2010
  • In this paper, we proposed a new wavelet-based image fusion algorithm, which has advantages in both frequency and spatial domains for signal analysis. The developed algorithm compares the ratio of SAR image signal to optical image signal and assigns the SAR image signal to the fused image if the ratio is larger than a predefined threshold value. If the ratio is smaller than the threshold value, the fused image signal is determined by a weighted sum of optical and SAR image signal. The fusion rules consider the ratio of SAR image signal to optical image signal, image gradient and local variance of each image signal. We evaluated the proposed algorithm using Ikonos and TerraSAR-X satellite images. The proposed method showed better performance than the conventional methods which take only relatively strong SAR image signals in the fused image, in terms of entropy, image clarity, spatial frequency and speckle index.

A Prioritized call Admission for supporting voice Activated/Controlled Services in Cellular CDMA Systems (셀룰러 CDMA 시스템에서의 음성제어 서비스 지원을 위한 우선 순위 호 수락제어)

  • 위성철;김동우
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.3
    • /
    • pp.242-249
    • /
    • 2003
  • When special voice control application services (VCS) such as voice-controlled web browsing or voice-controlled stock transactions are introduced in cellular systems, a channel quality better than that for ordinary voice communications service (OVS) is necessary in order to keep a suitable grade of VCS. To avoid ai. congestion, calls are normally admitted if there exists a channel-processing resource not occupied by other calls in the base as well as the interference level at the receiver is not higher than a predefined threshold. The threshold is usually 10㏈ noise-rise over the background noise level for voice communications service. When the base admits VCS attempts in exactly the same manner as it handles OVS calls. the same fraction of those will be not successful in taking the channel and then blocked. If the same noise-rise threshold is used as 10 ㏈, however, the admitted VCS calls might suffer from bad channel qualify and finally be dropped. From the user's point of view, the forced termination of ongoing calls is significantly undesirable than blocking new call attempts. When using a lower noise-rise threshold for VCS. on the other hand, the blocking probability of VCS gets higher than that of OVS. In this paper, a call admission policy that gives a priority to VCS is considered in order to reduce the blocking probability and keep an adequate channel quality.

Distributed Power and Rate Control for Cognitive Radio Networks

  • Wang, Wei;Wang, Wenbo;Zhu, Yajun;Peng, Tao
    • Journal of Communications and Networks
    • /
    • v.11 no.2
    • /
    • pp.166-174
    • /
    • 2009
  • In this paper, a distributed power and end-to-end rate control algorithm is proposed in the presence of licensed users. By Lagrangian duality theory, the optimal power and rate control solution is given for the unlicensed users while satisfying the interference temperature limits to licensed users. It is obtained that transmitting with either 0 or the maximum node power is the optimal scheme. The synchronous and asynchronous distributed algorithms are proposed to be implemented at the nodes and links. The convergence of the proposed algorithms are proved. Finally, further discussion on the utility-based fairness is provided for the proposed algorithms. Numerical results show that the proposed algorithm can limit the interference to licensed user under a predefined threshold.

A Face Recognition System using Geometric Image Processing (기하학적 영상처리를 이용한 얼굴인식 시스템)

  • 이항찬
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1139-1148
    • /
    • 2003
  • Biometric system has been studied as an optimal solution for preventing or reducing the peculation or loss of ID. Nowadays, face recognition has been spot-lighted as a future biometric system because it is not forced to contact the part of human body with the specific input area of the system. However, there is some limitations to get the constant facial features because the size of face area is varied by the capturing distance or tilt of the face. In this paper, we can extract constant facial features within the predefined threshold using the simple geometric processing such as image scaling, transformation, and rotation for frontal face images. This face recognition system identifies faces with 92% of accuracy for the 400 images of 40 different people.

  • PDF

An Ambiguity-free Surface Construction from Volume Data (입체적인 데이터에서 애매성-프리 표면 재구성)

  • Lee, Ee-Taek;Oh, Kwang-Man;Park, Kyu Ho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.4 no.1
    • /
    • pp.55-66
    • /
    • 1998
  • This paper presents a simple method for relieving the ambiguity problems within the sub-voxel based surface-fitting approach for the surface construction. ECB algorithm is proposed to avoid the ambiguity problem which is the root of the holes within the resulting polygon based approximation. The basic idea of our disambiguation strategy is the use of a set of predefined modeling primitives (we call SMP) which guarantees the topological consistency of resulted surface polygons. 20 SMPs are derived from the extension of the concept of the elementary modeling primitives in the CB algorithm [3], and fit one to five faces of them to the iso-surface crossing a cell with no further processing. A look-up table which has a surface triangle list is pre-calculated using these 20 SMPs. All of surface triangles in the table are from the faces of SMPs and are stored in the form of edge list on which vertices of each surface triangle are located. The resulted polygon based approximation is unique at every threshold value and its validity is guaranteed without considering the complicated problems such as average of density and postprocessing. ECB algorithm could be free from the need for the time consuming post-processing, which eliminates holes by revisiting every boundary cell. Through three experiments of surface construction from volume data, its capability of hole avoidance is showed.

  • PDF

An Efficient 3-D Deinterlacing Algorithm by Detecting Accurate Motions Using Adaptive-Thresholded Values (적응적인 임계값을 적용한 정확한 움직임 검출과 이를 이용한 효율적인 3-D 디인터레이싱 알고리즘)

  • Cho, Dae-Rim;Song, Jin-Mo;Lee, Dong-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.11
    • /
    • pp.1610-1620
    • /
    • 2010
  • This paper proposes a motion-adaptive 3-D deinterlacing algorithm based on an adaptive-thresholded motion detection and an interpolation method using binary patterns to compensate motion missing and false motion errors. For efficient motion detection, we adaptively decided a threshold value according to the complexity of image. Many edge-based interpolation algorithms have been proposed to improve the subjective quality. Recently, to efficiently interpolate low angle edge and line, a method using predefined binary patterns has been proposed. In this paper, we propose an improved method by modifying the binary patterns. Simulation results have shown that the proposed method provides better performance than the existing methods.

Linking Clinical Events in Elderly to In-home Monitoring Sensor Data: A Brief Review and a Pilot Study on Predicting Pulse Pressure

  • Popescu, Mihail;Florea, Elena
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.2
    • /
    • pp.180-199
    • /
    • 2008
  • Technology has had a tremendous impact on our daily lives. Recently, technology and its impact on aging has become an expanding field of inquiry. A major reason for this interest is that the use of technology can help older people who experience deteriorating health to live independently. In this paper we give a brief review of the in-home monitoring technologies for the elderly. In the pilot study, we analyze the possibility of employing the data generated by a continuous, unobtrusive nursing home monitoring system for predicting elevated(abnormal)pulse pressure(PP) in elderly(PP=systolic blood pressure-diastolic blood pressure). Our sensor data capture external information(behavioral) about the resident that is subsequently reflected in the predicted PP. By continuously predicting the possibility of elevated pulse pressure we may alert the nursing staff when some predefined threshold is exceeded. This approach may provide additional blood pressure monitoring for the elderly persons susceptible to blood pressure variations during the time between two nursing visits. We conducted a retrospective pilot study on two residents of the TigerPlace aging in place facility with age over 70, that had blood pressure measured between 100 and 300 times during a period of two years. The pilot study suggested that abnormal pulse pressure can be reasonably well estimated (an area under ROC curve of about 0.75) using apartment bed and motion sensors.

A Dynamic Power Management System for Multiple Client in Cloud Computing Environment (클라우드 환경에서 다중 클라이언트를 위한 동적 전원관리 시스템)

  • Cha, Seung-Min;Lee, Bong-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.2
    • /
    • pp.213-221
    • /
    • 2012
  • In this paper, a dynamic power management system is proposed to reduce energy consumption for multiple clients in cloud computing environments. The proposed system monitors both keyboard and mouse input from the user, available memory, and CPU usage in the virtual machine. If the system detects no keyboard and mouse input for a certain amount of time and both available memory and CPU usage reach predefined threshold value, the manager in the virtual machine orders the client to shutdown the client machine, which results in significant power save. The developed system is applied to the real university computer lab and the performance of the system is evaluated.

Estimation of Degradation Period Ratio for Adaptive Framework in Mobile Cellular Networks (이동 통신망에서 적응형 구조의 호 저하 시간 비율 추정)

  • Jeong Seong Hwan;Lee Se Jin;Hong Jeong Wan;Lee Chang Hun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.441-447
    • /
    • 2003
  • Recently there is a growing Interest In mobile cellula r network providing multimedia service. However, the link bandwidth of mobile cellular network is not sufficient enough to provide satisfactory services to use rs. To overcome this problem, an adaptive framework has been proposed in this study, we propose a new method of estimating DPR(degradation period ratio) in an adaptive multimedia network where the bandwidth of ongoing call can be dynamically adjusted during its lifetime. DPR is a QoS(quality of service) parameter which represents the ratio of allocated bandwidth below a pre-defined target to the whole service time of a call. We improve estimation method of DPR using DTMC(discrete time Markov chain) model. We also calculate mean degradation period and degradation probability more precisely than in existing studies. Under Threshold CAC(call admission control) algorithm, we present analytically how to guarantee QoS to users and illustrate the method by numerical examples. The proposed method is expected to be used as one of CAC schemes in guaranteeing predefined QoS level of DPR

  • PDF

Exact and Approximate Symbol Error Probability of cooperative systems with best relay selection and all participating relaying using Amplify and Forward or Decode and Forward Relaying over Nakagami-m fading channels

  • Halima, Nadhir Ben;Boujemaa, Hatem
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.81-108
    • /
    • 2018
  • In this paper, we derive the theoretical Symbol Error Probability (SEP) of cooperative systems with best relay selection for Nakagami-m fading channels. For Amplify and Forward (AF) relaying, the selected relay offers the best instantaneous Signal to Noise Ratio (SNR) of the relaying link (source-relay-destination). In cooperative networks using Decode and Forward (DF), the selected relay offers the best instantaneous SNR of the link between the relay and the destination among the relays that have correctly decoded the transmitted information by the source. In the second part of the paper, we derive the SEP when all participating AF and DF relaying is performed. In the last part of the paper, we extend our results to cognitive radio networks where there is interference constraints : only relays that generate interference to primary receiver lower than a predefined threshold T can transmit. Both AF and DF relaying with and without relay selection are considered.