Internet for Image Searching

"Internet for Image Searching" is a free online tutorial to help staff and students in universities and colleges to find digital images for their learning and teaching. The emphasis of the tutorial is on finding copyright cleared images which are available free; facilitating quick, hassle-free access to a vast range of online photographs and other visual resources. "This tutorial is an excellent resource for anyone needing to know more about where and how to find images online. The fact that it concentrates on copyright cleared images will make it even more valuable for busy learning and teaching professionals, researchers and students alike. It will also serve to inspire confidence in those needing to use images from the web in their work." (Sharon Waller of the Higher Education Academy).

CV workshop - Projecting a professional image

Slides and activity sheets to accompany a set of practical workshop activities which help participants identify some of their individual skills, as the basis for a future coursework to produce a CV

Intute tutorial on image searching

Would you like to learn how to use the Internet to find copyright cleared images for your work, quickly and efficiently?

JISC Digital media internet for image searching

This webpage provides links to image banks and sources of photos which are usable for educational purposes.

Performance Tuning Burger King's Brand Image

Advertising Design Management's Presentation - Burger King

Projecting a professional image

Talk given by Diana Fitch from Careers Destinations, for COMP1205.

Le français par l'image : propuestas didácticas de utilización del vídeo en el aula. 'El francés por la imagen'.

Se ofrece material didáctico audiovisual para la enseñanza de la lengua francesa para ser utilizado en el aula. Está organizado en 15 propuestas didácticas. Incluye ficha pedagógica y ficha de trabajo.

King Cromwell? : a key stage 3 depth study.

Estudia la guerra civil desencadenada en el siglo XVII en Inglaterra y sus repercusiones sobre el sistema de gobierno del país, así como a uno de los personajes más controvertidos de la historia de Gran Bretaña, Oliver Cromwell. Cumple con los requisitos del currículo nacional inglés para la etapa de 3 de secundaria (key stage 3).Este texto esta preparado para el Schools History Project creado en 1972 para mejorar el estudio de la historia entre estudiantes de trece a dieciséis años. Reconsidera las formas en que la historia contribuye a las necesidades educativas de los jóvenes, y por ello idea nuevos objetivos, nuevos criterios para la planificación y desarrollo del curso, así como nuevos materiales de apoyo. Requiere nuevos criterios de evaluación y, por tanto nuevos exámenes y, adquirió mayor expansión con la introducción del General Certificate of Secondary Education (GCSE) en 1987.

OCR British depth study, 1939-1975.

Su contenido ha sido aprobado por el organismo Oxford Cambridge and RSA Examinations (OCR) para obtener el título de General Certificate Secondary Education (GCSE) en la especificación de Historia del mundo moderno. Está dividido en tres partes que proporcionan asesoramiento para enfocar el examen; los conocimientos contextuales para trabajar con las fuentes en los temas propuestos y, por último, modelos de examen para investigar sobre las fuentes.

OCR British depth study 1890-1918.

Libro de texto para la asignatura Historia del Mundo Moderno de enseñanza secundaria de segundo ciclo, según la especificación del OCR (Oxford Cambridge and RSA Examinations). Está estructurado en tres partes: una introducción sobre el uso del libro y consejos para realizar el examen oficial; una sección con los temas clave (reformas liberales de bienestar 1906-1912, sufragio femenino 1900-1918, frente civil británico durante la Primera Guerra Mundial 1914-1918); y un apartado con seis juegos de preguntas de desarrollo tipo examen.

Compression-based Image Registration

Image registration is an important component of image analysis used to align two or more images. In this paper, we present a new framework for image registration based on compression. The basic idea underlying our approach is the conjecture that two images are correctly registered when we can maximally compress one image given the information in the other. The contribution of this paper is twofold. First, we show that the image registration process can be dealt with from the perspective of a compression problem. Second, we demonstrate that the similarity metric, introduced by Li et al., performs well in image registration. Two different versions of the similarity metric have been used: the Kolmogorov version, computed using standard real-world compressors, and the Shannon version, calculated from an estimation of the entropy rate of the images

Medical image registration based on random line sampling

One of the key aspects in 3D-image registration is the computation of the joint intensity histogram. We propose a new approach to compute this histogram using uniformly distributed random lines to sample stochastically the overlapping volume between two 3D-images. The intensity values are captured from the lines at evenly spaced positions, taking an initial random offset different for each line. This method provides us with an accurate, robust and fast mutual information-based registration. The interpolation effects are drastically reduced, due to the stochastic nature of the line generation, and the alignment process is also accelerated. The results obtained show a better performance of the introduced method than the classic computation of the joint histogram

Image Segmentation Using Information Bottleneck Method

In image processing, segmentation algorithms constitute one of the main focuses of research. In this paper, new image segmentation algorithms based on a hard version of the information bottleneck method are presented. The objective of this method is to extract a compact representation of a variable, considered the input, with minimal loss of mutual information with respect to another variable, considered the output. First, we introduce a split-and-merge algorithm based on the definition of an information channel between a set of regions (input) of the image and the intensity histogram bins (output). From this channel, the maximization of the mutual information gain is used to optimize the image partitioning. Then, the merging process of the regions obtained in the previous phase is carried out by minimizing the loss of mutual information. From the inversion of the above channel, we also present a new histogram clustering algorithm based on the minimization of the mutual information loss, where now the input variable represents the histogram bins and the output is given by the set of regions obtained from the above split-and-merge algorithm. Finally, we introduce two new clustering algorithms which show how the information bottleneck method can be applied to the registration channel obtained when two multimodal images are correctly aligned. Different experiments on 2-D and 3-D images show the behavior of the proposed algorithms