Báo cáo hóa học: " Research Article Robust Background Subtraction with Shadow and Highlight Removal for Indoor Surveillance Jwu-Sheng Hu and Tzung-Min Su" pot

... pages doi:10.1155/2007/82931 Research Article Robust Background Subtraction with Shadow and Highlight Removal for Indoor Surveillance Jwu-Sheng Hu and Tzung-Min Su Department of Electrical and Control Engineering, ... efficiency. 3.1. Shadow and highlight removal Besides foreground and background, shadows and highlights are two important phenomen...

Ngày tải lên: 22/06/2014, 23:20

... 27]todesign robust adaptive beamformers, and in [28]todesignarobust minimum variance beamformer. In this paper, we propose a robust adaptive modulation scheme for OFDM with transmit and/ or receive ... Communications and Networking Volume 2007, Article ID 78156, 8 pages doi:10.1155/2007/78156 Research Article Robust Adaptive OFDM with Diversity for Time-Varying Channe...

Ngày tải lên: 22/06/2014, 19:20

... the first problem is to run the algorithm with three different kernel bandwidths, former bandwidth and former bandwidth ±10%, and to choose the kernel bandwidth which maximizes the appearance similarity ... moving foreground regions and store the detection result in a binary mask. A very common solution for moving foreground detection is background subtraction. In background sub-...

Ngày tải lên: 21/06/2014, 08:20

... Processing Volume 2010, Article ID 172703, 13 pages doi:10.1155/2010/172703 Research Article Robust Blind Frequency and Transition Time Estimation for Frequency Hopping Systems Kuo-Ching Fu and Yung-Fang ... are held constant. For instance, K may be fixed first and the ω 1 and ω 2 that maximize the objective function are computed; after ω 1 and ω 2 have been estimated, ω 1...

Ngày tải lên: 21/06/2014, 08:20

... Vision and Image Understand- ing, vol. 107, no. 3, pp. 139–159, 2007. [18] A. Rosenfeld and A. C. Kak, Digital Picture Processing, Academic Press, Orlando, Fla, USA, 1982. [19] I. M. Anderson and ... called normal voting for robust curvature estimation, which is similar to [10, 32]. Recently,Tong and Tang [11] propose a three-pass tensor voting algorithm with improved robustness...

Ngày tải lên: 21/06/2014, 08:20

... catego- rization performance for selected five Caltech categories (car, motorbike, stop sign, cup, and faces). In this experiment, we use 15 randomly selected images (segmented) for training and test 15 randomly ... bathroom, and drills in a workshop. Therefore, object and place (background) are strongly correlated and usually coexist, as shown in Figure 7. If the relationship be...

Ngày tải lên: 21/06/2014, 08:20

... 2. From Tables 3 and 4, it can be seen that the proposed method is not robust against the salt and pepper noises and Laplacian sharpening. Compared with Zhu’s, Xiao’s, Leung’s, and Tao’s schemes, ... transform. And the robustness tests for the proposed method and comparisons with other water- marking schemes are also described. This paper is organized as follows. In Sectio...

Ngày tải lên: 21/06/2014, 08:20

... that for 10 −1 ≤ μ ≤ 10 −6 and 32 ≤ N ≤ 1024, on each time level the number of iterations for monotone method 3.7 on the piecewise uniform mesh is independent of μ and N and equal 4, 4, and 3 for ... 10 −6 and 32 ≤ N ≤ 1024, iteration counts for monotone method 2.27 on the piecewise uniform mesh are independent of μ and N, and equals 12 and 8 for the lower and...

Ngày tải lên: 21/06/2014, 20:20

... the proposed robust design clearly outperforms the nonrobust design in [10]. Comparing the results for N t = 6and N t = 8, we find that the difference between the nonrobust design and the proposed robust ... Section 3 outperforms the nonrobust design in [10]. In Figure 2, we present the simulated SMSE performances of the proposed robust design and those of the nonrobust design prop...

Ngày tải lên: 21/06/2014, 20:20

... Processing Volume 2009, Article ID 530435, 14 pages doi:10.1155/2009/530435 Research Article Robust Distributed Noise Reduction in Hearing Aids with External Acoustic Sensor Nodes Alexander Bertrand and Marc ... optimality proof of Theorem 1 for DANSE K in [13]. 6. Performance of DANSE and R-DANSE In this section, the batch mode performance of DANSE and R-DANSE is compared...

Ngày tải lên: 21/06/2014, 20:20