Scratches Removal in Digitised Aerial Photos Concerning Sicilian Territory

In this paper we propose a fast and effective method to detect and restore scratches in aerial photos from a photographic archive concerning Sicilian territory. Scratch removal is a typical problem for old movie films but similar defects can be seen in still images. Our solution is based on a semiautomatic detection process and an unsupervised restoration algorithm. Results are comparable with those obtained with commercial restoration tools

Detection of dirt impairments from archived film sequences : survey and evaluations

Film dirt is the most commonly encountered artifact in archive restoration applications. Since dirt usually appears as a temporally impulsive event, motion-compensated interframe processing is widely applied for its detection. However, motion-compensated prediction requires a high degree of complexity and can be unreliable when motion estimation fails. Consequently, many techniques using spatial or spatiotemporal filtering without motion were also been proposed as alternatives. A comprehensive survey and evaluation of existing methods is presented, in which both qualitative and quantitative performances are compared in terms of accuracy, robustness, and complexity. After analyzing these algorithms and identifying their limitations, we conclude with guidance in choosing from these algorithms and promising directions for future research

Review Paper on Automatic Scratch Lines Noise Removal from Video

The digitalization and transfer of older films into high definition (HD) formats imply that high quality of restoration is necessary. Now a day?s Digital film restoration is an area under discussion of increasing interest to researchers and film archives alike. Old films, including cultural heritage masterpieces, are being digitally premastered and transferred into novel, higher quality formats and distributed through various means such as DVD, Blu-ray or HD pictures. Detection of Line scratches in old movies is a particularly difficult problem due to the variable spatiotemporal characteristics of this deficiency. Some of the main problems consist of sensitivity to noise and texture, and fake detections due to thin vertical structures belonging to the scene. Automatic finding of image damaged regions is the key to automatic video image inpainting. Vertical scratches are the common damages in the old film. As the film is a collection of number of frames arrayed together to produce a motion sequence hence it becomes a lengthy and tedious work to process any video format in any manner. Normally if any scratch or noise generated on films it remains as it is on many frames in sequence in film which can be benefitted by the removal process by initially checking noise area on earlier slide. Hence proposed system is aimed at designing and developing of line scratches detection from old films and remove it

Multi-Directional Detection of Scratches in Digitized Images

Publication in the conference proceedings of EUSIPCO, Glasgow, Scotland, 200

Segmentation-assisted detection of dirt impairments in archived film sequences

A novel segmentation-assisted method for film dirt detection is proposed. We exploit the fact that film dirt manifests in the spatial domain as a cluster of connected pixels whose intensity differs substantially from that of its neighborhood and we employ a segmentation-based approach to identify this type of structure. A key feature of our approach is the computation of a measure of confidence attached to detected dirt regions which can be utilized for performance fine tuning. Another important feature of our algorithm is the avoidance of the computational complexity associated with motion estimation. Our experimental framework benefits from the availability of manually derived as well as objective ground truth data obtained using infrared scanning. Our results demonstrate that the proposed method compares favorably with standard spatial, temporal and multistage median filtering approaches and provides efficient and robust detection for a wide variety of test material

A scalable evolvable hardware processing array

Evolvable hardware (EH) is an interesting alternative to conventional digital circuit design, since autonomous generation of solutions for a given task permits self-adaptivity of the system to changing environments, and they present inherent fault tolerance when evolution is intrinsically performed. Systems based on FPGAs that use Dynamic and Partial Reconfiguration (DPR) for evolving the circuit are an example. Also, thanks to DPR, these systems can be provided with scalability, a feature that allows a system to change the number of allocated resources at run-time in order to vary some feature, such as performance. The combination of both aspects leads to scalable evolvable hardware (SEH), which changes in size as an extra degree of freedom when trying to achieve the optimal solution by means of evolution. The main contributions of this paper are an architecture of a scalable and evolvable hardware processing array system, some preliminary evolution strategies which take scalability into consideration, and to show in the experimental results the benefits of combined evolution and scalability. A digital image filtering application is used as use case

Towards Adversarial Malware Detection: Lessons Learned from PDF-based Attacks

Malware still constitutes a major threat in the cybersecurity landscape, also due to the widespread use of infection vectors such as documents. These infection vectors hide embedded malicious code to the victim users, facilitating the use of social engineering techniques to infect their machines. Research showed that machine-learning algorithms provide effective detection mechanisms against such threats, but the existence of an arms race in adversarial settings has recently challenged such systems. In this work, we focus on malware embedded in PDF files as a representative case of such an arms race. We start by providing a comprehensive taxonomy of the different approaches used to generate PDF malware, and of the corresponding learning-based detection systems. We then categorize threats specifically targeted against learning-based PDF malware detectors, using a well-established framework in the field of adversarial machine learning. This framework allows us to categorize known vulnerabilities of learning-based PDF malware detectors and to identify novel attacks that may threaten such systems, along with the potential defense mechanisms that can mitigate the impact of such threats. We conclude the paper by discussing how such findings highlight promising research directions towards tackling the more general challenge of designing robust malware detectors in adversarial settings

On the application of CMA-ES to biped walk

Technical ReportThis project studies the applicability of Covariance Matrix Adaptation Evolution Strategies to enable a biped robot to walk with no previous knowledge. While most work on the subject is based on Genetic Algorithms, we believe that CMA-ES shows indeed great potential. Our work focuses on the Darwin robot, although it can be easily extrapolated to other humanoids. The evaluation of the solutions' goodness is performed via simulation to keep the real robot away from potential harm.Postprint (published version

Efficient framework for brain tumor detection using different deep learning techniques

The brain tumor is an urgent malignancy caused by unregulated cell division. Tumors are classified using a biopsy, which is normally performed after the final brain surgery. Deep learning technology advancements have assisted the health professionals in medical imaging for the medical diagnosis of several symptoms. In this paper, transfer-learning-based models in addition to a Convolutional Neural Network (CNN) called BRAIN-TUMOR-net trained from scratch are introduced to classify brain magnetic resonance images into tumor or normal cases. A comparison between the pre-trained InceptionResNetv2, Inceptionv3, and ResNet50 models and the proposed BRAIN-TUMOR-net is introduced. The performance of the proposed model is tested on three publicly available Magnetic Resonance Imaging (MRI) datasets. The simulation results show that the BRAIN-TUMOR-net achieves the highest accuracy compared to other models. It achieves 100%, 97%, and 84.78% accuracy levels for three different MRI datasets. In addition, the k-fold cross-validation technique is used to allow robust classification. Moreover, three different unsupervised clustering techniques are utilized for segmentation