Improved foreground detection via block-based classifier cascade with probabilistic decision integration

Background subtraction is a fundamental low-level processing task in numerous computer vision applications. The vast majority of algorithms process images on a pixel-by-pixel basis, where an independent decision is made for each pixel. A general limitation of such processing is that rich contextual information is not taken into account. We propose a block-based method capable of dealing with noise, illumination variations, and dynamic backgrounds, while still obtaining smooth contours of foreground objects. Specifically, image sequences are analyzed on an overlapping block-by-block basis. A low-dimensional texture descriptor obtained from each block is passed through an adaptive classifier cascade, where each stage handles a distinct problem. A probabilistic foreground mask generation approach then exploits block overlaps to integrate interim block-level decisions into final pixel-level foreground segmentation. Unlike many pixel-based methods, ad-hoc postprocessing of foreground masks is not required. Experiments on the difficult Wallflower and I2R datasets show that the proposed approach obtains on average better results (both qualitatively and quantitatively) than several prominent methods. We furthermore propose the use of tracking performance as an unbiased approach for assessing the practical usefulness of foreground segmentation methods, and show that the proposed approach leads to considerable improvements in tracking accuracy on the CAVIAR dataset.

Synthesis of discrete allyl-functional polyethylene glycol for efficient hydrophilization of dihydr (polydimethylsiloxane)

Amphiphilic poly(ethylene glycol)-block-pol (dimethylsiloxane)-block-poly(ethylene glycol)(PEG-block-PDMS block-PEG) triblock copolymers have been successfully prepared via hydrosilylation using discrete and polydisperse PEG of various chain lengths. Facile synthesis of discrete PEG (dPEG) is achieved via systematic tosylation and etherification of lower glycols. Amphiphilicity of the dPEG block-PDMS-block-dPEG triblock copolymer is illustrated by dynamic light scattering (DLS) and measurement of the critical micelle concentration (CMC).

Counterfeiting attacks on block-wise dependent fragile watermarking schemes

In this paper, we present three counterfeiting attacks on the block-wise dependent fragile watermarking schemes. We consider vulnerabilities such as the exploitation of a weak correlation among block-wise dependent watermarks to modify valid watermarked %(medical or other digital) images, where they could still be verified as authentic, though they are actually not. Experimental results successfully demonstrate the practicability and consequences of the proposed attacks for some relevant schemes. The development of the proposed attack models can be used as a means to systematically examine the security levels of similar watermarking schemes.

Unique X-linked familial FSGS with co-segregating heart block disorder is associated with a mutation in the NXF5 gene

Focal segmental glomerulosclerosis (FSGS) is the consequence of a disease process that attacks the kidney's filtering system, causing serious scarring. More than half of FSGS patients develop chronic kidney failure within 10 years, ultimately requiring dialysis or renal transplantation. There are currently several genes known to cause the hereditary forms of FSGS (ACTN4, TRPC6, CD2AP, INF2, MYO1E and NPHS2). This study involves a large, unique, multigenerational Australian pedigree in which FSGS co-segregates with progressive heart block with apparent X-linked recessive inheritance. Through a classical combined approach of linkage and haplotype analysis, we identified a 21.19 cM interval implicated on the X chromosome. We then used a whole exome sequencing approach to identify two mutated genes, NXF5 and ALG13, which are located within this linkage interval. The two mutations NXF5-R113W and ALG13-T141L segregated perfectly with the disease phenotype in the pedigree and were not found in a large healthy control cohort. Analysis using bioinformatics tools predicted the R113W mutation in the NXF5 gene to be deleterious and cellular studies support a role in the stability and localization of the protein suggesting a causative role of this mutation in these co-morbid disorders. Further studies are now required to determine the functional consequence of these novel mutations to development of FSGS and heart block in this pedigree and to determine whether these mutations have implications for more common forms of these diseases in the general population.

Observation of exsolution textures within Ba-Cu-O-rich solidified melts of Y-Ba-Cu-O materials and their relationship to Y123 nucleation and texturing

Layers (about 60-100 μm thick) of almost pure BaCuO2 (BC1), as determined using X-ray diffractometry (XRD) and scanning electron microscopy (SEM), coat the surfaces of YBa2Cu3O7-x (Y123) samples partial melt processed using a single-zone vertical furnace. The actual Cu/Ba ratio of the BC1 phase is 1.2-1.3 as determined using energy dispersive X-ray spectrometry (EDS). The nominally BC1 phase displays an exsolution of BC1.5 or BC2 in the form of thin plates (about 50-100 nm thick) along {100}-type cleavage planes or facets. The exsolved phase also fills cracks within the BC1 layer that require it to be in a molten state at some stage of processing. The samples were influenced by Pt contamination from the supporting wire, which may have stabilised the BC1.5 phase. Many of the Y123 grains have the same morphology as the exsolution domains, and run nearly parallel to the thin plates of the exsolved phases, strongly indicating that Y123 nucleation took place at the interface between the BC1 and the BC1.5 or BC2 exsolved phases. The network of nearly parallel exsolved 'channels' provides a matrix and a mechanism through which a high degree of local texture can be initiated in the material.

Effects of PtO2 and CeO2 additives on the microstructures of the quenched melts of Y-Ba-Cu-O materials

The microstructures of the quenched melts of samples of Y123 and Y123+15-20 mol% Y211 with PtO2 and CeO2 additives have been examined with optical microscopy, Scanning Electron Microscopy (SEM), Energy Dispersive X-ray Spectrometry (EDS) and X-ray Diffractometry (XRD). Significantly higher temperatures are required for the formation of dendritic or lamellar eutectic patterns throughout the samples with PtO2 and CeO2 additives as compared to samples without additives. The BaCuO2 (BCl) phase appears first in solid form and, instead of rapidly melting, is slowly dissolving or decomposing in the oxygen depleted melt. PtO2 and CeO2 additives slow down or shift to higher temperatures the dissolution or decomposition process of BCl. A larger fraction of BCl in solid form explains why samples with additives have higher viscosities and hence lower diffusivities than samples without additives. There is also a reduction in the Y solubility to about half the value in samples without additives. The mechanism that limits the Ostwald ripening of the Y211 particles is correlated to the morphology of the quenched partial melt. It is diffusion controlled for a finely mixed morphology and interface-controlled when the melt quenches into dendritic or lamellar eutectic patterns. The change in the morphology of the Y211 particles from blocky to acicular is related to an equivalent undercooling of the Y-Ba-Cu-O partial melt, particularly through the crystallization of BCl.

Formalising human recognition : a fundamental building block for security proofs

A fundamental part of many authentication protocols which authenticate a party to a human involves the human recognizing or otherwise processing a message received from the party. Examples include typical implementations of Verified by Visa in which a message, previously stored by the human at a bank, is sent by the bank to the human to authenticate the bank to the human; or the expectation that humans will recognize or verify an extended validation certificate in a HTTPS context. This paper presents general definitions and building blocks for the modelling and analysis of human recognition in authentication protocols, allowing the creation of proofs for protocols which include humans. We cover both generalized trawling and human-specific targeted attacks. As examples of the range of uses of our construction, we use the model presented in this paper to prove the security of a mutual authentication login protocol and a human-assisted device pairing protocol.

Block models for improved earthwork allocation planning in linear infrastructure construction

Earthwork planning has been considered in this article and a generic block partitioning and modelling approach has been devised to provide strategic plans of various levels of detail. Conceptually this approach is more accurate and comprehensive than others, for instance those that are section based. In response to environmental concerns the metric for decision making was fuel consumption and emissions. Haulage distance and gradient are also included as they are important components of these metrics. Advantageously the fuel consumption metric is generic and captures the physical difficulties of travelling over inclines of different gradients, that is consistent across all hauling vehicles. For validation, the proposed models and techniques have been applied to a real world road project. The numerical investigations have demonstrated that the models can be solved with relatively little CPU time. The proposed block models also result in solutions of superior quality, i.e. they have reduced fuel consumption and cost. Furthermore the plans differ considerably from those based solely upon a distance based metric thus demonstrating a need for industry to reflect upon their current practices.

Known and chosen key differential distinguishers for block ciphers

In this paper we investigate the differential properties of block ciphers in hash function modes of operation. First we show the impact of differential trails for block ciphers on collision attacks for various hash function constructions based on block ciphers. Further, we prove the lower bound for finding a pair that follows some truncated differential in case of a random permutation. Then we present open-key differential distinguishers for some well known round-reduced block ciphers.

Cryptanalysis of block ciphers with overdefined systems of equations

Several recently proposed ciphers, for example Rijndael and Serpent, are built with layers of small S-boxes interconnected by linear key-dependent layers. Their security relies on the fact, that the classical methods of cryptanalysis (e.g. linear or differential attacks) are based on probabilistic characteristics, which makes their security grow exponentially with the number of rounds N r r. In this paper we study the security of such ciphers under an additional hypothesis: the S-box can be described by an overdefined system of algebraic equations (true with probability 1). We show that this is true for both Serpent (due to a small size of S-boxes) and Rijndael (due to unexpected algebraic properties). We study general methods known for solving overdefined systems of equations, such as XL from Eurocrypt’00, and show their inefficiency. Then we introduce a new method called XSL that uses the sparsity of the equations and their specific structure. The XSL attack uses only relations true with probability 1, and thus the security does not have to grow exponentially in the number of rounds. XSL has a parameter P, and from our estimations is seems that P should be a constant or grow very slowly with the number of rounds. The XSL attack would then be polynomial (or subexponential) in N r> , with a huge constant that is double-exponential in the size of the S-box. The exact complexity of such attacks is not known due to the redundant equations. Though the presented version of the XSL attack always gives always more than the exhaustive search for Rijndael, it seems to (marginally) break 256-bit Serpent. We suggest a new criterion for design of S-boxes in block ciphers: they should not be describable by a system of polynomial equations that is too small or too overdefined.