A Prototype for linear features generalization

A computer application designed to generalize linear elements in a vector formatted cartographic set by means of two of the most contrasted line generalization algorithms, Douglas-Peucker simplification and Bézier curves based smoothing, is presented in this paper. Regarding codification, the simultaneous treatment of different lineal geometry entity classes and the conservation of their original topological relationships among them are considered. It is recommended in processes that produce small scale reductions (in a 1:2 relationship or similar). The application allows changing the characteristic parameters of the referred algorithms and proposes a report of the results obtained after every transformation. That way it supplies an additional facility as a trial tool to choose the parameters that give the best results in every process

Artificial intelligence methodologies applied to quality control of the positioning services offered by the Red Andaluza de Posicionamiento (RAP) network

On April 26, 2012, Elena Giménez de Ory defend-ed her Ph.D. thesis at University of Jaén, entitled: “Robust methodologies applied to quality control of the positioning services offered by the Red Andaluza de Posicionamiento (RAP) network”. Elena Giménez de Ory defended her dissertation in a publicly open presentation held in the Higher Polytechnic School at the University of Jaén, and was able to comment on every question raised by her thesis committee and the audience. The thesis was supervised by her advisor, Prof. Antonio J. Gil Cruz, and the rest of his thesis committee, Prof. Manuel Sánchez de la Orden, Dr. Antonio Miguel Ruiz Armenteros and Dr. Gracia Rodríguez Caderot. The thesis has been read and approved by his thesis committee, receiving the highest rating. All of them were present at the presentation

Robust Lossless Semi Fragile Information Protection in Images

Internet security finds it difficult to keep the information secure and to maintain the integrity of the data. Sending messages over the internet secretly is one of the major tasks as it is widely used for passing the message. In order to achieve security there must be some mechanism to protect the data against unauthorized access. A lossless data hiding scheme is proposed in this paper which has a higher embedding capacity than other schemes. Unlike other schemes that are used for embedding fixed amount of data, the proposed data hiding method is block based approach and it uses a variable data embedding in different blocks which reduces the chances of distortion and increases the hiding capacity of the image. When the data is recovered the original image can be restored without any distortion. Our experimental results indicate that the proposed solution can significantly support the data hiding problem. We achieved good Peak signal-to-noise ratio (PSNR) while hiding large amount of data into smoother regions

Analysis of Gait Pattern to Recognize the Human Activities

Human activity recognition based on the computer vision is the process of labelling image sequences with action labels. Accurate systems for this problem are applied in areas such as visual surveillance, human computer interaction and video retrieval. The challenges are due to variations in motion, recording settings and gait differences. Here we propose an approach to recognize the human activities through gait. Activity recognition through Gait is the process of identifying an activity by the manner in which they walk. The identification of human activities in a video, such as a person is walking, running, jumping, jogging etc are important activities in video surveillance. We contribute the use of Model based approach for activity recognition with the help of movement of legs only. Experimental results suggest that our method are able to recognize the human activities with a good accuracy rate and robust to shadows present in the video

A Prototype for linear features generalization

A computer application designed to generalize linear elements in a vector formatted cartographic set by means of two of the most contrasted line generalization algorithms, Douglas-Peucker simplification and Bézier curves based smoothing, is presented in this paper. Regarding codification, the simultaneous treatment of different lineal geometry entity classes and the conservation of their original topological relationships among them are considered. It is recommended in processes that produce small scale reductions (in a 1:2 relationship or similar). The application allows changing the characteristic parameters of the referred algorithms and proposes a report of the results obtained after every transformation. That way it supplies an additional facility as a trial tool to choose the parameters that give the best results in every proces

A prototype for linear features generalization

A computer application designed to generalize linear elements in a vector formatted cartographic set by means of two of the most contrasted line generalization algorithms, Douglas-Peucker simplification and Bézier curves based smoothing, is presented in this paper. Regarding codification, the simultaneous treatment of different lineal geometry entity classes and the conservation of their original topological relationships among them are considered. It is recommended in processes that produce small scale reductions (in a 1:2 relationship or similar). The application allows changing the characteristic parameters of the referred algorithms and proposes a report of the results obtained after every transformation. That way it supplies an additional facility as a trial tool to choose the parameters that give the best results in every process