34 resultados para planes of vision
Resumo:
In the title compound, C18H11ClN2O2, the isatin and 2-chloro-3-methylquinoline units are both almost planar, with r.m.s.deviations of 0.0075 and 0.0086 angstrom, respectively, and the dihedral angle between the mean planes of the two units is 83.13 (7)degrees. In the crystal, a weak intermolecular C-H center dot center dot center dot O interaction links the molecules into chains along the c axis.
Resumo:
Denoising of images in compressed wavelet domain has potential application in transmission technology such as mobile communication. In this paper, we present a new image denoising scheme based on restoration of bit-planes of wavelet coefficients in compressed domain. It exploits the fundamental property of wavelet transform - its ability to analyze the image at different resolution levels and the edge information associated with each band. The proposed scheme relies on the fact that noise commonly manifests itself as a fine-grained structure in image and wavelet transform allows the restoration strategy to adapt itself according to directional features of edges. The proposed approach shows promising results when compared with conventional unrestored scheme, in context of error reduction and has capability to adapt to situations where noise level in the image varies. The applicability of the proposed approach has implications in restoration of images due to noisy channels. This scheme, in addition, to being very flexible, tries to retain all the features, including edges of the image. The proposed scheme is computationally efficient.
Resumo:
Denoising of medical images in wavelet domain has potential application in transmission technologies such as teleradiology. This technique becomes all the more attractive when we consider the progressive transmission in a teleradiology system. The transmitted images are corrupted mainly due to noisy channels. In this paper, we present a new real time image denoising scheme based on limited restoration of bit-planes of wavelet coefficients. The proposed scheme exploits the fundamental property of wavelet transform - its ability to analyze the image at different resolution levels and the edge information associated with each sub-band. The desired bit-rate control is achieved by applying the restoration on a limited number of bit-planes subject to the optimal smoothing. The proposed method adapts itself to the preference of the medical expert; a single parameter can be used to balance the preservation of (expert-dependent) relevant details against the degree of noise reduction. The proposed scheme relies on the fact that noise commonly manifests itself as a fine-grained structure in image and wavelet transform allows the restoration strategy to adapt itself according to directional features of edges. The proposed approach shows promising results when compared with unrestored case, in context of error reduction. It also has capability to adapt to situations where noise level in the image varies and with the changing requirements of medical-experts. The applicability of the proposed approach has implications in restoration of medical images in teleradiology systems. The proposed scheme is computationally efficient.
Resumo:
Denoising of images in compressed wavelet domain has potential application in transmission technology such as mobile communication. In this paper, we present a new image denoising scheme based on restoration of bit-planes of wavelet coefficients in compressed domain. It exploits the fundamental property of wavelet transform - its ability to analyze the image at different resolution levels and the edge information associated with each band. The proposed scheme relies on the fact that noise commonly manifests itself as a fine-grained structure in image and wavelet transform allows the restoration strategy to adapt itself according to directional features of edges. The proposed approach shows promising results when compared with conventional unrestored scheme, in context of error reduction and has capability to adapt to situations where noise level in the image varies. The applicability of the proposed approach has implications in restoration of images due to noisy channels. This scheme, in addition, to being very flexible, tries to retain all the features, including edges of the image. The proposed scheme is computationally efficient.
Resumo:
The title compound, C(15)H(15)F(3)N(2)O(2)S, adopts a conformation with an intramolecular C-H center dot center dot center dot pi interaction. The dihedral angles between the planes of the 4-(trifluoromethyl) phenyl and ester groups with the plane of the six-membered tetrahydropyrimidine ring are 81.8 (1) and 16.0 (1)degrees, respectively. In the crystal structure, intermolecular N-H center dot center dot center dot S hydrogen bonds link pairs of molecules into dimers and N-H center dot center dot center dot O interactions generate hydrogen-bonded molecular chains along the crystallographic a axis.
Resumo:
Nanoindentation and scratch experiments on 1:1 donor-acceptor complexes, 1 and 2, of 1,2,4,5-tetracyanobenzene with pyrene and phenanthrene, respectively, reveal long-range molecular layer gliding and large interaction anisotropy. Due to the layered arrangements in these crystals, these experiments that apply stress in particular directions result in the breaking of interlayer interactions, thus allowing molecular sheets to glide over one another with ease. Complex 1 has a layered crystal packing wherein the layers are 68° skew under the (002) face and the interlayer space is stabilized by van der Waals interactions. Upon indenting this surface with a Berkovich tip, pile-up of material was observed on just one side of the indenter due to the close angular alignment of the layers with the half angle of the indenter tip (65.35°). The interfacial differences in the elastic modulus (21 ) and hardness (16 ) demonstrate the anisotropic nature of crystal packing. In 2, the molecular stacks are arranged in a staggered manner; there is no layer arrangement, and the interlayer stabilization involves C-H�N hydrogen bonds and ��� interactions. This results in a higher modulus (20 ) for (020) as compared to (001), although the anisotropy in hardness is minimal (4 ). The anisotropy within a face was analyzed using AFM image scans and the coefficient of friction of four orthogonal nanoscratches on the cleavage planes of 1 and 2. A higher friction coefficient was obtained for 2 as compared to 1 even in the cleavage direction due to the presence of hydrogen bonds in the interlayer region making the tip movement more hindered. Copyright © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Resumo:
How do we perform rapid visual categorization?It is widely thought that categorization involves evaluating the similarity of an object to other category items, but the underlying features and similarity relations remain unknown. Here, we hypothesized that categorization performance is based on perceived similarity relations between items within and outside the category. To this end, we measured the categorization performance of human subjects on three diverse visual categories (animals, vehicles, and tools) and across three hierarchical levels (superordinate, basic, and subordinate levels among animals). For the same subjects, we measured their perceived pair-wise similarities between objects using a visual search task. Regardless of category and hierarchical level, we found that the time taken to categorize an object could be predicted using its similarity to members within and outside its category. We were able to account for several classic categorization phenomena, such as (a) the longer times required to reject category membership; (b) the longer times to categorize atypical objects; and (c) differences in performance across tasks and across hierarchical levels. These categorization times were also accounted for by a model that extracts coarse structure from an image. The striking agreement observed between categorization and visual search suggests that these two disparate tasks depend on a shared coarse object representation.
Resumo:
Text segmentation and localization algorithms are proposed for the born-digital image dataset. Binarization and edge detection are separately carried out on the three colour planes of the image. Connected components (CC's) obtained from the binarized image are thresholded based on their area and aspect ratio. CC's which contain sufficient edge pixels are retained. A novel approach is presented, where the text components are represented as nodes of a graph. Nodes correspond to the centroids of the individual CC's. Long edges are broken from the minimum spanning tree of the graph. Pair wise height ratio is also used to remove likely non-text components. A new minimum spanning tree is created from the remaining nodes. Horizontal grouping is performed on the CC's to generate bounding boxes of text strings. Overlapping bounding boxes are removed using an overlap area threshold. Non-overlapping and minimally overlapping bounding boxes are used for text segmentation. Vertical splitting is applied to generate bounding boxes at the word level. The proposed method is applied on all the images of the test dataset and values of precision, recall and H-mean are obtained using different approaches.
Resumo:
Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search.
Resumo:
In this paper, we propose FeatureMatch, a generalised approximate nearest-neighbour field (ANNF) computation framework, between a source and target image. The proposed algorithm can estimate ANNF maps between any image pairs, not necessarily related. This generalisation is achieved through appropriate spatial-range transforms. To compute ANNF maps, global colour adaptation is applied as a range transform on the source image. Image patches from the pair of images are approximated using low-dimensional features, which are used along with KD-tree to estimate the ANNF map. This ANNF map is further improved based on image coherency and spatial transforms. The proposed generalisation, enables us to handle a wider range of vision applications, which have not been tackled using the ANNF framework. We illustrate two such applications namely: 1) optic disk detection and 2) super resolution. The first application deals with medical imaging, where we locate optic disks in retinal images using a healthy optic disk image as common target image. The second application deals with super resolution of synthetic images using a common source image as dictionary. We make use of ANNF mappings in both these applications and show experimentally that our proposed approaches are faster and accurate, compared with the state-of-the-art techniques.
Resumo:
Single features such as line orientation and length are known to guide visual search, but relatively little is known about how multiple features combine in search. To address this question, we investigated how search for targets differing in multiple features ( intensity, length, orientation) from the distracters is related to searches for targets differing in each of the individual features. We tested race models (based on reaction times) and coactivation models ( based on reciprocal of reaction times) for their ability to predict multiple feature searches. Multiple feature searches were best accounted for by a co-activation model in which feature information combined linearly (r = 0.95). This result agrees with the classic finding that these features are separable i.e., subjective dissimilarity ratings sum linearly. We then replicated the classical finding that the length and width of a rectangle are integral features-in other words, they combine nonlinearly in visual search. However, to our surprise, upon including aspect ratio as an additional feature, length and width combined linearly and this model outperformed all other models. Thus, length and width of a rectangle became separable when considered together with aspect ratio. This finding predicts that searches involving shapes with identical aspect ratio should be more difficult than searches where shapes differ in aspect ratio. We confirmed this prediction on a variety of shapes. We conclude that features in visual search co-activate linearly and demonstrate for the first time that aspect ratio is a novel feature that guides visual search.
Combustion synthesized tetragonal ZrO2: Eu3+ nanophosphors: Structural and photoluminescence studies
Resumo:
Novel crystalline tetragonal ZrO2: Eu3+ phosphors were prepared by a facile and efficient low temperature solution combustion method at 400 +/- 10 degrees C using oxalyl dihydrazide (ODH) as fuel. The powder X-ray diffraction patterns and Rietveld confinement of as formed ZrO2: Eu3+ (1-11 mol%) confirmed the presence of body centered tetragonal phase. The crystallite size estimated from Scherrer's and W-H plots was found to be in the range of 7-17 nm. These results were in good agreement with transmission electron microscopy studies. The calculated microstrain in most of the planes indicated the presence of tensile stress along various planes of the particles. The observed space group (P4(2)/nmc) revealed the presence of cations in the 2b positions (0.75, 0.25, 0.25) and the anions in the 4d positions (0.25, 0.25, 0.45). The optical band gap energies estimated from Wood and Tauc's relation was found to be in the range 4.3-4.7 eV. Photoluminescence (PL) emission was recorded under 394 and 464 nm excitation shows an intense emission peak at 605 nm along with other emission peaks at 537, 592, 605 and 713 nm. These emission peaks were attributed to the transition of D-5(0) -> F-7(J) (J = 0, 1, 2, 3) of Eu3+ ions. The high ratio of Intensity of (D-5(0) -> F-7(2)) and (D-5(0) -> F-7(1)) infers that Eu3+ occupies sites with a low symmetry and without an inversion center. CIE color coordinates indicated the red regions which could meet the needs of illumination devices. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
We perceive objects as containing a variety of attributes: local features, relations between features, internal details, and global properties. But we know little about how they combine. Here, we report a remarkably simple additive rule that governs how these diverse object attributes combine in vision. The perceived dissimilarity between two objects was accurately explained as a sum of (a) spatially tuned local contour-matching processes modulated by part decomposition; (b) differences in internal details, such as texture; (c) differences in emergent attributes, such as symmetry; and (d) differences in global properties, such as orientation or overall configuration of parts. Our results elucidate an enduring question in object vision by showing that the whole object is not a sum of its parts but a sum of its many attributes.
Resumo:
An attempt is made to present some challenging problems (mainly to the technically minded researchers) in the development of computational models for certain (visual) processes which are executed with, apparently, deceptive ease by the human visual system. However, in the interest of simplicity (and with a nonmathematical audience in mind), the presentation is almost completely devoid of mathematical formalism. Some of the findings in biological vision are presented in order to provoke some approaches to their computational models, The development of ideas is not complete, and the vast literature on biological and computational vision cannot be reviewed here. A related but rather specific aspect of computational vision (namely, detection of edges) has been discussed by Zucker, who brings out some of the difficulties experienced in the classical approaches.Space limitations here preclude any detailed analysis of even the elementary aspects of information processing in biological vision, However, the main purpose of the present paper is to highlight some of the fascinating problems in the frontier area of modelling mathematically the human vision system.