Daniel Kim

h-index8
2papers
392citations

2 Papers

3.1CVJan 25, 2017
Historic Emergence of Diversity in Painting: Heterogeneity in Chromatic Distance in Images and Characterization of Massive Painting Data Set

Byunghwee Lee, Daniel Kim, Seunghye Sun et al.

Painting is an art form that has long functioned as a major channel for the creative expression and communication of humans, its evolution taking place under an interplay with the science, technology, and social environments of the times. Therefore, understanding the process based on comprehensive data could shed light on how humans acted and manifested creatively under changing conditions. Yet, there exist few systematic frameworks that characterize the process for painting, which would require robust statistical methods for defining painting characteristics and identifying human's creative developments, and data of high quality and sufficient quantity. Here we propose that the color contrast of a painting image signifying the heterogeneity in inter-pixel chromatic distance can be a useful representation of its style, integrating both the color and geometry. From the color contrasts of paintings from a large-scale, comprehensive archive of 179,853 high-quality images spanning several centuries we characterize the temporal evolutionary patterns of paintings, and present a deep study of an extraordinary expansion in creative diversity and individuality that came to define the modern era.

1.2STAT-MECHJul 2, 2012
Fundamental Structural Constraint of Random Scale-Free Networks

Yongjoo Baek, Daniel Kim, Meesoon Ha et al.

We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $γ$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality transitions proposed by [Del Genio and co-workers, Phys. Rev. Lett. {\bf 107}, 178701 (2011)], while making it more rigorous and applicable to general values of kc. Using the graphicality criterion, we show that the upper cutoff must be lower than $k_c N^{1/γ}$ for $γ< 2$, whereas any upper cutoff is allowed for $γ> 2$. This result is also numerically verified by both the random and deterministic sampling of degree sequences.