Department of Computer Science

Permanent URI for this communityhttps://hdl.handle.net/10294/3192

The Department of Computer Science offers programs of study related to computing, information technology and software design and application. Our programs involve interdepartmental, multi-institutional and inter-institutional collaboration and have attracted faculty members, undergraduate and graduate students from all over the world. Students may pursue full-time or part-time study leading to a Certificate in Computer Science or to B.Sc., M.Sc., or Ph.D. degrees.

Browse

Browsing Department of Computer Science by Author "Hepting, Daryl H."

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Approximation and Visualization of Sets Defined by Iterated Function Systems
    (University of Regina, 1991-03) Hepting, Daryl H.
    An iterated function system (IFS) is defined to be a set of contractive affine transformations. When iterated, these transformations define a closed set, called the attractor of an IFS, which has fractal characteristics. Fractals of any sort are currently a topic of great popular appeal, largely due to the exciting images to which they lend themselves. Iterated function systems represent one of the newest sources of fractal images. Research to date has focused on exploiting IFS techniques for the generation of fractals and for use in modelling applications. Both areas of this research are well suited to computer graphics, and this thesis examine the IFS techniques from a computer graphics perspective. As a source of fractals, iterated function systems have some relationship to other methods of fractal generation. In particular, the relationship between IFS attractors and Julia sets will be examined throughout the thesis. Many insights can be gained from the previous work done by Peitgen, Richter and Saupe [32, 33] both in terms of methods for the generation of the fractal sets and methods for their visualization. The differences between the linear transformations which compose an IFS and the quadratic polynomials which define Julia sets are significant, but not moreso than their similarities. This thesis deals with the related questions of approximation and visualization. The method of constructing the approximating set of points is dependent upon the visualization method in use. Methods have been developed both to visualize the attractor and its complement. The two techniques used to examine the complement set are based on the distance and escape-time functions. The modelling power of standard IFS techniques is limited in that they cannot be used to model any object which is not strictly self-affine. To combat this, methods for controlling transformation application are examined which allow objects without strict self-affinity to be modelled. As part of this research, an extensible software system was developed to allow experimentation with the various concepts discussed. A description of that system is included in Chapter 6.
  • Thumbnail Image
    ItemOpen Access
    A Linear Model for Three-Way Analysis of Facial Similarity
    (Springer, Cham, 2018-05-18) Hepting, Daryl H.; Bin Amer, Hadeel Hatim; Yao, Yiyu
    Card sorting was used to gather information about facial similarity judgments. A group of raters put a set of facial photos into an unrestricted number of different piles according to each rater’s judgment of similarity. This paper proposes a linear model for 3-way analysis of similarity. An overall rating function is a weighted linear combination of ratings from individual raters. A pair of photos is considered to be similar, dissimilar, or divided, respectively, if the overall rating function is greater than or equal to a certain threshold, is less than or equal to another threshold, or is between the two thresholds. The proposed framework for 3-way analysis of similarity is complementary to studies of similarity based on features of photos.
  • Thumbnail Image
    ItemOpen Access
    Three-Way Analysis of Facial Similarity Judgments
    (2017-10-23) Hepting, Daryl H.; Bin Amer, Hadeel Hatim; Yao, Yiyu
    The card sorting problem involves the similarity judgments of pairs of photos, taken from a set of photos, by a group of participants. Given the lack of an objective standard for judging similarity, different participants may be using different strategies in judging the similarity of photos. It could be very useful to identify and study these strategies. In this paper, we present a framework for three-way analysis of judgments of similarity. Based on judgments by the set of participants, we divide all pairs of photos into three classes: a set of similar pairs that are judged by at least 60% of participants as similar; a set of dissimilar pairs that are judged by at least 60% of participants as dissimilar; and a set of undecidable pairs that have conflicting judgments. A more refined three-way classification method is also suggested based on a quantitative description of the quality of similarity judgments. The classification in terms of three classes provides an effective method to examine the notions of similarity, dissimilarity, and disagreement.