• Journal of Korea Multimedia Society
• /
• v.13 no.3
• /
• pp.417-429
• /
• 2010

Though background subtraction has been widely studied for last decades, it is still a poorly solved problem especially when it meets real environments. In this paper, we first address some common problems for background subtraction that occur in real environments and then those problems are resolved by improving an existing GMM-based background modeling method. First, to achieve low computations, fixed point operations are used. Because background model usually does not require high precision of variables, we can reduce the computation time while maintaining its accuracy by adopting fixed point operations rather than floating point operations. Secondly, to avoid erroneous backgrounds that are induced by high pedestrian traffic, static levels of pixels are examined using shot-time statistics of pixel history. By using a lower learning rate for non-static pixels, we can preserve valid backgrounds even for busy scenes where foregrounds dominate. Finally, to adapt rapid illumination changes, we estimated the intensity change between two consecutive frames as a linear transform and compensated learned background models according to the estimated transform. By applying the fixed point operation to existing GMM-based method, it was able to reduce the computation time to about 30% of the original processing time. Also, experiments on a real video with high pedestrian traffic showed that our proposed method improves the previous background modeling methods by 20% in detection rate and 5~10% in false alarm rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1970-1982
• /
• 1993

This paper describes an efficient array algorithm for parallel computation of vector-radix two-dimensional (2-D) fast discrete cosine transform (VR-FCT), and its VLSI implementation. By mapping the 2-D VR-FCT onto a 2-D array of processing elements (PEs), the butterfly structure of the VR-FCT can be efficiently importanted with high concurrency and local communication geometry. The proposed array algorithm features architectural modularity, regularity and locality, so that it is very suitable for VLSI realization. Also, no transposition memory is required, which is invitable in the conventional row-column decomposition approach. It has the time complexity of O(N+Nnzp-log2N) for (N*N) 2-D DCT, where Nnzd is the number of non-zero digits in canonic-signed digit(CSD) code, By adopting the CSD arithmetic in circuit desine, the number of addition is reduced by about 30%, as compared to the 2`s complement arithmetic. The computational accuracy analysis for finite wordlength processing is presented. From simulation result, it is estimated that (8*8) 2-D DCT (with Nnzp=4) can be computed in about 0.88 sec at 50 MHz clock frequency, resulting in the throughput rate of about 72 Mega pixels per second.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.129-137
• /
• 2001

Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1303-1310
• /
• 2009

Glassless 3D display requires multiple images taken from different viewpoints to show a scene. The simplest way to get multi-view image is using multiple camera that as number of views are requires. To do that, synchronize between cameras or compute and transmit lots of data comes critical problem. Thus, generating such a large number of viewpoint images effectively is emerging as a key technique in 3D video technology. Image-based view synthesis is an algorithm for generating various virtual viewpoint images using a limited number of views and depth maps. In this paper, because the virtual view image can be express as a transformed image from real view with some depth condition, we propose an algorithm to compute multi-view synthesis from two reference view images and their own depth-map by stepwise duplex forward mapping. And also, because the geometrical relationship between real view and virtual view is repetitively, we apply our algorithm into OpenGL Shading Language which is a programmable Graphic Process Unit that allow parallel processing to improve computation time. We demonstrate the effectiveness of our algorithm for fast view synthesis through a variety of experiments with real data.

• Journal of Pharmacopuncture
• /
• v.19 no.3
• /
• pp.207-212
• /
• 2016

Objectives: Acupuncture treatments are safe and effective for a wide variety of diseases involving autonomic dysregulation. Heart rate variability (HRV) is a noninvasive method for assessing sympathovagal balance. The low frequency/high frequency (LF/HF) spectral power ratio is an index of sympathovagal influence on heart rate and of cardiovascular health. This study tests the hypothesis that from rest to 30% to 50% of peak oxygen consumption, the nonlinear Conte-Zbilut-Federici (CZF) method of computing the LF/HF ratio is a more reliable index of changes in the HRV than linear methods are. Methods: The subjects of this study were 10 healthy young adults. Electrocardiogram RR intervals were measured during 6-minute periods of rest and aerobic exercise on a cycle ergometer at 30% and 50% of peak oxygen consumption ($VO_{2peak}$). Results: The frequency domain CZF computations of the LF/HF ratio and the time domain computations of the standard deviation of normal-to-normal intervals (SDNN) decreased sequentially from rest to 30% $VO_{2peak}$ (P < 0.001) to 50% $VO_{2peak}$ (P < 0.05). The SDNN and the CZF computations of the LF/HF ratio were positively correlated (Pearson's r = 0.75, P < 0.001). fast Fourier transform (FFT), autoregressive (AR) and Lomb periodogram computations of the LF/HF ratio increased only from rest to 50% $VO_{2peak}$. Conclusion: Computations of the LF/HF ratio by using the nonlinear CZF method appear to be more sensitive to changes in physical activity than computations of the LF/HF ratio by using linear methods. Future studies should determine whether the CZF computation of the LF/HF ratio improves evaluations of pharmacopuncture and other treatment modalities.

• Journal of Korea Water Resources Association
• /
• v.40 no.1 s.174
• /
• pp.11-24
• /
• 2007

There exist various difficulties in runoff analysis due to many ungauged basins in Korea and the runoff phenomena is also more and more complicated by the change of geologic characteristics due to the urbanization. So, we use GIS technique which is widely used in hydrologic field and cell runoff concept for the fast and effective runoff simulation. This study uses the observations of 6 stage stations in Wi-Cheon watershed and simulates the watershed parameters by using WMS model. We construct DEM by the grids which are consisted based on the criteria of minimum area according to land use. The cell runoff is estimated by an average weighted method using mean annual streamflow and mean maximum daily streamflow obtained from six stage stations. The runoff ratio at arbitrary site is estimated by conducting the direction analysis of streamflow and by removing sinkhole. We compare the simulated and observed runoffs and know that the simulated runoff shows the valid results. So, we could use the geographical information and cell runoff concept for more fast and effective runoff simulation studies.

• Journal of KIISE:Software and Applications
• /
• v.29 no.8
• /
• pp.521-528
• /
• 2002

We propose a new approach to the feature selection for the classification of handwritten characters using two-dimensional(2D) wavelet packet bases. To extract key features of an image data, for the dimension reduction Principal Component Analysis(PCA) has been most frequently used. However PCA relies on the eigenvalue system, it is not only sensitive to outliers and perturbations, but has a tendency to select only global features. Since the important features for the image data are often characterized by local information such as edges and spikes, PCA does not provide good solutions to such problems. Also solving an eigenvalue system usually requires high cost in its computation. In this paper, the original data is transformed with 2D wavelet packet bases and the best discriminant basis is searched, from which relevant features are selected. In contrast to PCA solutions, the fast selection of detailed features as well as global features is possible by virtue of the good properties of wavelets. Experiment results on the recognition rates of PCA and our approach are compared to show the performance of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.3
• /
• pp.66-77
• /
• 2002

This paper deals with an implementation of the navigation parameter extraction technique using the TMS320C80 multimedia video processor (MVP). Especially, this Paper focuses on the relative position estimation algorithm which plays an important role in real-time operation of the overall system. Based on the relative position estimation algorithm using the images obtained at two locations, we develop a fast algorithm that can reduce large amount of computation time and fit into fixed-point processors. Then, the algorithm is reconfigured for parallel processing using the 4 parallel processors in the MVP. As a result, we shall demonstrate that the navigation parameter extraction system employing the MVP can operate at full-frame rate, satisfying real-time requirement of the overall system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.105-114
• /
• 2000

In this paper, we concentrate on an efficient method to decrease a lot of pixel data to be processed with an Image transform based automatic lipreading It is reported that the image transform based approach, which obtains a compressed representation of the speaker's mouth, results in superior lipreading performance than the lip contour based approach But this approach produces so many feature parameters of the lip that has much data and requires much computation time for recognition To reduce the data to be computed, we propose a simple method folding at the vertical center of the lip-image based on the symmetry of the lip In addition, the principal component analysis(PCA) is used for fast algorithm and HMM word recognition results are reported The proposed method reduces the number of the feature parameters at $22{\sim}47%$ and improves hidden Markov model(HMM)word recognition rates at $2{\sim}3%$, using the folded lip-image compared with the normal method using $16{\times}16$ lip-image.