• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.213-220
• /
• 2008

This paper analyzes a broadcasting technique for wireless multi-hop sensor networks that uses a form of cooperative diversity called opportunistic large arrays (OLAs). We propose a method for autonomous scheduling of the nodes, which limits the nodes that relay and saves as much as 32% of the transmit energy compared to other broadcast approaches, without requiring global positioning system (GPS), individual node addressing, or inter-node interaction. This energy-saving is a result of cross-layer interaction, in the sense that the medium access control (MAC) and routing functions are partially executed in the physical (PHY) layer. Our proposed method is called OLA with a transmission threshold (OLA-T), where a node compares its received power to a threshold to decide if it should forward. We also investigate OLA with variable threshold (OLA-VT), which optimizes the thresholds as a function of level. OLA-T and OLA-VT are compared with OLA broadcasting without a transmission threshold, each in their minimum energy configuration, using an analytical method under the orthogonal and continuum assumptions. The trade-off between the number of OLA levels (or hops) required to achieve successful network broadcast and transmission energy saved is investigated. The results based on the analytical assumptions are confirmed with Monte Carlo simulations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.103-109
• /
• 1995

In this paper, we propose a postprocessing method that neatly removes blocking effect but retains visually important image details and edges. The iterative thresholded lowpass filter is basically a low pass filter whose ouput depends on three variable elements. I.e. iteration number, threshold value and passband width. The threshold value restricts the difference between the output of the proposed filter and the original input independent of the iteration number. With this property, the iterative thresholded lowpass filter can retain most of the image details while smoothing the block boundaries. The other two variable elements, i.e. iteration number and passband width, can determine the convergence speed of the proposed filter. In this paper, we also propose several adaptive filtering techniques based on the iterative thresholded lowpass filter with their simulation results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.468-472
• /
• 2004

This paper presents an intelligent iris recognition system which consists of quality check, iris localization, feature extraction, and verification. For the quality check, the local statistics on the pupil boundary is used. Gaussian mixture model is used to segment and localized the iris region. The feature extraction method is based on an optimal waveform simplification. For the verification, we use an intelligent variable threshold.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2725-2736
• /
• 1998

In this paper. we present a new pitch determination method for speech analysis. namely VFF(Variable Forgetting Factor) based. by using the WRLS-VFF-VT(Weighted Recursive Least Square-Variable Forgetting Factor-Variable Threshold) algorithm. A proposed method uses VFF to identify the glottal closure points which correspond to the instants of the main excitation pulses for voiced speech. The modified EGG

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.250-253
• /
• 2006

In this paper, we proposed a new method of the Adaptive steganography using complexity on bit planes of color image. Applying fixing threshold and variable length, if insert information into all bit plans, all bit plans showed different image quality. Therefore, we first defined the complexity on bit plane and data complexity, similarity insert information into bit plans. As a result, the proposed method increased the insertion capacity and improved the image quality than fixing threshold and variable length method.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.147-154
• /
• 2013

We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types (type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer. If the queue length of type-1 customer exceeds a threshold L, the service priority is given to the type-1 customer. Otherwise, the service priority is given to type-2 customer. Method of supplementary variable by remaining service time gives us information for queue length of two buffers. That is, we derive the differential difference equations for our queueing system. We obtain joint probability generating function for two queue lengths and the remaining service time. Also, the mean queue length of each buffer is derived.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.337-340
• /
• 2009

Wireless tele-home-care application gives new possibilities for ECG (electrocardiogram) monitoring system with wearable biomedical sensors. Thus, continuously development of high convenient ECG monitoring system for high-risk cardiac patients is essential. This paper describes to monitor a person's ECG using wearable approach. A wearable belt-type ECG electrode with integrated electronics has been developed and has proven long-term robustness and monitoring of all electrical components. The measured ECG signal is transmitted via an ultra low power consumption wireless sensor node. ECG signals carry a lot clinical information for a cardiologist especially the R-peak detection in ECG. R-peak detection generally uses the threshold value which is fixed thus it bring errors due to motion artifacts and signal size changes. Variable threshold method is used to detect the R-peak which is more accurate and efficient. In order to evaluate the performance analysis, R-peak detection using MIT-BIH databases and Long Term Real-Time ECG is performed in this research. This concept able to allow patient to follow up critical patients from their home and early detecting rarely occurrences of cardiac arrhythmia.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11C
• /
• pp.1077-1084
• /
• 2006

This paper proposed a fast algorithm to reduce the amount of calculation for inter prediction which takes a great deal of the operational time in H.264/AVC. This algorithm decides a search range according to the direction of predicted motion vector, and then performs an adaptive spiral search for the candidates with JM(Joint Model) FME(Fast Motion Estimation) which employs the rate-distortion optimization(RDO) method. Simultaneously, it decides a threshold cost value for each of the variable block sizes and performs the motion estimation for the variable search ranges with the threshold. These activities reduce the great amount of the complexity in inter prediction encoding. Experimental results by applying the proposed method .to various video sequences showed that the process time was decreased up to 80% comparing to the previous prediction methods. The degradation of video quality was only from 0.05dB to 0.19dB and the compression ratio decreased as small as 0.58% in average. Therefore, we are sure that the proposed method is an efficient method for the fast inter prediction.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1343-1358
• /
• 2020

In the stagewise arithmetic orthogonal matching pursuit algorithm, the weak threshold used in sparsity estimation is determined via maximum iterations. Different maximum iterations correspond to different thresholds and affect the performance of the algorithm. To solve this problem, we propose an improved variable weak threshold based on the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the residual error value to control the weak threshold. When the residual value decreases, the threshold value continuously increases, so that the atoms contained in the atomic set are closer to the real sparsity value, making it possible to improve the reconstruction accuracy. In addition, we improved the generalized Jaccard coefficient in order to replace the inner product method that is used in the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the covariance to replace the joint expectation for two variables based on the generalized Jaccard coefficient. The improved generalized Jaccard coefficient can be used to generate a more accurate calculation of the correlation between the measurement matrixes. In addition, the residual is more accurate, which can reduce the possibility of selecting the wrong atoms. We demonstrate using simulations that the proposed algorithm produces a better reconstruction result in the reconstruction of a one-dimensional signal and two-dimensional image signal.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.354-361
• /
• 2009

Shot change detection is the main technique in the video segmentation which requirs real-time processing and automatical processing in hardware. Until now, there were few research reports about real-time shot change detection for applying to hardware terminals with low performance such as PMPs(Portable Media Player) and cellular phones. In this paper, we propose shot change detection technique using adaptive threshold setting method on variable reference block. Our proposed algorithm determines shot change detection by comparing the feature value of current frame and a mean of a feature value on variable reference blocks. The proposed method can be used independently from the feature value of frame, can adaptively set thresholds using a mean of a feature value on variable reference blocks. We obtained better detection ratio than the conventional methods maximally by precision 0.146, recall 0.083, F1 0.089 in the experiment with the same test sequences. We verified real-time operation of shot change detection by implementing our algorithm on the PMP from some company of H. Therefore, our proposing algorithm will be helpful in searching video data on portable media players such as PMPs and cellular phones.