Low voltage test in place of fast clock in DDSI delay test
By testing the CUT at lower supply voltages, the CUT slows down and thus slow, low-cost testers can be used to perform DDSI (defect detection within slack intervals) tests. Apart from this, because the delay fault size is known in a DDSI test, this information can be further used to diagnose the causing mechanism behind the delay faults. Experimental results are presented to investigate the potential of the method.

title: Delay Test Scan Flip-Flop: DFT for High Coverage Delay Testing
abstract: Scan based delay testing is currently mostly implemented using launch-on-capture (LOC) delay tests. Launch-on-shift (LOS) tests are generally more effective, achieving higher fault coverage with significantly fewer test vectors, but require a fast scan enable, which is not supported by most designs. The paper presents low cost solution for implementing LOS tests by adding a small amount of logic (six transistors) in each flip-flop to align the slow scan enable signal to the clock edge. The new design can support full LOS and LOC testing, achieving an average TDF coverage of 92.67% in this combined mode for the ISCAS89 benchmarks. Adding a second slow global scan enable signal also allows mixed LOC/LOS tests, which can further increase coverage up to 94.86% on average for ISCAS89 benchmarks

title: Subject-independent natural action recognition
abstract: A primitive-based dynamic Bayesian networks are proposed for subject-independent natural action recognition. Inferred by high-level knowledge, primitives are distinctive features that describe the context information and the motion information representing human action as well as pose. Dynamic Bayesian networks could fuse multi-information so that many kinds of weak information could function as strong information for inference. The experimental results show that primitive-based dynamic Bayesian networks not only increase the recognition rate but also improve the robustness.

title: Efficient Fourier-Based Approach for Detecting Orientations and Occlusions in Epipolar Plane Images for 3D Scene Modeling
abstract: This paper presents a Fourier-based approach for automatically constructing a 3D panoramic model of a natural scene from a video sequence. The video sequences could be captured by an unstabilized camera mounted on a moving platform on a common road surface. As the input of the algorithms, “seamles” panoramic view images (PVIs) and epipolar plane images (EPIs) are generated after image stabilization if the camera is unstabilized. A novel panoramic EPI analysis method is proposed that combines the advantages of both PVIs and EPIs efficiently in three important steps: locus orientation detection in the Fourier frequency domain, motion boundary localization in the spatio-temporal domain, and occlusion/resolution recovery only at motion boundaries. The Fourier energy-based approaches in literature were usually for low-level local motion analysis and are therefore not accurate for 3D reconstruction and are also computationally expensive. Our panoramic EPI analysis approach is both accurate and efficient for 3D reconstruction. Examples of layered panoramic representations for large-scale 3D scenes from real world video sequences are given.

title: Hidden Markov Model Based Events Detection in Soccer Video
abstract: This paper presents an algorithm developed based on hidden Markov model for cues fusion and event inference in soccer video. Four events, shoot, foul, offside and normal playing, are defined to be detected. The states of the events are employed to model the observations of the five cues, which are extracted from the shot sequences directly. The experimental results show the algorithm is effective and robust in inferring events from roughly extracted cues.

title: An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties
abstract: In this paper, we consider an interesting variant of the facility location problem called uncapacitated facility location problem with penalties (UFLWP for short) in which each client is either assigned to an opened facility or rejected by paying a penalty. We present a 1.8526-approximation algorithm for the UFLWP problem. Our algorithm first enhances the primal-dual method for the UFLWP problem  so that outliers can be recognized more efficiently, and then applies a local search heuristic to further reduce the cost for serving those non-rejected clients.

title: Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data
abstract: Creating a computer model from an existing part is a common problem in reverse engineering. The part might be scanned with a device like the laser range scanner, or points might be measured on its surface with a mechanical probe. Sometimes, not only the spatial location of points, but also some associated physical property can be measured. The problem of automatically reconstructing from this data a topologically consistent and geometrically accurate model of the object and of the sampled scalar field is the subject of this paper. The proposed algorithm can deal with connected, orientable manifolds of unrestricted topological type, given a sufficiently dense and uniform sampling of the object's surface. It is capable of automatically reconstructing both the model and a scalar field over its surface. It uses Delaunay triangulations, Voronoi diagrams, and α-shapes for efficiency of computation and theoretical soundness. It generates a representation of the surface and the field based on Bernstein—Bézier polynomials, with the surface modeled by implicit patches (A-patches), that are guaranteed to be smooth and single-sheeted.