Scott Allen Burns
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Scott Allen Burns has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Chung-Wei Feng
Associate Member, ASCE
5 shared publicationsLiang Liu
Associate Member, ASCE
5 shared publicationsMin Liu
Department of Civil, Environmental, and Architectural Engineering, University of Colorado at Boulder, Campus Box 428, Boulder, CO 80309, U.S.A.
5 shared publicationsJulian I. Palmore
4 shared publicationsHarold E. Benzinger
Department of Mathematics, University of Illinois, 1409 West Green Street, Urbana, IL 61801, U.S.A.
3 shared publicationsKeith M. Mueller
Senior Staff Engineer, American Institute of Steel Construction, One East Wacker Dr., Suite 3100, Chicago, IL 60601
3 shared publications
Latest Publications
- 24 May 2021
- Published by Wiley in Color Research & Application
- Vol. 46 (6) , 1180-1193
The location of optimal object colors with more than two transitions
The chromaticity diagram associated with the 1931 2° CIE color‐matching functions is shown to be slightly non‐convex. While having no impact on practical colorimetric computations, the non‐convexity does have a significant impact on the shape of some optimal object color reflectance distributions located on the outer surface of the object color solid. Instead of the usual two‐transition Schrödinger form, many optimal colors exhibit higher transition counts. A linear programming formulation is developed and is used to locate where these higher‐transition optimal object colors reside on the object color solid surface. The regions of higher‐transition count appear to have a point‐symmetric, complementary structure. The high‐transition behavior is shown to be largely absent in more modern color‐matching functions, such as the recent “physiologically‐relevant” color‐matching functions transformed from cone fundamentals.
- 24 May 2021
- Published by Wiley in Color Research & Application
- Vol. 46 (6) , 1180-1193
The location of optimal object colors with more than two transitions
The chromaticity diagram associated with the 1931 2° CIE color‐matching functions is shown to be slightly non‐convex. While having no impact on practical colorimetric computations, the non‐convexity does have a significant impact on the shape of some optimal object color reflectance distributions located on the outer surface of the object color solid. Instead of the usual two‐transition Schrödinger form, many optimal colors exhibit higher transition counts. A linear programming formulation is developed and is used to locate where these higher‐transition optimal object colors reside on the object color solid surface. The regions of higher‐transition count appear to have a point‐symmetric, complementary structure. The high‐transition behavior is shown to be largely absent in more modern color‐matching functions, such as the recent “physiologically‐relevant” color‐matching functions transformed from cone fundamentals.
- Open Access
The Location of Optimal Object Colors with More Than Two Transitions (Preprint)
The chromaticity diagram associated with the CIE 1931 color matching functions is shown to be slightly non-convex. While having no impact on practical colorimetric computations, the non-convexity does have a significant impact on the shape of some optimal object color reflectance distributions associated with the outer surface of the object color solid. Instead of the usual two-transition Schrodinger form, many optimal colors exhibit higher transition counts. A linear programming formulation is developed and is used to locate where these higher-transition optimal object colors reside on the object color solid surface. The regions of higher transition count appear to have a point-symmetric complementary structure. The final peer-reviewed version (to appear) contains additional material concerning convexification of the color-matching functions and and additional analysis of modern "physiologically-relevant" CMFs transformed from cone fundamentals.
Open AccessThe Location of Optimal Object Colors with More Than Two Transitions (Preprint)
The chromaticity diagram associated with the CIE 1931 color matching functions is shown to be slightly non-convex. While having no impact on practical colorimetric computations, the non-convexity does have a significant impact on the shape of some optimal object color reflectance distributions associated with the outer surface of the object color solid. Instead of the usual two-transition Schrodinger form, many optimal colors exhibit higher transition counts. A linear programming formulation is developed and is used to locate where these higher-transition optimal object colors reside on the object color solid surface. The regions of higher transition count appear to have a point-symmetric complementary structure. The final peer-reviewed version (to appear) contains additional material concerning convexification of the color-matching functions and and additional analysis of modern "physiologically-relevant" CMFs transformed from cone fundamentals.
- Open Access
Generating Reflectance Curves from sRGB Triplets
The color sensation evoked by an object depends on both the spectral power distribution of the illumination and the reflectance properties of the object being illuminated. The color sensation can be characterized by three color-space values, such as XYZ, RGB, HSV, L*a*b*, etc. It is straightforward to compute the three values given the illuminant and reflectance curves. The converse process of computing a reflectance curve given the color-space values and the illuminant is complicated by the fact that an infinite number of different reflectance curves can give rise to a single set of color-space values (metamerism). This paper presents five algorithms for generating a reflectance curve from a specified sRGB triplet, written for a general audience. The algorithms are designed to generate reflectance curves that are similar to those found with naturally occurring colored objects. The computed reflectance curves are compared to a database of thousands of reflectance curves measured from paints and pigments available both commercially and in nature, and the similarity is quantified. One particularly useful application of these algorithms is in the field of computer graphics, where modeling color transformations sometimes requires wavelength-specific information, such as when modeling subtractive color mixture.
Open AccessGenerating Reflectance Curves from sRGB Triplets
The color sensation evoked by an object depends on both the spectral power distribution of the illumination and the reflectance properties of the object being illuminated. The color sensation can be characterized by three color-space values, such as XYZ, RGB, HSV, L*a*b*, etc. It is straightforward to compute the three values given the illuminant and reflectance curves. The converse process of computing a reflectance curve given the color-space values and the illuminant is complicated by the fact that an infinite number of different reflectance curves can give rise to a single set of color-space values (metamerism). This paper presents five algorithms for generating a reflectance curve from a specified sRGB triplet, written for a general audience. The algorithms are designed to generate reflectance curves that are similar to those found with naturally occurring colored objects. The computed reflectance curves are compared to a database of thousands of reflectance curves measured from paints and pigments available both commercially and in nature, and the similarity is quantified. One particularly useful application of these algorithms is in the field of computer graphics, where modeling color transformations sometimes requires wavelength-specific information, such as when modeling subtractive color mixture.
- 1 November 2019
- Published by Wiley in Color Research & Application
- Vol. 45 (1) , 8-21
Numerical methods for smoothest reflectance reconstruction
Three numerical methods are presented for finding the smoothest reflectance curve associated with a given triplet of tristimulus values. The methods differ in how “smooth” is defined, and also differ in the domain of colors over which they are applicable. The first method is very quick and applies to any tristimulus values, but sometimes can yield reflectance curves with portions that fall outside the range 0 to 1. The second method applies to colors within the spectral locus (real colors) and guarantees that the reflectances produced are positive. The third method applies to colors within the object color solid (object colors) and guarantees that the reflectances fall within the range 0 to 1. The methods are shown to create reflectances that closely resemble those of real colors (natural and synthetic). Focus is given to implementing the numerical methods in very short MATLAB/Octave functions and to understanding the numerical behavior of the methods near the limits of their respective domains of applicability in terms of matrix conditioning and discretization artifacts.
- 1 November 2019
- Published by Wiley in Color Research & Application
- Vol. 45 (1) , 8-21
Numerical methods for smoothest reflectance reconstruction
Three numerical methods are presented for finding the smoothest reflectance curve associated with a given triplet of tristimulus values. The methods differ in how “smooth” is defined, and also differ in the domain of colors over which they are applicable. The first method is very quick and applies to any tristimulus values, but sometimes can yield reflectance curves with portions that fall outside the range 0 to 1. The second method applies to colors within the spectral locus (real colors) and guarantees that the reflectances produced are positive. The third method applies to colors within the object color solid (object colors) and guarantees that the reflectances fall within the range 0 to 1. The methods are shown to create reflectances that closely resemble those of real colors (natural and synthetic). Focus is given to implementing the numerical methods in very short MATLAB/Octave functions and to understanding the numerical behavior of the methods near the limits of their respective domains of applicability in terms of matrix conditioning and discretization artifacts.
- Open Access
Chromatic Adaptation Transform by Spectral Reconstruction (Preprint)
A color appearance model (CAM) is an advanced colorimetric tool used to predict color appearance under a wide variety of viewing conditions. A chromatic adaptation transform (CAT) is an integral part of a CAM. Its role is to predict "corresponding colors," that is, a pair of colors that have the same color appearance when viewed under different illuminants, after partial or full adaptation to each illuminant. Modern CATs perform well when applied to a limited range of illuminant pairs and a limited range of source (test) colors. However, they can fail if operated outside these ranges. For imaging applications, it is important to have a CAT that can operate on any real color and illuminant pair without failure. This paper proposes a new CAT that does not operate on the standard von Kries model of adaptation. Instead it relies on spectral reconstruction and how these reconstructions behave with respect to different illuminants. It is demonstrated that the proposed CAT is immune to some of the limitations of existing CATs (such as producing colors with negative tristimulus values). The proposed CAT does not use established empirical corresponding-color datasets to optimize performance, as most modern CATs do, yet it performs as well as or better than the most recent CATs when tested against the corresponding-color datasets. This increase in robustness comes at the expense of additional complexity and computational effort. If robustness is of prime importance, then the proposed method may be justifiable.
Open AccessChromatic Adaptation Transform by Spectral Reconstruction (Preprint)
A color appearance model (CAM) is an advanced colorimetric tool used to predict color appearance under a wide variety of viewing conditions. A chromatic adaptation transform (CAT) is an integral part of a CAM. Its role is to predict "corresponding colors," that is, a pair of colors that have the same color appearance when viewed under different illuminants, after partial or full adaptation to each illuminant. Modern CATs perform well when applied to a limited range of illuminant pairs and a limited range of source (test) colors. However, they can fail if operated outside these ranges. For imaging applications, it is important to have a CAT that can operate on any real color and illuminant pair without failure. This paper proposes a new CAT that does not operate on the standard von Kries model of adaptation. Instead it relies on spectral reconstruction and how these reconstructions behave with respect to different illuminants. It is demonstrated that the proposed CAT is immune to some of the limitations of existing CATs (such as producing colors with negative tristimulus values). The proposed CAT does not use established empirical corresponding-color datasets to optimize performance, as most modern CATs do, yet it performs as well as or better than the most recent CATs when tested against the corresponding-color datasets. This increase in robustness comes at the expense of additional complexity and computational effort. If robustness is of prime importance, then the proposed method may be justifiable.
- 29 May 2019
- Published by Wiley in Color Research & Application
- Vol. 44 (5) , 682-693
Chromatic adaptation transform by spectral reconstruction
A color appearance model (CAM) is an advanced colorimetric tool used to predict color appearance under a wide variety of viewing conditions. A chromatic adaptation transform (CAT) is an integral part of a CAM. Its role is to predict “corresponding colors,” that is, a pair of colors that have the same color appearance when viewed under different illuminants, after partial or full adaptation to each illuminant. Modern CATs can sometimes generate colors with negative tristimulus values. For some imaging applications, it is important to maintain positive tristimulus values when applying a CAT. This article proposes a new CAT that does not operate on the standard von Kries model of adaptation. Instead, it uses a spectral reconstruction technique as an intermediate stage in the process, while still requiring only tristimulus values as inputs. It is demonstrated that the proposed CAT will not generate colors outside the spectral locus or colors with negative tristimulus values. The proposed CAT does not use established empirical corresponding‐colors data sets to optimize performance, as most modern CATs do, yet it performs as well as or better than the most recent CATs when tested against the data sets of corresponding colors.
- 29 May 2019
- Published by Wiley in Color Research & Application
- Vol. 44 (5) , 682-693
Chromatic adaptation transform by spectral reconstruction
A color appearance model (CAM) is an advanced colorimetric tool used to predict color appearance under a wide variety of viewing conditions. A chromatic adaptation transform (CAT) is an integral part of a CAM. Its role is to predict “corresponding colors,” that is, a pair of colors that have the same color appearance when viewed under different illuminants, after partial or full adaptation to each illuminant. Modern CATs can sometimes generate colors with negative tristimulus values. For some imaging applications, it is important to maintain positive tristimulus values when applying a CAT. This article proposes a new CAT that does not operate on the standard von Kries model of adaptation. Instead, it uses a spectral reconstruction technique as an intermediate stage in the process, while still requiring only tristimulus values as inputs. It is demonstrated that the proposed CAT will not generate colors outside the spectral locus or colors with negative tristimulus values. The proposed CAT does not use established empirical corresponding‐colors data sets to optimize performance, as most modern CATs do, yet it performs as well as or better than the most recent CATs when tested against the data sets of corresponding colors.
- 1 September 2016
- Published by Elsevier in Manual Therapy
- Vol. 25, e50-e51
Examination of a clinical prediction rule to identify patients with shoulder pain likely to benefit from cervicothoracic manipulation: A multi-center randomized clinical trial
- 1 September 2016
- Published by Elsevier in Manual Therapy
- Vol. 25, e50-e51
Examination of a clinical prediction rule to identify patients with shoulder pain likely to benefit from cervicothoracic manipulation: A multi-center randomized clinical trial
- 1 January 2006
- Published by American Society of Civil Engineers (ASCE) in Journal of Structural Engineering
- Vol. 132 (1) , 50-58
Genetic Algorithm Based Construction-Conscious Minimum Weight Design of Seismic Steel Moment-Resisting Frames
The minimum weight criterion, which has been widely adopted in the literature for optimal design of steel structural systems, is inadequate to fully reflect the initial monetary investment due to lack of consideration of additional construction expenses resulting from varied degree of design complexity such as different member sections and splice/connection types. In this paper, design optimization of seismic steel moment-resisting frames involves simultaneous consideration of two competing objective functions: the steel material weight and an approximate measure of design complexity in terms of the number of different standard steel member section types. The code-compliant seismic structural design follows the equivalent lateral force procedure of the 2000 National Earthquake Hazards Reduction Program seismic provisions in conjunction with American Institute of Steel Construction load resistance factor design seismic steel design criteria. A genetic algorithm is used for the posed biobjective structural optimization problem to produce a set of alternative designs establishing optimized trade-off between the two merit objectives. Numerical examples show that a minimum weight design with a balanced degree of design complexity is expected to achieve an initial investment economy with more accuracy.
- 1 January 2006
- Published by American Society of Civil Engineers (ASCE) in Journal of Structural Engineering
- Vol. 132 (1) , 50-58
Genetic Algorithm Based Construction-Conscious Minimum Weight Design of Seismic Steel Moment-Resisting Frames
The minimum weight criterion, which has been widely adopted in the literature for optimal design of steel structural systems, is inadequate to fully reflect the initial monetary investment due to lack of consideration of additional construction expenses resulting from varied degree of design complexity such as different member sections and splice/connection types. In this paper, design optimization of seismic steel moment-resisting frames involves simultaneous consideration of two competing objective functions: the steel material weight and an approximate measure of design complexity in terms of the number of different standard steel member section types. The code-compliant seismic structural design follows the equivalent lateral force procedure of the 2000 National Earthquake Hazards Reduction Program seismic provisions in conjunction with American Institute of Steel Construction load resistance factor design seismic steel design criteria. A genetic algorithm is used for the posed biobjective structural optimization problem to produce a set of alternative designs establishing optimized trade-off between the two merit objectives. Numerical examples show that a minimum weight design with a balanced degree of design complexity is expected to achieve an initial investment economy with more accuracy.
- 15 December 2004
- Published by Wiley in Earthquake Engineering & Structural Dynamics
- Vol. 34 (3) , 289-306
Multiobjective optimization for performance‐based seismic design of steel moment frame structures
The performance‐based seismic design of steel special moment‐resisting frame (SMRF) structures is formulated as a multiobjective optimization problem, in which conflicting design criteria that respectively reflect the present capital investment and the future seismic risk are treated simultaneously as separate objectives other than stringent constraints. Specifically, the initial construction expenses are accounted for by the steel material weight as well as by the number of different standard steel section types, the latter roughly quantifying the degree of design complexity related additional construction cost; the seismic risk is considered in terms of maximum interstory drift demands at two hazard levels with exceedance probabilities being 50% and 2% in 50 years, respectively. The present formulation allows structural engineers to find an optimized design solution by explicitly striving for a desirable compromise between the initial investment and seismic performance. Member sizing for code‐compliant design of a planar five‐story four‐bay SMRF is presented as an application example using the proposed procedure that is automated by a multiobjective genetic algorithm. Copyright © 2004 John Wiley & Sons, Ltd.
- 15 December 2004
- Published by Wiley in Earthquake Engineering & Structural Dynamics
- Vol. 34 (3) , 289-306
Multiobjective optimization for performance‐based seismic design of steel moment frame structures
The performance‐based seismic design of steel special moment‐resisting frame (SMRF) structures is formulated as a multiobjective optimization problem, in which conflicting design criteria that respectively reflect the present capital investment and the future seismic risk are treated simultaneously as separate objectives other than stringent constraints. Specifically, the initial construction expenses are accounted for by the steel material weight as well as by the number of different standard steel section types, the latter roughly quantifying the degree of design complexity related additional construction cost; the seismic risk is considered in terms of maximum interstory drift demands at two hazard levels with exceedance probabilities being 50% and 2% in 50 years, respectively. The present formulation allows structural engineers to find an optimized design solution by explicitly striving for a desirable compromise between the initial investment and seismic performance. Member sizing for code‐compliant design of a planar five‐story four‐bay SMRF is presented as an application example using the proposed procedure that is automated by a multiobjective genetic algorithm. Copyright © 2004 John Wiley & Sons, Ltd.
- 1 August 2004
- Published by Elsevier in Engineering Structures
- Vol. 26 (10) , 1407-1421
Life cycle cost oriented seismic design optimization of steel moment frame structures with risk-taking preference
- 1 August 2004
- Published by Elsevier in Engineering Structures
- Vol. 26 (10) , 1407-1421
Life cycle cost oriented seismic design optimization of steel moment frame structures with risk-taking preference