Construction of 2-D directional filter bank by cascading checkerboard-shaped filter pair and CMFB

In this paper, we propose a new approach to construct a 2-dimensional (2-D) directional filter bank (DFB) by cascading a 2-D nonseparable checkerboard-shaped filter pair and 2-D separable cosine modulated filter bank (CMFB). Similar to diagonal subbands in 2-D separable wavelets, most of the subbands in 2-D separable CMFBs, tensor products of two 1-D CMFBs, are poor in directional selectivity due to the fact that the frequency supports of most of the subband filters are concentrated along two different directions. To improve the directional selectivity, we propose a new DFB to realize the subband decomposition. First, a checkerboard-shaped filter pair is used to decompose an input image into two images containing different directional information of the original image. Next, a 2-D separable CMFB is applied to each of the two images for directional decomposition. The new DFB is easy in design and has merits: low redundancy ratio and fine directional-frequency tiling. As its application, the BLS-GSM algorithm for image denoising is extended to use the new DFBs. Experimental results show that the proposed DFB achieves better denoising performance than the methods using other DFBs for images of abundant textures. (C) 2008 Elsevier B.V. All rights reserved.

2-D and 3-D processing and interpretation of multi-fold ground penetrating radar data:a case history from an archaeological site

A 2.5-D and 3-D multi-fold GPR survey was carried out in the Archaeological Park of Aquileia (northern Italy). The primary objective of the study was the identification of targets of potential archaeological interest in an area designated by local archaeological authorities. The second geophysical objective was to test 2-D and 3-D multi-fold methods and to study localised targets of unknown shape and dimensions in hostile soil conditions. Several portions of the acquisition grid were processed in common offset (CO), common shot (CSG) and common mid point (CMP) geometry. An 8×8 m area was studied with orthogonal CMPs thus achieving a 3-D subsurface coverage with azimuthal range limited to two normal components. Coherent noise components were identified in the pre-stack domain and removed by means of FK filtering of CMP records. Stack velocities were obtained from conventional velocity analysis and azimuthal velocity analysis of 3-D pre-stack gathers. Two major discontinuities were identified in the area of study. The deeper one most probably coincides with the paleosol at the base of the layer associated with activities of man in the area in the last 2500 years. This interpretation is in agreement with the results obtained from nearby cores and excavations. The shallow discontinuity is observed in a part of the investigated area and it shows local interruptions with a linear distribution on the grid. Such interruptions may correspond to buried targets of archaeological interest. The prominent enhancement of the subsurface images obtained by means of multi-fold techniques, compared with the relatively poor quality of the conventional single-fold georadar sections, indicates that multi-fold methods are well suited for the application to high resolution studies in archaeology.

Syntheses and Crystal Structures of Fused Thiophenes: [7]Helicene and Double Helicene, a D-2-Symmetric Dimer of 3,3 '-Bis(dithieno[2,3-b:3 ',2 '-d]thiophene)

The efficient synthesis of (TMS)(2)-[7]helicene (rac-3) and double helicene, a D-2-symmetric dimer of 3,3'-bis(dithieno-[2,3-b:3',2'-d]thiophene) (rac-4) was developed. The crystal structures of 3 and 4 show both strong intermolecular pi-pi interactions and S center dot center dot center dot S interactions. UV/vis spectra reveal that both 3 and 4 show significant pi-electron delocalization.

Efficient synthesis of trimethylsilyl-substituted dithieno[2,3-b:3',2'-d]thiophene,tetra[2,3-thienylene] and hexa[2,3-thienylene] from substituted [3,3']Bithiophenyl

Efficient synthetic procedures for the preparation of beta-trithiophenes (dithieno[2,3-b:3',2'-d]thiophene) and two macrocyclic compounds, tetra[2,3-thienylene] and hexa[2,3-thienylene] bearing trimethylsilyl (TMS) groups from 2,2'-dibromo-5,5'-bistrimethylsilanyl[3,3']bithiophenyl are reported. The UV-Vis spectra property and crystal structures of these macrocyclic oligothiophenes are described.

Applications of improved 2-D numerical wave tanks in wave breaking

Song and Banner (2002, henceforth referred to as SB02) used a numerical wave tank (developed by Drimer and Agnon, and further refined by Segre, henceforth referred to as DAS) to study the wave breaking in the deep water, and proposed a dimensionless breaking threshold that based on the behaviour of the wave energy modulation and focusing during the evolution of the wave group. In this paper, two modified DAS models are used to further test the SB02's results, the first one (referred to MDAS1) corrected many integral calculation errors appeared in the DAS code, and the second one (referred to MDAS2) replaced the linear boundary element approximation of DAS into the cubic element on the free surface. Researches show that the results of MDAS1 are the same with those of DAS for the simulations of deep water wave breaking, but, the different values of the wavemaker amplitude, the breaking time and the maximum local average energy growth rate delta(max) for the marginal breaking cases are founded by MDAS2 and MDAS1. However, MDAS2 still satisfies the SB02' s breaking threshold. Furthermore, MDAS1 is utilized to study the marginal breaking case in the intermediate water depth when wave passes over a submerged slope, where the slope is given by 1 : 500, 1 : 300, 1 : 150 or 1 : 100. It is found that the maximum local energy density U increases significantly if the slope becomes steeper, and the delta(max) decreases weakly and increases intensively for the marginal recurrence case and marginal breaking case respectively. SB02's breaking threshold is still valid for the wave passing over a submerged slope gentler than 1 : 100 in the intermediate water depth.

Recognizing 3-D Objects Using 2-D Images

We discuss a strategy for visual recognition by forming groups of salient image features, and then using these groups to index into a data base to find all of the matching groups of model features. We discuss the most space efficient possible method of representing 3-D models for indexing from 2-D data, and show how to account for sensing error when indexing. We also present a convex grouping method that is robust and efficient, both theoretically and in practice. Finally, we combine these modules into a complete recognition system, and test its performance on many real images.

Robust 2-D Model-Based Object Recognition

Techniques, suitable for parallel implementation, for robust 2D model-based object recognition in the presence of sensor error are studied. Models and scene data are represented as local geometric features and robust hypothesis of feature matchings and transformations is considered. Bounds on the error in the image feature geometry are assumed constraining possible matchings and transformations. Transformation sampling is introduced as a simple, robust, polynomial-time, and highly parallel method of searching the space of transformations to hypothesize feature matchings. Key to the approach is that error in image feature measurement is explicitly accounted for. A Connection Machine implementation and experiments on real images are presented.

Informe técnico : análisis de pruebas físicas y cualidades de las arcillas 2 A- 2 B- 2 C- 2 D Veredea Palomitas - Floridablanca - Santander.

35 hojas : ilustraciones.

Fast Learning VIEWNET Architectures for Recognizing 3-D Objects from Multiple 2-D Views

The recognition of 3-D objects from sequences of their 2-D views is modeled by a family of self-organizing neural architectures, called VIEWNET, that use View Information Encoded With NETworks. VIEWNET incorporates a preprocessor that generates a compressed but 2-D invariant representation of an image, a supervised incremental learning system that classifies the preprocessed representations into 2-D view categories whose outputs arc combined into 3-D invariant object categories, and a working memory that makes a 3-D object prediction by accumulating evidence from 3-D object category nodes as multiple 2-D views are experienced. The simplest VIEWNET achieves high recognition scores without the need to explicitly code the temporal order of 2-D views in working memory. Working memories are also discussed that save memory resources by implicitly coding temporal order in terms of the relative activity of 2-D view category nodes, rather than as explicit 2-D view transitions. Variants of the VIEWNET architecture may also be used for scene understanding by using a preprocessor and classifier that can determine both What objects are in a scene and Where they are located. The present VIEWNET preprocessor includes the CORT-X 2 filter, which discounts the illuminant, regularizes and completes figural boundaries, and suppresses image noise. This boundary segmentation is rendered invariant under 2-D translation, rotation, and dilation by use of a log-polar transform. The invariant spectra undergo Gaussian coarse coding to further reduce noise and 3-D foreshortening effects, and to increase generalization. These compressed codes are input into the classifier, a supervised learning system based on the fuzzy ARTMAP algorithm. Fuzzy ARTMAP learns 2-D view categories that are invariant under 2-D image translation, rotation, and dilation as well as 3-D image transformations that do not cause a predictive error. Evidence from sequence of 2-D view categories converges at 3-D object nodes that generate a response invariant under changes of 2-D view. These 3-D object nodes input to a working memory that accumulates evidence over time to improve object recognition. ln the simplest working memory, each occurrence (nonoccurrence) of a 2-D view category increases (decreases) the corresponding node's activity in working memory. The maximally active node is used to predict the 3-D object. Recognition is studied with noisy and clean image using slow and fast learning. Slow learning at the fuzzy ARTMAP map field is adapted to learn the conditional probability of the 3-D object given the selected 2-D view category. VIEWNET is demonstrated on an MIT Lincoln Laboratory database of l28x128 2-D views of aircraft with and without additive noise. A recognition rate of up to 90% is achieved with one 2-D view and of up to 98.5% correct with three 2-D views. The properties of 2-D view and 3-D object category nodes are compared with those of cells in monkey inferotemporal cortex.

Mapping 2-D defects in a conductive half-space by eigenfunction expansions in K-space of Fourier-Laplace transforms

info:eu-repo/semantics/published

Simulation of 2-D metal cutting by means of a distributed algorithm

Temperature distributions involved in some metal-cutting or surface-milling processes may be obtained by solving a non-linear inverse problem. A two-level concept on parallelism is introduced to compute such temperature distribution. The primary level is based on a problem-partitioning concept driven by the nature and properties of the non-linear inverse problem. Such partitioning results to a coarse-grained parallel algorithm. A simplified 2-D metal-cutting process is used as an example to illustrate the concept. A secondary level exploitation of further parallel properties based on the concept of domain-data parallelism is explained and implemented using MPI. Some experiments were performed on a network of loosely coupled machines consist of SUN Sparc Classic workstations and a network of tightly coupled processors, namely the Origin 2000.