Inability of Humans to Discriminate between Visual Textures That Agree in Second-Order Statistics—Revisited

Perception ◽  
1973 ◽  
Vol 2 (4) ◽  
pp. 391-405 ◽  
Author(s):  
B Julesz ◽  
E N Gilbert ◽  
L A Shepp ◽  
H L Frisch

In an earlier study by Julesz (1962) pairs of random textures were generated side-by-side using a Markov process with different third-order joint-probability distributions but identical first- and second-order distributions. Such texture pairs could not be discriminated from each other by the human visual system without scrutiny. Unfortunately, Markov processes are inherently one-dimensional while the general processes underlying visual texture discrimination are two-dimensional. Here three new methods are introduced that generate two-dimensional non-Markovian textures with different third-order but identical first- and second-order statistics. All three methods generate texture pairs that cannot be discriminated from each other. The lack of texture discrimination is the more astonishing since the individual elements that form the texture pair are clearly perceived as being very different. However, a counterexample was found that yields discrimination although the texture pair has approximately identical second-order statistics. This case can be explained by assuming that early feature extractors do some preprocessing. These new demonstrations give support to a model of texture discrimination in which the stimulus is first analyzed by local feature extractors that can detect only simple features such as dots and edges of given sizes and orientations. Then the outputs of these simple extractors are evaluated by a global processor that can compute only second- or first-order statistics (that is can compare at most two such outputs).

Author(s):  
Nicole Crimi ◽  
William Eddy

Public Use Microdata Samples (PUMS) released by the U.S. Census Bureau and other data providers undergo various privacy protection transformations prior to public release of the individual records. We briefly review these methods but focus our attention on "top-coding" as implemented by the Census Bureau. In particular, we provide a brief analysis of the method used for top-coding of records within a hierarchy. We also show that top-coding artificially moves the correlation between two variables (at least one of which is top-coded) closer to zero by the transformation. We then discuss our attempts to recover the un-transformed data, or at least the original correlations, which all failed. In the final section we briefly discuss methods of disclosure avoidance in PUMS files which preserve joint probability distributions.


Geophysics ◽  
2000 ◽  
Vol 65 (3) ◽  
pp. 958-969 ◽  
Author(s):  
Lisa A. Pflug

Fourth‐order statistics can be useful in many signal processing applications, offering advantages over or supplementing second‐order statistical techniques. One reason is that fourth‐order statistics can discriminate between non‐Gaussian signals and Gaussian noise. Another is that fourth‐order statistics contain phase information, whereas second‐order statistics do not. In the continuing development of the mathematical properties of fourth‐order statistics, several researchers have derived existence conditions and definitions for the unaliased and aliased principal domains of the discrete trispectrum, which is significantly more complex than the power or energy spectrum. The consistencies and inconsistencies of these results are presented and resolved in this paper. The most flexible definitions give four individual principal domains for the discrete trispectrum: two unaliased and two aliased. The most useful combinations are those that combine the two unaliased domains together and the two aliased domains together, which can be done easily from the four individual domains. The relationship between the individual trispectral domains and signal bandwidth is important when using the fourth‐order statistic for applications because they have particular properties that can be detrimental to some deconvolution algorithms. The reasons for this, as well as the validity of proposed solutions to this problem, are explained by the trispectral structure and its origins.


2008 ◽  
Vol 41 (1) ◽  
pp. 8-17 ◽  
Author(s):  
D. Watts ◽  
K. Cowtan ◽  
J. Wilson

A method is presented for the classification of protein crystallization images based on image decomposition using the wavelet transform. The distribution of wavelet coefficient values in each sub-band image is modelled by a generalized Gaussian distribution to provide discriminatory variables. These statistical descriptors, together with second-order statistics obtained from joint probability distributions, are used with learning vector quantization to classify protein crystallization images.


2003 ◽  
Vol 52-54 ◽  
pp. 467-472 ◽  
Author(s):  
Hauke Bartsch ◽  
Klaus Obermayer

Sign in / Sign up

Export Citation Format

Share Document