In this thesis, detection of traffic signs is studied. Since, both color and shape properties of traffic signs are distinctive / these two properties have been employed for detection. Detection using color properties is studied in two different color domains in order to examine and compare the advantages and the disadvantages of these domains for detection purposes. In addition to their color information, shape information is also employed for detection purpose. Edge information (obtained by using the Sobel Operator) of the images/frames is considered as search domain to find triangular, rectangular, octagonal and circular traffic signs. In order to improve the performance of detection process a joint implementation of shape and color based algorithms is utilized. Two different methods have been used v in order to combine these two features. Both of the algorithms help reducing the number of pixels to check whether they belong to a sign or not. This, of course, reduces the processing time of detection process. Each utilized algorithm is tested and compared with the others by using both static images from different sources and video streams. Images having adverse properties are used in order to state algorithms response for some specific conditions such as bad illumination and shadow. After implementation, results show that joint implementation of the color and shape based detection algorithms produces more accurate results. Moreover, joint implementation reduces the processing time of the detection process when compared to application of algorithms individually since it diminishes the search domain.

Stereocomplex poly(methyl methacrylate) (PMMA) fibers for the purpose of reinforcing PMMA materials were developed. These kinds of composites are known as "self-reinforced" composites. We were successful in producing stereocomplex PMMA fibers with three different methods - wet spinning, gel spinning and electrospinning. Gel spinning and electrospinning produced the most crystalline fibers. Steroecomplex PMMA fibers were further shown to be resistant to high temperature and also to hot monomer solvent during bulk polymerization. We further describe our efforts in characterization, replication and mimicry of structural color features of butterflies and beetles. We have developed a simple method of characterizing the bidirectional reflectance distribution function of microscopic objects such as butterfly wing scales. We used this method to characterize nanometer sized structural color features resulting from the replication of butterfly Morpho rhetenor, mimickry of butterfly Papilio palinurus and also the native structural color features of iridescent beetle Chrysina gloriosa, which were shown to be cholesteric focal conic defects lined on the surface.

Selecting one color can be done with relative ease, but this task becomes more difficult with each subsequent color. Colormoo is an online tool aimed at solving this problem. We implement three algorithms for generating color palettes based off of a starting color. Data is collected for each palette that is generated. Our analysis reveals two of the algorithms are preferred, but under different circumstances. Furthermore, we find that users prefer palettes containing colors that are compatible, but not too similar. With refined heuristics, we believe these techniques can be extended and applied beyond the field of graphic design alone.

Tracking and understanding human gait is an important step towards improving elderly mobility and safety. This thesis presents a vision-based tracking system that estimates the 3D pose of a wheeled walker user's lower limbs with cameras mounted on the moving walker. The tracker estimates 3D poses from images of the lower limbs in the coronal plane in a dynamic, uncontrolled environment. It employs a probabilistic approach based on particle filtering with three different camera setups: a monocular RGB camera, binocular RGB cameras, and a depth camera. For the RGB cameras, observation likelihoods are designed to compare the colors and gradients of each frame with initial templates that are manually extracted. Two strategies are also investigated for handling appearance change of tracking target: increasing number of templates and using different representations of colors. For the depth camera, two observation likelihoods are developed: the first one works directly in the 3D space, while the second one works in the projected image space. Experiments are conducted to evaluate the performance of the tracking system with different users for all three camera setups. It is demonstrated that the trackers with the RGB cameras produce results with higher error as compared to the depth camera, and the strategies for handling appearance change improve tracking accuracy in general. On the other hand, the tracker with the depth sensor successfully tracks the 3D poses of users over the entire video sequence and is robust against unfavorable conditions such as partial occlusion, missing observations, and deformable tracking target.

Recently, very large collections of images and videos have grown rapidly. In parallel with this growth, content-based retrieval and querying the indexed collections are required to access visual information. Three main components of the visual information are color, texture and shape. In this thesis, an XML based content-based image retrieval system is presented that combines three visual descriptors of MPEG-7 and measures similarity of images by applying a distance function. An XML database is used for storing these three descriptors. The system is also extended to support high dimensional indexing for efficient search and retrieval from its XML database. To do this, an index structure, called M-Tree, is implemented which uses weighted Euclidean distance function for similarity measure. Ordered Weighted Aggregation (OWA) operators are used to define the weights of the distance function and to combine three features&rsquo / distance functions into one. The system supports nearest neighbor queries and three types of fuzzy queries / feature-based, image-based and color-based queries. Also it is shown through experimental results and analysis of retrieval effectiveness of querying that the content-based retrieval system is effective in terms of retrieval and scalability.

In practice, graphs often occur as perturbed product structures, so-called approximate graph products. The practical application of the well-known prime factorization algorithms is therefore limited, since most graphs are prime, although they can have a product-like structure. This work is concerned with the strong graph product. Since strong product graphs G contain subgraphs that are itself products of subgraphs of the underlying factors of G, we follow the idea to develop local approaches that cover a graph by factorizable patches and then use this information to derive the global factors. First, we investigate the local structure of strong product graphs and introduce the backbone B(G) of a graph G and the so-called S1-condition. Both concepts play a central role for determining the prime factors of a strong product graph in a unique way. Then, we discuss several graph classes, in detail, NICE, CHIC and locally unrefined graphs. For each class we construct local, quasi-linear time prime factorization algorithms. Combining these results, we then derive a new local prime factorization algorithm for all graphs. Finally, we discuss approximate graph products. We use the new local factorization algorithm to derive a method for the recognition of approximate graph products. Furthermore, we evaluate the performance of this algorithm on a sample of approximate graph products.

To reduce cost, many digital cameras use a single sensor array instead of using three arrays for the red, green and blue. Thus at each pixel location only the red, green or blue intensity value is available. And to generate a complete color image, the camera must estimate the missing two values at each pixel location .Color filter arrays are used to capture only one portion of the spectrum (Red, Green or Blue) at each location. Various arrangements of the Color Filter Array (CFA) are possible, but the Bayer array is the most commonly used arrangement and we will deal exclusively with the Bayer array in this thesis. Since each of the three colors channels are effectively downsampled, it leads to aliasing artifacts. This thesis will analyze the effects of aliasing in the frequency- domain and present a method to reduce the deterioration in image quality due to aliasing artifacts. Two reference algorithms, AH-POCS (Adams and Hamilton - Projection Onto Convex Sets) and Adaptive Homogeneity-Directed interpolation, are discussed in de- tail. Both algorithms use the assumption that there is high correlation in the high- frequency regions to reduce aliasing. AH-POCS uses alias cancellation technique to reduce aliasing in the red and blue images, while the Adaptive Homogeneity-Directed interpolation algorithm is an edge-directed algorithm. We present here an algorithm that combines these two techniques and provides a better result on average when compared to the reference algorithms.

Freie Univ., Diss.--Berlin, 2002. / Literaturverz. S. 267 - 286.

Content-based retrieval of multimedia data has been still an active research area. The efficient retrieval of video data is proven a difficult task for content-based video retrieval systems. In this thesis study, a Content-Based Video Retrieval (CBVR) system that adapts two different index structures, namely Slim-Tree and BitMatrix, for efficiently retrieving videos based on low-level features such as color, texture, shape and motion is presented. The system represents low-level features of video data with MPEG-7 Descriptors extracted from video shots by using MPEG-7 reference software and stored in a native XML database. The low-level descriptors used in the study are Color Layout (CL), Dominant Color (DC), Edge Histogram (EH), Region Shape (RS) and Motion Activity (MA). Ordered Weighted Averaging (OWA) operator in Slim-Tree and BitMatrix aggregates these features to find final similarity between any two objects. The system supports three different types of queries: exact match queries, k-NN queries and range queries. The experiments included in this study are in terms of index construction, index update, query response time and retrieval efficiency using ANMRR performance metric and precision/recall scores. The experimental results show that using BitMatrix along with Ordered Weighted Averaging method is superior in content-based video retrieval systems.

No description available.