A system to communicate hidden information using color images

The objective of this paper is to present a system to communicate hidden information among different users by means of images. The tasks that the system is able to carry on can be divided in two different groups of utilities, implemented in java. The first group of utilities are related with the possibility to hide information in color images, using a steganographic function based on the least significant bit (LSB) methods. The second group of utilities allows us to communicate with other users with the aim to send or receive images, where some information have been previously embedded. Thus, this is the most significant characteristic of the implementation, we have built an environment where we join the email capabilities to send and receive text and images as attached files, with the main objective of hiding information.

An exercises editor for an e-learning environment

One of the most important tenets of e-learning is that it bridges work and learning. A great e-learning experience brings learning into the work environment. This is a key point, the capacity to construct a work environment when the student can develop proper tasks to complete the learning process. This paper describes a work environment based on the development of two tools, an exercises editor and an exercises viewer. Both tools are able to manage color images where, because of the implementation of basic steganographic techniques, it is possible to add information, exercises, questions, and so on. The exercises editor allows to decide which information must be visible or remain hidden to the user, when the image is loaded in the exercises viewer. Therefore, it is possible to hide the solutions of the proposed tasks; this is very useful to complete a self-evaluation learning process. These tools constitute a learning architecture with the final objective that learners can apply and practice new concepts or skills.

Image Noise Removal on Heterogeneous CPU-GPU Configurations

A parallel algorithm to remove impulsive noise in digital images using heterogeneous CPU/GPU computing is proposed. The parallel denoising algorithm is based on the peer group concept and uses an Euclidean metric. In order to identify the amount of pixels to be allocated in multi-core and GPUs, a performance analysis using large images is presented. A comparison of the parallel implementation in multi-core, GPUs and a combination of both is performed. Performance has been evaluated in terms of execution time and Megapixels/second. We present several optimization strategies especially effective for the multi-core environment, and demonstrate significant performance improvements. The main advantage of the proposed noise removal methodology is its computational speed, which enables efficient filtering of color images in real-time applications.

New galactic star clusters discovered in the VVV survey. Candidates projected on the inner disk and bulge

Context. VISTA Variables in the Vía Láctea (VVV) is one of six ESO Public Surveys using the 4 meter Visible and Infrared Survey Telescope for Astronomy (VISTA). The VVV survey covers the Milky Way bulge and an adjacent section of the disk, and one of the principal objectives is to search for new star clusters within previously unreachable obscured parts of the Galaxy. Aims. The primary motivation behind this work is to discover and analyze obscured star clusters in the direction of the inner Galactic disk and bulge. Methods. Regions of the inner disk and bulge covered by the VVV survey were visually inspected using composite JHKS color images to select new cluster candidates on the basis of apparent overdensities. DR1, DR2, CASU, and point spread function photometry of 10 × 10 arcmin fields centered on each candidate cluster were used to construct color–magnitude and color–color diagrams. Follow-up spectroscopy of the brightest members of several cluster candidates was obtained in order to clarify their nature. Results. We report the discovery of 58 new infrared cluster candidates. Fundamental parameters such as age, distance, and metallicity were determined for 20 of the most populous clusters.

Topological SLAM using a graph-matching based method on omnidirectional images

Comunicación presentada en el XI Workshop of Physical Agents, Valencia, 9-10 septiembre 2010.

An algorithm to hide information in binary images

The objective of this paper is to develop a method to hide information inside a binary image. An algorithm to embed data in scanned text or figures is proposed, based on the detection of suitable pixels, which verify some conditions in order to be not detected. In broad terms, the algorithm locates those pixels placed at the contours of the figures or in those areas where some scattering of the two colors can be found. The hidden information is independent from the values of the pixels where this information is embedded. Notice that, depending on the sequence of bits to be hidden, around half of the used pixels to keep bits of data will not be modified. The other basic characteristic of the proposed scheme is that it is necessary to take into consideration the bits that are modified, in order to perform the recovering process of the information, which consists on recovering the sequence of bits placed in the proper positions. An application to banking sector is proposed for hidding some information in signatures.

Trajectory-Based Morphological Operators: A Model for Efficient Image Processing

Mathematical morphology has been an area of intensive research over the last few years. Although many remarkable advances have been achieved throughout these years, there is still a great interest in accelerating morphological operations in order for them to be implemented in real-time systems. In this work, we present a new model for computing mathematical morphology operations, the so-called morphological trajectory model (MTM), in which a morphological filter will be divided into a sequence of basic operations. Then, a trajectory-based morphological operation (such as dilation, and erosion) is defined as the set of points resulting from the ordered application of the instant basic operations. The MTM approach allows working with different structuring elements, such as disks, and from the experiments, it can be extracted that our method is independent of the structuring element size and can be easily applied to industrial systems and high-resolution images.

3D reconstruction of medical images from slices automatically landmarked with growing neural models

In this study, we utilise a novel approach to segment out the ventricular system in a series of high resolution T1-weighted MR images. We present a brain ventricles fast reconstruction method. The method is based on the processing of brain sections and establishing a fixed number of landmarks onto those sections to reconstruct the ventricles 3D surface. Automated landmark extraction is accomplished through the use of the self-organising network, the growing neural gas (GNG), which is able to topographically map the low dimensionality of the network to the high dimensionality of the contour manifold without requiring a priori knowledge of the input space structure. Moreover, our GNG landmark method is tolerant to noise and eliminates outliers. Our method accelerates the classical surface reconstruction and filtering processes. The proposed method offers higher accuracy compared to methods with similar efficiency as Voxel Grid.

Adjustable compression method for still JPEG images

There are a large number of image processing applications that work with different performance requirements and available resources. Recent advances in image compression focus on reducing image size and processing time, but offer no real-time solutions for providing time/quality flexibility of the resulting image, such as using them to transmit the image contents of web pages. In this paper we propose a method for encoding still images based on the JPEG standard that allows the compression/decompression time cost and image quality to be adjusted to the needs of each application and to the bandwidth conditions of the network. The real-time control is based on a collection of adjustable parameters relating both to aspects of implementation and to the hardware with which the algorithm is processed. The proposed encoding system is evaluated in terms of compression ratio, processing delay and quality of the compressed image when compared with the standard method.