Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

On the Dynamism of Paintings Through the Distribution of Edge Directions

View through CrossRef
The digitization of artworks has recently offered new computational perspectives on the study of art history. While much of the focus has been on classifying styles or identifying objects, the analysis of more abstract concepts, such as the perception of motion or dynamism in still images, remains largely unexplored. Semioticians and artists have long explored the representation of dynamism in still images, but they often did so through theoretical frameworks or visual techniques, without a quantitative approach to measuring it. This paper proposes a method for computing and comparing the dynamism of paintings through edge detection. Our approach is based on the idea that the dynamism of a painting can be quantified by analyzing the edges in the image, whose distribution can be used to identify patterns and trends across artists and movements. We demonstrate the applicability of our method in three key areas: studying the temporal evolution of dynamism across different artistic styles, as well as within the works of a single artist (Wassily Kandinsky), visualizing and clustering a large database of abstract paintings through PixPlot, and retrieving similarly dynamic images. We show that the dynamism of a painting can be effectively quantified and visualized using edge detection techniques, providing new insights into the study of visual culture.
Title: On the Dynamism of Paintings Through the Distribution of Edge Directions
Description:
The digitization of artworks has recently offered new computational perspectives on the study of art history.
While much of the focus has been on classifying styles or identifying objects, the analysis of more abstract concepts, such as the perception of motion or dynamism in still images, remains largely unexplored.
Semioticians and artists have long explored the representation of dynamism in still images, but they often did so through theoretical frameworks or visual techniques, without a quantitative approach to measuring it.
This paper proposes a method for computing and comparing the dynamism of paintings through edge detection.
Our approach is based on the idea that the dynamism of a painting can be quantified by analyzing the edges in the image, whose distribution can be used to identify patterns and trends across artists and movements.
We demonstrate the applicability of our method in three key areas: studying the temporal evolution of dynamism across different artistic styles, as well as within the works of a single artist (Wassily Kandinsky), visualizing and clustering a large database of abstract paintings through PixPlot, and retrieving similarly dynamic images.
We show that the dynamism of a painting can be effectively quantified and visualized using edge detection techniques, providing new insights into the study of visual culture.

Related Results

THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e –...
The upper connected edge geodetic number of a graph
The upper connected edge geodetic number of a graph
For a non-trivial connected graph G, a set S ? V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The...
Geo‐information mapping improves Canny edge detection method
Geo‐information mapping improves Canny edge detection method
AbstractAiming at the shortcomings of the current Canny edge detection method in terms of noise removal, threshold setting, and edge recognition, this paper proposes a method for i...
The edge-to-edge geodetic domination number of a graph
The edge-to-edge geodetic domination number of a graph
Let G = (V, E) be a connected graph with at least three vertices. A set S Í E is called an edge-to-edge geodetic dominating set of G if S is both an edge-to-edge geodetic set of G ...
The Edge of Chaos
The Edge of Chaos
<p><b>Wellington was founded on a diverse ecosystem junction. In 1840, 625 hectares of land surrounding the city centre was set aside by The New Zealand Company to be p...
User Experience Oriented Edge Server Placement
User Experience Oriented Edge Server Placement
Abstract Edge computing holds promising prospects and addresses certain limitations of cloud computing. In the realm of edge computing, service providers deploy edge server...
2-Edge Connectivity in Directed Graphs
2-Edge Connectivity in Directed Graphs
Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly, not much has been inv...
“Un estudio multimodal y dinámico de los conocimientos numéricos de estudiantes de primer grado”
“Un estudio multimodal y dinámico de los conocimientos numéricos de estudiantes de primer grado”
En esta tesis profundizamos el estudio de la cognición y comunicación numérica de niños y niñas de primeros grados de la escuela primaria en la zona andina rionegrina. Desde un enf...

Back to Top