Note: An object detection method for active camera

To solve the problems caused by a changing background during object detection in active camera, this paper proposes a new method based on SURF (speeded up robust features) and data clustering. The SURF feature points of each image are extracted, and each cluster center is calculated by processing the data clustering of k adjacent frames. Templates for each class are obtained by calculating the histograms within the regions around the center points of the clustering classes. The window of the moving object can be located by finding the region that satisfies the histogram matching result between adjacent frames. Experimental results demonstrate that the proposed method can improve the effectiveness of object detection.Yong Chen, Ronghua Zhang, Lei Shang, and Eric H

Evidence for Factorization in Three-body Bˉ→D(∗)K−K0\bar B\to D^{(*)} K^- K^0 Decays

Motivated by experimental results on $\bar B\to D^{(*)}K^-K^{0}$, we use a factorization approach to study these decays. Two mechanisms concerning kaon pair production arise: current-produced (from vacuum) and transition (from the $B$ meson). The kaon pair in the $\bar B {}^0\to D^{(*)+}K^-K^0$ decays can be produced only by the vector current (current-produced), whose matrix element can be extracted from $e^+e^-\to K\bar K$ processes via isospin relations. The decay rates obtained this way are in good agreement with experiment. The $B^-\to D^{(*)0}K^-K^0$ decays involve both current-produced and transition processes. By using QCD counting rules and the measured $B^-\to D^{(*)0} K^- K^0$ decay rates, the measured decay spectra can be understood.Comment: 3 pages, 6 figures. Talk presented at EPS2003 Conference, Aachen, Germany, July 200

A graph theoretical approach to network encoding complexity

For an acyclic directed network with multiple pairs of sources and sinks and a group of edge-disjoint paths connecting each pair of source and sink, it is known that the number of mergings among different groups of edge-disjoint paths is closely related to network encoding complexity. Using this connection, we derive exact values of and bounds on two functions relevant to encoding complexity for such networks. © 2012 IEICE Institute of Electronics Informati.published_or_final_versio