A novel part-based approach to mean-shift algorithm for visual tracking

Visual tracking is one of the most important problems considered in computer vision. To improve the performance of the visual tracking, a part-based approach will be a good solution. In this paper, a novel method of visual tracking algorithm named part-based mean-shift (PBMS) algorithm is presented. In the proposed PBMS, unlike the standard mean-shift (MS), the target object is divided into multiple parts and the target is tracked by tracking each individual part and combining the results. For the part-based visual tracking, the objective function in the MS is modified such that the target object is represented as a combination of the parts and iterative optimization solution is presented. Further, the proposed PBMS provides a systematic and analytic way to determine the scale of the bounding box for the target from the perspective of the objective function optimization. Simulation is conducted with several benchmark problems and the result shows that the proposed PBMS outperforms the standard MS.

     

Optics clustered to output unique solutions: a multi-laser facility for combined single molecule and ensemble microscopy

Optics clustered to output unique solutions (OCTOPUS) is a microscopy platform that combines single molecule and ensemble imaging methodologies. A novel aspect of OCTOPUS is its laser excitation system, which consists of a central core of interlocked continuous wave and pulsed laser sources, launched into optical fibres and linked via laser combiners. Fibres are plugged into wall-mounted patch panels that reach microscopy end-stations in adjacent rooms. This allows multiple tailor-made combinations of laser colours and time characteristics to be shared by different end-stations minimising the need for laser duplications. This setup brings significant benefits in terms of cost effectiveness, ease of operation, and user safety. The modular nature of OCTOPUS also facilitates the addition of new techniques as required, allowing the use of existing lasers in new microscopes while retaining the ability to run the established parts of the facility. To date, techniques interlinked are multi-photon/multicolour confocal fluorescence lifetime imaging for several modalities of fluorescence resonance energy transfer (FRET) and time-resolved anisotropy, total internal reflection fluorescence, single molecule imaging of single pair FRET, single molecule fluorescence polarisation, particle tracking, and optical tweezers. Here, we use a well-studied system, the epidermal growth factor receptor network, to illustrate how OCTOPUS can aid in the investigation of complex biological phenomena.     

Can 3DTV Create Immersive Environments?

This article has been retracted.     

Shape from defocus via diffusion

Defocus can be modeled as a diffusion process and represented mathematically using the heat equation, where image blur corresponds to the diffusion of heat. This analogy can be extended to non-planar scenes by allowing a space-varying diffusion coefficient. The inverse problem of reconstructing 3-D structure from blurred images corresponds to an "inverse diffusion" that is notoriously ill-posed. We show how to bypass this problem by using the notion of relative blur. Given two images, within each neighborhood, the amount of diffusion necessary to transform the sharper image into the blurrier one depends on the depth of the scene. This can be used to devise a global algorithm to estimate the depth profile of the scene without recovering the deblurred image, using only forward diffusion.     

Asynchronous action-reward learning for nonstationary serial supply chain inventory control

Action-reward learning is a reinforcement learning method. In this machine learning approach, an agent interacts with non-deterministic control domain. The agent selects actions at decision epochs and the control domain gives rise to rewards with which the performance measures of the actions are updated. The objective of the agent is to select the future best actions based on the updated performance measures. In this paper, we develop an asynchronous action-reward learning model which updates the performance measures of actions faster than conventional action-reward learning. This learning model is suitable to apply to nonstationary control domain where the rewards for actions vary over time. Based on the asynchronous action-reward learning, two situation reactive inventory control models (centralized and decentralized models) are proposed for a two-stage serial supply chain with nonstationary customer demand. A simulation based experiment was performed to evaluate the performance of the proposed two models. Chang Ouk Kim received his Ph.D. in industrial engineering from Purdue University in 1996 and his B.S. and M.S. degrees from Korea University, Republic of Korea in 1988 and 1990, respectively. From 1998--2001, he was an assistant professor in the Department of Industrial Systems Engineering at Myongji University, Republic of Korea. In 2002, he joined the Department of Information and Industrial Engineering at Yonsei University, Republic of Korea and is now an associate professor. He has published more than 30 articles at international journals. He is currently working on applications of artificial intelligence and adaptive control theory in supply chain management, RFID based logistics information system design, and advanced process control in semiconductor manufacturing. Ick-Hyun Kwon is a postdoctoral researcher in the Department of Civil and Environmental Engineering at University of Illinois at Urbana-Champaign. Previous to this position, Dr. Kwon was a research assistant professor in the Research Institute for Information and Communication Technology at Korea University, Seoul, Republic of Korea. He received his B.S., M.S., and Ph.D. degrees in Industrial Engineering from Korea University, in 1998, 2000, and 2006, respectively. His current research interests are supply chain management, inventory control, production planning and scheduling. Jun-Geol Baek is an assistant professor in the Department of Business Administration at Kwangwoon University, Seoul, Korea. He received his B.S., M.S., and Ph.D. degrees in Industrial Engineering from Korea University, Seoul, Korea, in 1993, 1995, and 2001 respectively. From March 2002 to February 2007, he was an assistant professor in the Department of Industrial Systems Engineering at Induk Institute of Technology, Seoul, Korea. His research interests include machine learning, data mining, intelligent machine diagnosis, and ubiquitous logistics information systems. An erratum to this article can be found at     

Performance of the MAP/G/1 Queue Under the Dyadic Control of Workload and Server Idleness

This paper studies the steady-state queue length process of the MAP/G/1 queue under the dyadic control of the D-policy and multiple server vacations. We derive the probability generating function of the queue length and the mean queue length. We then present computational experiences and compare the MAP queue with the Poisson queue.

Mosaic organization of DNA nucleotides

Long-range power-law correlations have been reported recently for DNA sequences containing noncoding regions. We address the question of whether such correlations may be a trivial consequence of the known mosaic structure ("patchiness") of DNA. We analyze two classes of controls consisting of patchy nucleotide sequences generated by different algorithms--one without and one with long-range power-law correlations. Although both types of sequences are highly heterogenous, they are quantitatively distinguishable by an alternative fluctuation analysis method that differentiates local patchiness from long-range correlations. Application of this analysis to selected DNA sequences demonstrates that patchiness is not sufficient to account for long-range correlation properties.     

Long-range correlation properties of coding and noncoding DNA sequences: GenBank analysis

An open question in computational molecular biology is whether long-range correlations are present in both coding and noncoding DNA or only in the latter. To answer this question, we consider all 33301 coding and all 29453 noncoding eukaryotic sequences--each of length larger than 512 base pairs (bp)--in the present release of the GenBank to dtermine whether there is any statistically significant distinction in their long-range correlation properties. Standard fast Fourier transform (FFT) analysis indicates that coding sequences have practically no correlations in the range from 10 bp to 100 bp (spectral exponent beta=0.00 +/- 0.04, where the uncertainty is two standard deviations). In contrast, for noncoding sequences, the average value of the spectral exponent beta is positive (0.16 +/- 0.05) which unambiguously shows the presence of long-range correlations. We also separately analyze the 874 coding and the 1157 noncoding sequences that have more than 4096 bp and find a larger region of power-law behavior. We calculate the probability that these two data sets (coding and noncoding) were drawn from the same distribution and we find that it is less than 10(-10). We obtain independent confirmation of these findings using the method of detrended fluctuation analysis (DFA), which is designed to treat sequences with statistical heterogeneity, such as DNA's known mosaic structure ("patchiness") arising from the nonstationarity of nucleotide concentration. The near-perfect agreement between the two independent analysis methods, FFT and DFA, increases the confidence in the reliability of our conclusion.