Tracking by Affine Kernel Transformations Using Color and Boundary Cues

Kernel-based trackers aggregate image features within the support of a kernel (a mask) regardless of their spatial structure. These trackers spatially fit the kernel (usually in location and in scale) such that a function of the aggregate is optimized. We propose a kernel-based visual tracker that exploits the constancy of color and the presence of color edges along the target boundary. The tracker estimates the best affinity of a spatially aligned pair of kernels, one of which is color-related and the other of which is object boundary-related. In a sense, this work extends previous kernel-based trackers by incorporating the object boundary cue into the tracking process and by allowing the kernels to be affinely transformed instead of only translated and isotropically scaled. These two extensions make for more precise target localization. A more accurately localized target also facilitates safer updating of its reference color model, further enhancing the tracker's robustness. The improved tracking is demonstrated for several challenging image sequences.     

On Scene Segmentation and Histograms-Based Curve Evolution

We consider curve evolution based on comparing distributions of features, and its applications for scene segmentation. In the first part, we promote using cross-bin metrics such as the Earth Mover's Distance (EMD), instead of standard bin-wise metrics as the Bhattacharyya or Kullback-Leibler metrics. To derive flow equations for minimizing functionals involving the EMD, we employ a tractable expression for calculating EMD between one-dimensional distributions. We then apply the derived flows to various examples of single image segmentation, and to scene analysis using video data. In the latter, we consider the problem of segmenting a scene to spatial regions in which different activities occur. We use a nonparametric local representation of the regions by considering multiple one-dimensional histograms of normalized spatiotemporal derivatives. We then obtain semisupervised segmentation of regions using the flows derived in the first part of the paper. Our results are demonstrated on challenging surveillance scenes, and compare favorably with state-of-the-art results using parametric representations by dynamic systems or mixtures of them.     

Robust real-time unusual event detection using multiple fixed-location monitors

We present a novel algorithm for detection of certain types of unusual events. The algorithm is based on multiple local monitors which collect low-level statistics. Each local monitor produces an alert if its current measurement is unusual, and these alerts are integrated to a final decision regarding the existence of an unusual event. Our algorithm satisfies a set of requirements that are critical for successful deployment of any large-scale surveillance system. In particular it requires a minimal setup (taking only a few minutes) and is fully automatic afterwards. Since it is not based on objects' tracks, it is robust and works well in crowded scenes where tracking-based algorithms are likely to fail. The algorithm is effective as soon as sufficient low-level observations representing the routine activity have been collected, which usually happens after a few minutes. Our algorithm runs in realtime. It was tested on a variety of real-life crowded scenes. A ground-truth was extracted for these scenes, with respect to which detection and false-alarm rates are reported.     

Visual positioning of previously defined ROIs on microscopic slides.

In microscopy, regions of interest are usually much smaller than the whole slide area. Various microscopy related medical applications, such as telepathology and computer aided diagnosis, are liable to benefit greatly from microscope auto positioning on previously defined regions of interest. In this paper, we present a method for image-based auto positioning on a microscope slide. The method is based on localization of a microscopic query image using a previously acquired slide map. It uses geometric hashing, a highly efficient technique drawn from the object recognition field. The algorithm exhibits high tolerance to possible variations in visual appearance due to slide rotations, scaling and illumination changes. Experimental results indicate high reliability of the algorithm.     

Quantitative evaluation of product disassembly for recycling

This paper presents a method for evaluating the ease-of-disassembly of products. Its primary use is in designing products for recycling, but it also facilitates consideration of servicing and maintenance, and making environmentally-related decisions. The method is developed and discussed in the context of relatively small products that can be disassembled by a seated person using hand-held tools. The evaluation procedure is centered around a spreadsheet-like chart and uses a catalog of task difficulty scores. The scores were derived from work-measurement analyses of standard disassembly tasks, and provide a means of identifying weaknesses in the design and comparing alternatives quantitatively. The structure of the evaluation chart and the derivation of difficulty scores are explained, followed by a demonstration of analyzing a computer central processing unit. The limitations of the method and future extensions are outlined.     

Wavelet-based dynamic and privacy-preserving similitude data models for edge computing

Wireless Networks - The privacy-preserving data release is an increasingly important problem in today’s computing. As the end devices collect more and more data, reducing the amount of...