Geometric Distortion Insensitive Image Watermarking in Affine Covariant Regions

Feature-based image watermarking schemes, which aim to survive various geometric distortions, have attracted great attention in recent years. Existing schemes have shown robustness against rotation, scaling, and translation, but few are resistant to cropping, nonisotropic scaling, random bending attacks (RBAs), and affine transformations. Seo and Yoo present a geometrically invariant image watermarking based on affine covariant regions (ACRs) that provide a certain degree of robustness. To further enhance the robustness, we propose a new image watermarking scheme on the basis of Seo's work, which is insensitive to geometric distortions as well as common image processing operations. Our scheme is mainly composed of three components: 1) feature selection procedure based on graph theoretical clustering algorithm is applied to obtain a set of stable and nonoverlapped ACRs; 2) for each chosen ACR, local normalization, and orientation alignment are performed to generate a geometrically invariant region, which can obviously improve the robustness of the proposed watermarking scheme; and 3) in order to prevent the degradation in image quality caused by the normalization and inverse normalization, indirect inverse normalization is adopted to achieve a good compromise between the imperceptibility and robustness. Experiments are carried out on an image set of 100 images collected from Internet, and the preliminary results demonstrate that the developed method improves the performance over some representative image watermarking approaches in terms of robustness.

Non-affine structural evolution of soft colloidal crystalline latex films under stretching as observed via synchrotron X-ray scattering

A polymer dispersion consisting of soft latex spheres with a diameter of 135 nm was used to produce a crystalline film with face-centered cubic (fcc) packing of the spheres. Different from conventional small-molecule and hardsphere colloidal crystals, the crystalline latex film in the present case is soft (i.e., easily deformable). The structural evolution of this soft colloidal latex film under stretching was investigated by in-situ synchrotron ultra-small-angle X-ray scattering. The film exhibits polycrystalline scattering behavior corresponding to fcc structure. Stretching results not only in a large deformation of the crystallographic structure but also in considerable nonaffine deformation at high draw ratios. The unexpected nonaffine deformation was attributed to slippage between rows of particles and crystalline grain boundaries. The crystalline structure remains intact even at high deformation, suggesting that directional anisotropic colloidal crystallites can be easily produced.

Impedance study of (PEO)(10)LiClO4-Al2O3 composite polymer electrolyte with blocking electrodes

A composite solid polymer electrolyte (SPE) of (PEO)(10)LiClO4-Al2O3 was prepared and Pt and stainless steel(SS) blocking electrodes were used for an impedance study. It was found that the semicircle in the high frequency range and the straight line in the low frequency range depend upon different blocking electrodes and polarization potentials applied in the experiments. In the equivalent circuit. two constant phase elements (CPE) have been used instead of the pure geometrical and double layer capacitances. respectively. A theoretical line calculated from their estimated values has a good correlation with the experiment data. Moreover. the equivalent circuit also can be used to explain the impedance properties of Pt and stainless steel (SS) blocking electrodes both in the high and the low frequency ranges. (C) 2001 Elsevier Science Ltd. All rights reserved.

Breaking seasonal limitation: year-round sporogenesis in the brown alga Laminaria saccharina by blocking the transport of putative sporulation inhibitors

Year-round induction of sporogenesis of Laminaria saccharina was performed by mechanically blocking the transport of the putative sporulation inhibitors produced by the blade meristem and culturing the plants in constant short days. Sporogenesis was successfully induced by removal of the blade meristem, either by cultivating distal blade fragments or by performing a transverse cut in the frond. The earliest sorus formation after artificial induction was 10 days. The age of the sporophytes used for induction was 6-11 months or 2 years in tank-grown or field-collected sporophytes, respectively. Zoospores were successfully released in all cases. Thus, by year-round artificial induction of sporogenesis, (1) sporeling production of L. saccharina and thereafter sporophyte cultivation could be achieved without seasonal limitation, and (2) the life cycle of L. saccharina (from spore to spore) could be completed within 8 months under controlled conditions. (C) 2004 Elsevier B.V. All rights reserved.

Affine Matching with Bounded Sensor Error: A Study of Geometric Hashing and Alignment

Affine transformations are often used in recognition systems, to approximate the effects of perspective projection. The underlying mathematics is for exact feature data, with no positional uncertainty. In practice, heuristics are added to handle uncertainty. We provide a precise analysis of affine point matching, obtaining an expression for the range of affine-invariant values consistent with bounded uncertainty. This analysis reveals that the range of affine-invariant values depends on the actual $x$-$y$-positions of the features, i.e. with uncertainty, affine representations are not invariant with respect to the Cartesian coordinate system. We analyze the effect of this on geometric hashing and alignment recognition methods.

Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths

The blocking probability of a network is a common measure of its performance. There exist means of quickly calculating the blocking probabilities of Banyan networks; however, because Banyan networks have no redundant paths, they are not inherently fault-tolerant, and so their use in large-scale multiprocessors is problematic. Unfortunately, the addition of multiple paths between message sources and sinks in a network complicates the calculation of blocking probabilities. A methodology for exact calculation of blocking probabilities for small networks with redundant paths is presented here, with some discussion of its potential use in approximating blocking probabilities for large networks with redundant paths.

Relative Affine Structure: Canonical Model for 3D from 2D Geometry and Applications

We propose an affine framework for perspective views, captured by a single extremely simple equation based on a viewer-centered invariant we call "relative affine structure". Via a number of corollaries of our main results we show that our framework unifies previous work --- including Euclidean, projective and affine --- in a natural and simple way, and introduces new, extremely simple, algorithms for the tasks of reconstruction from multiple views, recognition by alignment, and certain image coding applications.

Automatically Recovering Geometry and Texture from Large Sets of Calibrated Images

Three-dimensional models which contain both geometry and texture have numerous applications such as urban planning, physical simulation, and virtual environments. A major focus of computer vision (and recently graphics) research is the automatic recovery of three-dimensional models from two-dimensional images. After many years of research this goal is yet to be achieved. Most practical modeling systems require substantial human input and unlike automatic systems are not scalable. This thesis presents a novel method for automatically recovering dense surface patches using large sets (1000's) of calibrated images taken from arbitrary positions within the scene. Physical instruments, such as Global Positioning System (GPS), inertial sensors, and inclinometers, are used to estimate the position and orientation of each image. Essentially, the problem is to find corresponding points in each of the images. Once a correspondence has been established, calculating its three-dimensional position is simply a matter of geometry. Long baseline images improve the accuracy. Short baseline images and the large number of images greatly simplifies the correspondence problem. The initial stage of the algorithm is completely local and scales linearly with the number of images. Subsequent stages are global in nature, exploit geometric constraints, and scale quadratically with the complexity of the underlying scene. We describe techniques for: 1) detecting and localizing surface patches; 2) refining camera calibration estimates and rejecting false positive surfels; and 3) grouping surface patches into surfaces and growing the surface along a two-dimensional manifold. We also discuss a method for producing high quality, textured three-dimensional models from these surfaces. Some of the most important characteristics of this approach are that it: 1) uses and refines noisy calibration estimates; 2) compensates for large variations in illumination; 3) tolerates significant soft occlusion (e.g. tree branches); and 4) associates, at a fundamental level, an estimated normal (i.e. no frontal-planar assumption) and texture with each surface patch.

Fuzzy-Rough Sets Assisted Attribute Selection

R. Jensen and Q. Shen. Fuzzy-Rough Sets Assisted Attribute Selection. IEEE Transactions on Fuzzy Systems, vol. 15, no. 1, pp. 73-89, 2007.

Feature Selection based on Rough Sets and Particle Swarm Optimization

X. Wang, J. Yang, X. Teng, W. Xia, and R. Jensen. Feature Selection based on Rough Sets and Particle Swarm Optimization. Pattern Recognition Letters, vol. 28, no. 4, pp. 459-471, 2007.

Rough sets, their extensions and applications

Q. Shen and R. Jensen, 'Rough sets, their extensions and applications,' International Journal of Automation and Computing (IJAC), vol. 4, no. 3, pp. 217-218, 2007.