Conference PaperPDF Available

Benford's Law for Natural and Synthetic Images.

Authors:
Computational Aesthetics in Graphics, Visualization and Imaging (2005)
L. Neumann, M. Sbert, B. Gooch, W. Purgathofer (Editors)
Benford’s Law for Natural and Synthetic Images
E. Acebo, and M. Sbert
Institut d’Informàtica i Aplicacions, Universitat de Girona, Spain
Abstract
Benford’s Law (also known as the First Digit Law) is well known in statistics of natural phenomena. It states
that, when dealing with quantities obtained from Nature, the frequency of appearance of each digit in the first
significant place is logarithmic. This law has been observed over a broad range of statistical phenomena. In this
paper, we will explore its application to image analysis. We will show how light intensities in natural images,
under certain constraints, obey this law closely. We will also show how light intensities in synthetic images follow
this law whenever they are generated using physically realistic methods, and fail otherwise. Finally, we will study
how transformations on the images affect the adjustment to the Law and how the fitting to the law is related to the
fitting of the distribution of the raw intensities of the image to a power law.
Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computing Methodologies]: Computer Graph-
icsPicture/Image Generation; I.4.8 [Computing Methodologies]: Image Processing and Computer VisionScene
Analysis
1. Introduction
Image statistics is a growing field in image analysis
[ERT01], [SO01], [AW05], with many potential applica-
tions. We contribute to this field by studying the fitting of
images (both natural and synthetics) to Benford’s Law. This
law (also known as the First Digit Law) is well known in
statistics of natural phenomena. It states that, when dealing
with quantities obtained from Nature, the frequency of ap-
pearance of each digit in the first significant place is loga-
rithmic. This law has been observed over a broad range of
physical phenomena, from city populations to river lenghts
and flows. It has been applied to fraud detection in tax pay-
ing, to the design of computers, to the analysis of roundoff
errors and as a statistical test for naturalness. We will show
in this paper how natural images, under certain constraints,
follow closely this law. We also show how synthetic (com-
puter generated) images follow this law whenever they are
generated using physically realistic methods, and fail other-
wise. On the other hand, a transformation on the image, such
as filtering, will affect the adjustment to the law. We finally
discuss how the fitting to Benford’s Law is related to the fit-
ting of raw intensities to a power law.
The rest of the paper is organized as follows. In section
2 we review the Benford’s law, in section 3 we study its ap-
plicability to images, both synthetic and natural, in section 4
we present an explanation for the obtained results and finally
in section 5 we present our conclusions and future research.
2. Benford’s Law
2.1. The uneven distribution of digits in Nature
Suppose that we have a table with the populations of all the
villages and towns in the world. Count how many of these
numbers begin with the digit 1, how many with the digit 2
and so on. Contrary to what we can intuitively expect, the
relative frequency of the populations starting with each of
the nine digits is not the same. Actually, we will find that
about 30% of populations begin with the digit 1, and only
about 5% with the digit 9. That phenomenon is not partic-
ular of populations, a vast amount of "natural" quantities,
ranging from river lengths and flows to molecular weights
of chemical compounds and stock prices, exhibit the same
uneven distribution of first digits. It is not new. It was ob-
served by Simon Newcomb in 1881 and then rediscovered
by Frank Benford in 1938.
Benford’s Law (also known as logarithmic significant
digit distribution), in its most general form (base 10, D
i
means the ith significant digit) tells that for all positive in-
tegers k, all d
1
{1,2,..., 9} and all d
j
{0,1,2, ... ,9},
j = 2, .. .,k, probability P is given by
c
The Eurographics Association 2005.
E. Acebo, M. Sbert, & / Benford’s Law for images
Figure 1: First digit distribution according to Benford’s
Law.
P(D
1
= d
1
,. .., D
k
= d
k
) = log
10
[1 + (
k
i=1
d
i
· 10
ki
)
1
] (1)
or equivalently
P(mantissa
t
10
) = log
10
t (2)
for t [1 . . .10).
Hence the first significant digit law:
P(first significant digit = d) = log
10
(1 +
1
d
) (3)
We can see in the graph in Fig.
1 the values of the prob-
abilities of each of the nine possible first digits. A perhaps
surprising corollary to the general law is that significant dig-
its are not independent, that is, the probability for the nth
significant digit to take a certain value depends on the values
of the n 1 leading significant digits [Hil96].
Some interesting properties of the logarithmic distribution
are the following:
Let X
1
,X
2
be random variables with logarithmic signifi-
cant digit distribution, then
K · X
1
for K > 0
1/X
1
X
1
+ X
2
X
1
· X
2
X
K
1
for K > 0
also have logarithmic significant digit distribution.
Also, let X
1
,X
2
,. .., X
n
be random variables, then, under
certain (rather general) conditions
i
X
i
(4)
tends to have logarithmic significant digit distribution when
n tends towards infinity.
Benford’s law has been so far applied to the fields of com-
puter design:
Data compression [
Sch88]
Floating point computing optimization [FT86], [Knu69],
[BB85]
and to test for "naturalness":
Model validation [Var72], [NW95]
Tax fraud detection [Nig96], [NM97]
It has also been applied in gambling [Che81].
2.2. Explanations for Benford’s Law
While Benford’s law unquestionably applies to many situa-
tions in the real world, a satisfactory explanation has been
given only recently through the work of Hill [Hil96]. An
extensive account of the early efforts to explain the phe-
nomenon can be found in [Rai76]. Perhaps the first impor-
tant step in the right direction was the realization that Ben-
ford’s law is applied to data that are not dimensionless (so
the numerical values of the data depend on the units). If there
is a universal probability distribution over such numbers,
then it must be invariant under scale changes. If somehow
Benford’s Law has to be of universal applicability, it has to
hold independently of the units used in the measurements.
If you have a set of random variables following Benford’s
Law and you multiply them by some constant, the resulting
values will also obey Benford’s Law (after all, "God is not
known to favor either the metric system or the English sys-
tem" [Rai76]). It turns out that Benford’s Law is the only
scale-invariant probability distribution for significant digits
(see [Hil96] for a deep analysis of this point). So, if natural
quantities have to follow a given probability law for signif-
icant digits, it has to be Benford’s Law. The question about
why those quantities would have to follow such a fixed law
remains open, however.
The most convincing explanation of the phenomenon, by
now, comes from Hill [Hil96]. The main result of his work
is a sort of central-limit-like theorem for significant digits
which says, putting it in the author’s own plain words, "if
probability distributions are selected at random, and random
samples are then taken from each of these distributions in
any way so that the overall process is scale (or base) neu-
tral, then the significant digit frequencies of the combined
sample will converge to the logarithmic distribution". Two
key concepts in the above statement are those of scale and
base neutrality. Let’s focus on the former. According to Hill,
a sequence of random variables X
1
,X
2
,. .. has scale-neutral
mantissa frequency if
n
1
| #{i n : X
i
S} #{i n : X
i
sS} |→ 0 a.s. (5)
for all s > 0 and all S M, where M is the sub-sigma alge-
bra of the Borels where the probability measure P is defined
(see [Hil96] for details):
S M S =
[
n=−∞
B · 10
n
(6)
c
The Eurographics Association 2005.
E. Acebo, M. Sbert, & / Benford’s Law for images
for some Borel B [1, 10).
We will return to it later in the discussion section, where
we will make use of the theorem to justify the fitting of
a broad class of images to Benford’s Law attending to the
shape of their histograms.
3. Benford’s Law and images
Our aim in this section is to study to what extent and in what
aspects images, both syntethic and real, obey Benford’s Law.
This should allow us to design new methods for image anal-
ysis and classification based in this previous study. Appli-
cation of Bendford’s Law to image analysis is quite innova-
tive. To our knowledge, there is only one other attempt in
this way [Jol01]. In that paper, however, the author quickly
discards the idea of pixel intensity values of general images
to follow Benford’s Law and focuses on the gradient of these
values, instead. We will study the matter from another per-
spective. Obviously not all the images obey Benford’s Law,
but in this paper we will show how a great variety of natural
and artificial images do, and will characterize them in terms
of the shape of their histograms.
3.1. Benford’s Law and synthetic physically realistic
images
Radiosity and ray-tracing provide us with physically realistic
images [DBB03]. In Radiosity three radiosity values (RGB)
are computed for each patch (or polygon of the scene mesh)
in the scene. In ray tracing three intensity values are com-
puted for each pixel in the screen. These values closely fol-
low the logarithmic first digit distribution in several scenes
that we have tested. This can be seen in the set of images
in Fig.2 and Fig.3. Scenes in Fig.2 contain 49124 (top) and
22718 (bottom) patches, respectively. The quality of the fit-
ting is measured with the χ
2
divergence:
9
i=1
( f
i
log
10
(1 +
1
i
))
2
log
10
(1 +
1
i
)
(7)
where f
i
is the relative frequency of i as first digit in the set
of values (radiosities or intensities).
3.2. Benford’s Law and synthetic non-physically
realistic images
When non-physically realistic rendering methods are used
in addition with radiosity or ray tracing methods (ambient
occlusion or obscurances [IKSZ03], extended ambient term
[CNS00], textures) the resulting values diverge from Ben-
ford’s Law. Thus, Benford’s Law could be used as a test for
physical realism in synthetic image rendering. In Fig.4 we
see the discrepancy between Benford’s Law and two texture
images, obtained by PovRay [Pov].
3.3. Benford’s Law and real images
We can’t work with real images, only with pictures of real
images. Digital pictures represent an imperfect measurement
of natural phenomena. We face potential data corruption
from:
Noise
Over/underexposure
Discretization
Interpolation
Gamma correction
Retouching
In order to overcome these problems as much as possible we
will work with raw images (no interpolation, no gamma cor-
rection, no retouching, 16 bits per channel). Not all "real"
images obey Benford’s Law, see for instance Fig.5. How-
ever, they tend to do it quite often and quite well. (See Figure
6). In Fig.7 we show a photograph of a painting fitting also
Benford’s Law. In Fig.8 we show the effect on the fitting of
a flash light, and in Fig.9 we show the effect of applying dif-
ferent filters to the images. Fig.9 top-left corresponds to the
original raw, unfiltered image. Fig.9 top-right is the result of
applying to the previous image the PhotoShop contrast and
brightness autobalancing, in Fig.9 bottom-left we applied the
PhotoShop high-pass filter, and finally in Fig.9 bottom-right
we applied the PhotoShop equalizing filter.
4. Discussion
A broad class of synthetic and real images tend to obey Ben-
ford’s Law. Those that better fit this law seem to have multi-
ple heterogeneous interacting objects (from the point of view
of lighting), see Fig.2,3& 6(bottom). Images reflecting only
a small part of a scene or a detail do not fit so well or do not
fit at all, see Fig.5. The logs image in Fig.6(middle) is obvi-
ously an exception to this rule. We can, however, try to give a
more objective justification to the phenomenon. Recall from
section 2 Hill’s theorem, which states that if probability dis-
tributions are selected at random, and random samples are
then taken from each of these distributions in any way so that
the overall process is scale (or base) neutral, then the signifi-
cant digit frequencies of the combined sample will converge
to the logarithmic distribution. We can deduce from this that
if we take samples from a single distribution and they re-
sult to be distributed in a scale neutral way in the sense of
(5) then we can expect the samples to follow the logarithmic
distribution. In other words, samples taken from a scale neu-
tral probability distribution will follow Benford’s Law. One
such probability distribution is p(x) = 1/x. In effect we have
Z
b
a
1
x
dx =
Z
kb
ka
1
x
dx (8)
for a, b,k <, 0 < a b, k > 0, and this implies, in lack of
a rigorous proof, scale neutrality in the sense of (
5).
Now consider the histograms of the images in the paper.
c
The Eurographics Association 2005.
E. Acebo, M. Sbert, & / Benford’s Law for images
Figure 2: Left: radiosity images. Middle: graphs demonstrate the fitting of left image with Benford’s law. For the top image
the fitting corresponds to χ
2
=0.00703, and for the bottom one χ
2
=0.01549. Right: Histograms. Images courtesy of Francesc
Castro and Roel Martinez.
They plot frequencies against intensity values of pixels (or
patches in the case of radiosity), so we can see them as prob-
ability distributions of pixel (patch) intensities. By the above
discussion, histograms with shape similar to the 1/x func-
tion will correspond to images whose pixels values are more
scale-neutrally distributed. We expect those images to fol-
low closely Benford’s Law. And that is the case, indeed, as
we can see in Figs.2,3, 6, 7& 8.
We can draw some additional conclusions. On the one
hand, Benford’s Law tends not to hold well in images ob-
tained by means of non-physically realistic rendering meth-
ods. On the other hand, in real images, the fit with the law
is very sensitive to the application of filters and retouching
algorithms, see Fig.9.
5. Conclusions and future work
A broad class of synthetic and real images tend to obey
Benford’s Law. The images that fit the law better seem to
be those with multiple heterogeneous interacting (from the
point of view of lighting) objects. Benford’s Law tends not
to hold in images obtained by means of non physically real-
istic rendering methods. In real images, the fit with the law
is very sensitive to the application of filters and retouching
algorithms.
We envisage the following applications:
Hardware/Software design: digital camera sensors,
graphic cards, graphic algorithms
Data compression. (Not much, about half a bit per floating
point number in FP16)
Test for "naturalness" in synthetic images
Further analysis of when and why images follow Benford’s
Law is needed. We intend to further study specialized image
types, including astronomical and medical images, as well
as other types of data (do natural sounds follow Benford’s
Law?).
References
[AW05] AWATE S. P., WHI TAKE R R. T.: Higher-order
image statistics for unsupervised, information-theoretic,
adaptive, image filtering. In Proc. IEEE Int. Conf. Com-
puter Vision and Pattern Recognition 2005 (2005). 1
[BB85] BARLOW J., BA R EISS E.: On roundoff error
distributions in floating point and logarithmic arithmetic.
Computing 34 (1985), 325–347. 2
[Che81] CHERNOFF H.: How to beat the massachusetts
numbers game. Math. Intel. 3 (1981), 166–172. 2
[CNS00] CASTRO F., NEU MA NN L., SBE RT M.: Ex-
tended ambient term. Journal of Graphic Tools 4, 5
(2000), 1–7. 3
[DBB03] DU TRE P., BALA K., BEK AERT P.: Advanced
Global Illumination. AK Peters, USA, 2003. 3
[ERT01] ERIK REI NHARD P. S., TROSCI ANKO T.: Nat-
ural image statistics for computer graphics. Research
c
The Eurographics Association 2005.
E. Acebo, M. Sbert, & / Benford’s Law for images
Figure 3: Left: ray-tracing images. Middle: graphs demonstrate the fitting of left image with Benford’s law. For the top image
the fitting corresponds to χ
2
=0.01714, and for the bottom one χ
2
=0.00094. Right: Histograms. Images courtesy of Ignacio
Martin.
Figure 4: Left: textured images. Middle: graphs demonstrate the unfitting of left image with Benford’s law. For the top image
the fitting corresponds to χ
2
=0.31708, and for the bottom one χ
2
=0.22037. Right: Histograms.
c
The Eurographics Association 2005.
E. Acebo, M. Sbert, & / Benford’s Law for images
Figure 5: Left: real images. Middle: graphs demonstrate the unfitting of left image with Benford’s law. For the top image the
fitting corresponds to χ
2
=1.44835, and for the bottom one χ
2
=1.62312. Right: Histograms.
Figure 6: Left: real images. Middle: graphs demonstrate the fitting of left image with Benford’s law. From top to bottom the
fitting corresponds to χ
2
=0.02922, 0.00245, 0.00820, respectively. Right: Histograms.
c
The Eurographics Association 2005.
E. Acebo, M. Sbert, & / Benford’s Law for images
Figure 7: Left: photograph of a painting. Middle: graph demonstrate the fitting of left image with Benford’s law χ
2
= 0.02998.
Right: Histogram.
Figure 8: Top/bottom rows correspond to a photograph (left images) taken without/with flash light, respectively. Middle: graphs
demonstrate the fitting of left images with Benford’s law. For the top image the fitting corresponds to χ
2
=0.06433, and for the
bottom one χ
2
=0.18942. Right: Histograms.
Report UUCS-01-002, School of Computing, University
of Utah, Salt Lake City, Salt Lake City, UT 84112 USA,
2001. 1
[FT86] FE LDSTEI N A., TU RNER P.: Overflow, underflow
and severe loss of significance in floating-point addition.
IMA J. Numerical Analysis 6 (1986), 241–251. 2
[Hil96] HI LL T.: A statistical derivation of the significant-
digit law. Statistical Science 10, 4 (1996), 354–363. 2
[IKSZ03] IONES A., KRUPKIN A., SB ERT M., ZH UKOV
S.: Fast realistic lighting for video games. IEEE Com-
puter Graphics & Applications (2003). 3
[Jol01] JO LION J. M.: Image and the benford’s law. J.
Math. Imaging Vision 14 (2001), 73–81. 3
[Knu69] KNUTH D.: The art of computer programming.
Vol. 2. Addison-Wesley. New York, 1969. 2
[Nig96] NIGRINI M. J.: Note on the frequency of use of
the diferent digits in natural numbers. The White Paper
(1996). 2
[NM97] NIGRINI M. J., MITTERMA IER L. I.: The use of
benford’s law as an aid in analytical procedures. Auditing:
A Journal of Practice and Theory 16 (1997), 52–67. 2
[NW95] NIGRINI N., WOO D W.: Assessing the integrity
of demographic tabulated data, 1995. 2
[Pov] The persistence of vision ray-tracer,
http://www.povray.com. 3
[Rai76] RAIMI R.: The first digit problem. American
Mathematical Monthly 83 (1976), 521–538. 2
[Sch88] SCHATT E P.: On mantissa distributions in com-
puting and benford’s law. J. Inf. Process. Cyber. EIK 24
(1988), 443–455. 2
c
The Eurographics Association 2005.
E. Acebo, M. Sbert, & / Benford’s Law for images
Figure 9: Results of applying three different filtering methods to the same raw image (top-left). Top-right is the result of applying
to the previous image the PhotoShop contrast and brightness autobalancing, in bottom-left we applied the PhotoShop pass-high
filter, and in bottom-right we applied the PhotoShop equalizing filter.From left to right and top to bottom, χ
2
=0.03254, 0.05648,
0.28120, 0.22083, respectively
[SO01] SI MONCEL LI E. P., OL SHAUSEN B. A.: Natu-
ral image statistics and neural representation. Annu. Rev.
Neurosci. 24 (2001), 193–216. 1
[Var72] VA R IAN H.: Benford’s law. Amer. Statician 23
(1972), 65–66. 2
c
The Eurographics Association 2005.
... Therefore, images mapped into the DCT domain typically follow BFL closely [28], giving us a transform that can be used to extract a distribution that should follow BFL. Previous work has exploited this for applications such as detecting JPEG compression [27,24], synthetic imagery [2], estimating the amount of processing that has been applied to an image, and detecting image tampering [34]. It has been applied to detect if an image is generated by a generative adversarial network (GAN) [8]. ...
... It has been applied to detect if an image is generated by a generative adversarial network (GAN) [8]. It has also been shown that images that reflect only a small part of a scene do not fit BFL well [2]. A connection between a neural network's generalisation capability and a BFL related metric has been studied [32]. ...
Chapter
Out-of-distribution data and anomalous inputs are vulnerabilities of machine learning systems today, often causing systems to make incorrect predictions. The diverse range of data on which these models are used makes detecting atypical inputs a difficult and important task. We assess a tool, Benford’s law, as a method used to quantify the difference between real and corrupted inputs. We believe that in many settings, it could function as a filter for anomalous data points and for signalling out-of-distribution data. We hope to open a discussion on these applications and further areas where this technique is underexplored.
... This is also important within Concretism, being specifically mentioned in tenet three. Due to its importance to aesthetic judgement, it also forms the basis of a large number of existing measures which attempt to assess images [1,27,38], looking at aspects such as the relative positioning of the colours or which gradients are present. Due to the stalwart nature of colour as a part of aesthetic judgement, adding colour into the generated sculptures and images was a necessary addition. ...
... The chosen measures also had to be applicable to both 2D and 3D items. Due to these restrictions, established measures, such as the Global Contrast Factor [27], the colour gradients present within an image [38] or the naturalness of the image [1] were not considered. Instead, three canonical properties are used, all of which are considered to contribute to the aesthetic appeal of a generated item: the level of symmetry, complexity and compressibility. ...
Article
Full-text available
Automated computer generation of aesthetically pleasing artwork has been the subject of research for several decades. The unsolved problem of interest is how to please any audience without requiring too much of their involvement in the process of creation. Two-dimensional pictures have received a lot of attention; however, 3D artwork has remained relatively unexplored. This paper showcases an extended version of the Axial Generation Process (AGP), a versatile generation algorithm that can create both 2D and 3D items within the Concretism art style. The extensions presented here include calculating colour values for the artwork, increasing the range of forms that can be created through dynamic sizing of shapes and including more primitive shape types, finally, 2D items can be created from multiple viewpoints. Both 2D and 3D items generated through the AGP were evaluated against a set of formal aesthetic measures and compared against two established generation systems, one based on manipulating pixels/voxels and another tracking the path of particles through 2D and 3D space. This initial evaluation shows that the process is capable of generating visually varied items which exhibit a generally diverse range of values across the measures used, in both two and three dimensions. Comparatively, against the established generation processes, the AGP shows a good balance of performance and ability to create complex and visually varied items.
... In inter coding, the current frame is predicted using the previous frames. HEVC is the most recent encoder that (1) where λ pred is Lagrangian multiplier, SATD represents sum of absolute Hadamard transformed coefficients and R represents the number of bits required to represent the intra mode. The N intra modes shortlisted by RMD module are passed to rate distortion optimization quantization (RDOQ) module to select a single intra mode from these N elements. ...
... The BF is capable of detecting anomalies from the sequence; therefore, it was applied to find fraudulent data. Such efficient capability of BF caught the attention of computer experts who utilized it in [1] to find out whether the image is tempered or not. In BF, the data are represented using Benford's law and they have a unique curve known as Benford's law curve. ...
Article
Full-text available
In this paper, Benford’s law (BF) is analyzed and its feasibility is presented to solve the complexity issue of high-efficiency video coding (HEVC). Secondly, the intra modes selected for the current block are modeled using BF’s curve to identify the most important intra modes. Finally, the intra mode computation process is terminated when the probability of these intra modes does not follow BF’s curve. This termination results in an early mode decision algorithm that reduces the complexity of HEVC. Experimental results on HEVC’s dataset show that the proposed algorithm reduces the complexity of the HEVC by 32.77% and the increase in BD-BR (Bjontegaard delta bit rate) is only 1.62%.
... The N, s, and q values are as shown in Table 3 for the Generalized Benford's law experiments. To test for conformity of a particular dataset (fingerprint images) to Benford's law, one of the most common criteria used is the chi-square goodness-of-fit statistics test (Acebo & Sbert, 2005;Li et al., 2012;Iorliam et al., 2016). The chi-square divergence is expressed in Equation 3. ...
Article
Full-text available
Protecting a biometric fingerprint database against attackers is very vital in order to protect against false acceptance rate or false rejection rate. A key property in distinguishing biometric fingerprint images is by exploiting the characteristics of these different types of fingerprint images. The aim of this paper is to perform an intra-class classification of fingerprint images using Benford's law divergence values and machine learning techniques. The usage of these Benford’s law divergence values as features fed into the machine learning techniques has proved to be very effective and efficient in the intra-class classification of biometric fingerprint images. The effectiveness of our proposed methodology was demonstrated on five datasets resulting in a total of 367 samples. All the machine learning techniques used in this experiment were trained using the k-fold cross validation and the dataset was split into ten times (10-folds). The models achieved high intra-class classification mean accuracies of 99.72% for the Convolutional Neural Networks (CNN), and 95.90% for the Naïve Bayes. Again, the Decision Tree and Logistic Regression, achieved accuracies of 95.62%, and 94.47%, respectively. These results showed that Benford’s law features and machine learning techniques, especially the CNN and Naïve Bayes can be effectively applied for the intra-class classification of fingerprint images. The implication of these results is that the different types of fingerprint images can be effectively discriminated using Benford's law divergence values and machine learning technique for forensics and biometrics applications.
... The N, s, and q values are as shown in Table 3 for the Generalised Benford's law experiments. To test for conformity of a particular dataset (fingerprint images) to Benford's law, one of the most common criteria used is the chi-square goodness-of-fit statistics test [3], [16], [17]. The chi-square divergence is expressed in Eq. (3). ...
Preprint
Full-text available
Protecting a fingerprint database against attackers is very vital in order to protect against false acceptance rate or false rejection rate. A key property in distinguishing fingerprint images is by exploiting the characteristics of these different types of fingerprint images. The aim of this paper is to perform the classification of fingerprint images.
... Benford's Law (BL) has been observed in many naturally occurring populations, including the physical constants, populations of countries, areas of lakes, stock market indices, tax accounts, etc. [1]. Researchers have also discovered the presence of this law in natural sciences [2], image gradient magnitude [3], synthetic and natural images [4], etc. Attempts have been made to explain the underlying reason for BL's emergence for specific domains. However, a universally accepted explanation does not yet exist. ...
Conference Paper
Full-text available
Benford's Law (BL) or the Significant Digit Law defines the probability distribution of the first digit of numerical values in a data sample. This Law is observed in many datasets. It can be seen as a measure of naturalness of a given distribution and finds its application in areas like anomaly and fraud detection. In this work, we address the following question: Is the distribution of the Neural Network parameters related to the network's generalization capability? To that end, we first define a metric, MLH (Model Enthalpy), that measures the closeness of a set of numbers to BL. Second, we use MLH as an alternative to Validation Accuracy for Early Stopping and provide experimental evidence that even if the optimal size of the validation set is known beforehand, the peak test accuracy attained is lower than early stopping with MLH i.e. not using a validation set at all.
Chapter
Symmetry is a universal concept, its unique importance has made it a topic of research across many different fields. It is often considered as a constant where higher levels of symmetry are preferred in the judgement of faces and even the initial state of the universe is thought to have been in pure symmetry. The same is true in the judgement of auto-generated art, with symmetry often used alongside complexity to generate aesthetically pleasing images; however, these are two of many different aspects contributing to aesthetic judgement, each one of these aspects is also influenced by other aspects, for example, art expertise. These intricacies cause multiple problems such as making it difficult to describe aesthetic preferences and to auto-generate artwork using a high number of these aspects. In this paper, a gamified approach is presented which is used to elicit the preferences of symmetry levels for individuals and further understand how symmetry can be utilised within the context of automatically generating artwork. The gamified approach is implemented within an experiment with participants aged between 13 and 60, providing evidence that symmetry should be kept consistent within an evolutionary art context.KeywordsAesthetic judgement3D Art GenerationGamificationVirtual Reality
Chapter
Automated computer generation of aesthetically pleasing artwork has been the subject of research for several decades. The unsolved problem of interest is how to automatically please any audience without too much involvement of the said audience in the process of creation. Two-dimensional pictures have received a lot of attention however, 3D artwork has remained relatively unexplored. This paper introduces the Axial Generation Process (AGP), a versatile generation algorithm that can be employed to create both 2D and 3D items within the Concretism art style. A range of items generated through the AGP were evaluated against a set of formal aesthetic measures. This evaluation shows that the process is capable of generating visually varied items which generally exhibit a diverse range of values across the measures used, in both two and three dimensions.
Article
Full-text available
The ambient term in a renderer is a constant color added to all points yielding a crude global approximation to indirect lighting. Because the ambient term ignores geometric occlusion conditions, it is computationally inexpensive. We present an extended ambient term that provides better results than the constant term but is still inexpensive, because it also does not compute occlusion conditions. It is based on the idea of finding a six-sided axis-aligned environment which is similar in color and area to the real scene, and deriving an approximation to indirect lighting by computing interreflections in the simplified scene.
Article
Full-text available
Probabilistic models of floating point and logarithmic arithmetic are constructed using assumptions with both theoretical and empirical justification. The justification of these assumptions resolves open questions in Hamming (1970) and Bustoz et al. (1979). These models are applied to errors from sums and inner products. A comparison is made between the error analysis properties of floating point and logarithmic computers. We conclude that the logarithmic computer has smaller error confidence intervals for roundoff errors than a floating point computer with the same computer word size and approximately the same number range.
Article
Full-text available
A novel, view-independent technology produces natural-looking lighting effects faster than radiosity and ray tracing. The approach is suited for 3D real-time interactive applications and production rendering.
Article
This study introduces and describes digital and number tests that could be used by auditors as analytical procedures in the planning stages of the audit. The mathematical basis of the tests is Benford's Law, a property of tabulated numbers that provides the expected frequencies of the digits in tabulated data. Several empirical studies suggest that the digit patterns of authentic numbers should conform to the expected frequencies of Benford's Law. Thus, auditors could test the authenticity of lists of numbers by comparing the actual and expected digital frequencies. The results could assist auditors in determining the nature and extent of other audit procedures. Several tests are presented that examine data for conformity of the digital frequencies to Benford's Law, and a successful illustration at an oil company is described. Other case studies from practice illustrating the detection of suspect items are briefly presented.
Article
The gambler intent on beating the Massachusetts Numbers Game must cope with a 40% take of the state, gambler’s ruin, and regression to the mean. Preliminary estimates based on the first 851 plays of the lottery and assumptions of stability or linear trend and homoscedasticity (common standard deviation for all numbers) predicted that certain numbers would be profitable. Subsequent experience proved disappointing. A more elaborate model which assumes (1) that there is no basic shift in bettor preferences but that there is a gradual trend in payoffs and variability of payoffs for the first 720 games and stability thereafter, and (2) that the standard deviation of the payoff is proportional to the mean payoff for various numbers, leads to a new choice of desirable numbers. This new list is so short that variability and luck are very important in the short run. For the long run income tax rules make it more difficult for the system to be financially profitable. A final complication is that if the system were good and this became well known, the resulting popularity of the numbers constituting the system would destroy their value. More details appear in [1].
Article
In this paper it is shown that, under the assumption of the logarithmic distribution of numbers, floating-point addition and subtraction can result in overflow or underflow with alarming frequency—a frequency that increases rapidly with machine speed unless the range of the exponent is also increased. If numbers are assumed to be distributed in accordance with Sweeney's (1965) experiments, then severe loss of significance occurs with large probability in floating point subtraction. These results have implications for computer design and lead to the suggestion of a long word format which will reduce the risks to acceptable levels.
Article
The history, empirical evidence and classical explanations of the significant-digit (or Benford's) law are reviewed, followed by a summary of recent invariant-measure characterizations. Then a new statistical derivation of the law in the form of a CLT-like theorem for significant digits is presented. If distributions are selected at random (in any "unbiased" way) and random samples are then taken from each of these distributions, the significant digits of the combines sample will converge to the logarithmic (Benford) distribution. This helps explain and predict the appearance of the significant0digit phenomenon in many different empirical contexts and helps justify its recent application to computer design, mathematical modeling and detection of fraud in accounting data.
The restoration of images is an important and widely studied problem in computer vision and image processing. Various image filtering strategies have been effective, but invariably make strong assumptions about the properties of the signal and/or degradation. Therefore, these methods typically lack the generality to be easily applied to new applications or diverse image collections. This paper describes a novel unsupervised, information-theoretic, adaptive filter (UINTA) that improves the predictability of pixel intensities from their neighborhoods by decreasing the joint entropy between them. Thus UINTA automatically discovers the statistical properties of the signal and can thereby restore a wide spectrum of images and applications. This paper describes the formulation required to minimize the joint entropy measure, presents several important practical considerations in estimating image-region statistics, and then presents results on both real and synthetic data.