Persistent topology for natural data analysis - A survey

Natural data offer a hard challenge to data analysis. One set of tools is being developed by several teams to face this difficult task: Persistent topology. After a brief introduction to this theory, some applications to the analysis and classification of cells, lesions, music pieces, gait, oil and gas reservoirs, cyclones, galaxies, bones, brain connections, languages, handwritten and gestured letters are shown

Preserving Trustworthiness and Confidentiality for Online Multimedia

Technology advancements in areas of mobile computing, social networks, and cloud computing have rapidly changed the way we communicate and interact. The wide adoption of media-oriented mobile devices such as smartphones and tablets enables people to capture information in various media formats, and offers them a rich platform for media consumption. The proliferation of online services and social networks makes it possible to store personal multimedia collection online and share them with family and friends anytime anywhere. Considering the increasing impact of digital multimedia and the trend of cloud computing, this dissertation explores the problem of how to evaluate trustworthiness and preserve confidentiality of online multimedia data. The dissertation consists of two parts. The first part examines the problem of evaluating trustworthiness of multimedia data distributed online. Given the digital nature of multimedia data, editing and tampering of the multimedia content becomes very easy. Therefore, it is important to analyze and reveal the processing history of a multimedia document in order to evaluate its trustworthiness. We propose a new forensic technique called ``Forensic Hash", which draws synergy between two related research areas of image hashing and non-reference multimedia forensics. A forensic hash is a compact signature capturing important information from the original multimedia document to assist forensic analysis and reveal processing history of a multimedia document under question. Our proposed technique is shown to have the advantage of being compact and offering efficient and accurate analysis to forensic questions that cannot be easily answered by convention forensic techniques. The answers that we obtain from the forensic hash provide valuable information on the trustworthiness of online multimedia data. The second part of this dissertation addresses the confidentiality issue of multimedia data stored with online services. The emerging cloud computing paradigm makes it attractive to store private multimedia data online for easy access and sharing. However, the potential of cloud services cannot be fully reached unless the issue of how to preserve confidentiality of sensitive data stored in the cloud is addressed. In this dissertation, we explore techniques that enable confidentiality-preserving search of encrypted multimedia, which can play a critical role in secure online multimedia services. Techniques from image processing, information retrieval, and cryptography are jointly and strategically applied to allow efficient rank-ordered search over encrypted multimedia database and at the same time preserve data confidentiality against malicious intruders and service providers. We demonstrate high efficiency and accuracy of the proposed techniques and provide a quantitative comparative study with conventional techniques based on heavy-weight cryptography primitives

The engineering design integration (EDIN) system

A digital computer program complex for the evaluation of aerospace vehicle preliminary designs is described. The system consists of a Univac 1100 series computer and peripherals using the Exec 8 operating system, a set of demand access terminals of the alphanumeric and graphics types, and a library of independent computer programs. Modification of the partial run streams, data base maintenance and construction, and control of program sequencing are provided by a data manipulation program called the DLG processor. The executive control of library program execution is performed by the Univac Exec 8 operating system through a user established run stream. A combination of demand and batch operations is employed in the evaluation of preliminary designs. Applications accomplished with the EDIN system are described

Exploring 3D Shapes through Real Functions

This thesis lays in the context of research on representation, modelling and coding knowledge related to digital shapes, where by shape it is meant any individual object having a visual appareance which exists in some two-, three- or higher dimensional space. Digital shapes are digital representations of either physically existing or virtual objects that can be processed by computer applications. While the technological advances in terms of hardware and software have made available plenty of tools for using and interacting with the geometry of shapes, to manipulate and retrieve huge amount of data it is necessary to define methods able to effectively code them. In this thesis a conceptual model is proposed which represents a given 3D object through the coding of its salient features and defines an abstraction of the object, discarding irrelevant details. The approach is based on the shape descriptors defined with respect to real functions, which provide a very useful shape abstraction method for the analysis and structuring of the information contained in the discrete shape model. A distinctive feature of these shape descriptors is their capability of combining topological and geometrical information properties of the shape, giving an abstraction of the main shape features. To fully develop this conceptual model, both theoretical and computational aspects have been considered, related to the definition and the extension of the different shape descriptors to the computational domain. Main emphasis is devoted to the application of these shape descriptors in computational settings; to this aim we display a number of application domains that span from shape retrieval, to shape classification and to best view selection.Questa tesi si colloca nell\u27ambito di ricerca riguardante la rappresentazione, la modellazione e la codifica della conoscenza connessa a forme digitali, dove per forma si intende l\u27aspetto visuale di ogni oggetto che esiste in due, tre o pi? dimensioni. Le forme digitali sono rappresentazioni di oggetti sia reali che virtuali, che possono essere manipolate da un calcolatore. Lo sviluppo tecnologico degli ultimi anni in materia di hardware e software ha messo a disposizione una grande quantit? di strumenti per acquisire, rappresentare e processare la geometria degli oggetti; tuttavia per gestire questa grande mole di dati ? necessario sviluppare metodi in grado di fornirne una codifica efficiente. In questa tesi si propone un modello concettuale che descrive un oggetto 3D attraverso la codifica delle caratteristiche salienti e ne definisce una bozza ad alto livello, tralasciando dettagli irrilevanti. Alla base di questo approccio ? l\u27utilizzo di descrittori basati su funzioni reali in quanto forniscono un\u27astrazione della forma molto utile per analizzare e strutturare l\u27informazione contenuta nel modello discreto della forma. Una peculiarit? di tali descrittori di forma ? la capacit? di combinare propriet? topologiche e geometriche consentendo di astrarne le principali caratteristiche. Per sviluppare questo modello concettuale, ? stato necessario considerare gli aspetti sia teorici che computazionali relativi alla definizione e all\u27estensione in ambito discreto di vari descrittori di forma. Particolare attenzione ? stata rivolta all\u27applicazione dei descrittori studiati in ambito computazionale; a questo scopo sono stati considerati numerosi contesti applicativi, che variano dal riconoscimento alla classificazione di forme, all\u27individuazione della posizione pi? significativa di un oggetto

Retrieval of Spatially Similar Images using Quadtree-based Indexing

Multimedia applications involving image retrieval demand fast response, which requires efficient database indexing. Generally, a two-level indexing scheme in an image database can help to reduce the search space against a given query image. The first level is required to significantly reduce the search space for the second-stage of comparisons and must be computationally efficient. It is also required to guarantee that no new false negatives may result. In this thesis, we propose a new image signature representation for the first level of a two-level image indexing scheme that is based on hierarchical decomposition of image space into spatial arrangement of image features (quadtrees). We also formally prove that the proposed signature representation scheme not only results in fewer number of matching signatures but also does not result in any new false negative. Further, the performance of the retrieval scheme with proposed ignature representation is evaluated for various feature point detection algorithms

Fully-Automated Packaging Structure Recognition of Standardized Logistics Assets on Images

Innerhalb einer logistischen Lieferkette müssen vielfältige Transportgüter an zahlreichen Knotenpunkten bearbeitet, wiedererkannt und kontrolliert werden. Dabei ist oft ein großer manueller Aufwand erforderlich, um die Paketidentität oder auch die Packstruktur zu erkennen oder zu verifizieren. Solche Schritte sind notwendig, um beispielsweise eine Lieferung auf ihre Vollständigkeit hin zu überprüfen. Wir untersuchen die Konzeption und Implementierung eines Verfahrens zur vollständigen Automatisierung der Erkennung der Packstruktur logistischer Sendungen. Ziel dieses Verfahrens ist es, basierend auf einem einzigen Farbbild, eine oder mehrere Transporteinheiten akkurat zu lokalisieren und relevante Charakteristika, wie beispielsweise die Gesamtzahl oder die Anordnung der enthaltenen Packstücke, zu erkennen. Wir stellen eine aus mehreren Komponenten bestehende Bildverarbeitungs-Pipeline vor, die diese Aufgabe der Packstrukturerkennung lösen soll. Unsere erste Implementierung des Verfahrens verwendet mehrere Deep Learning Modelle, genauer gesagt Convolutional Neural Networks zur Instanzsegmentierung, sowie Bildverarbeitungsmethoden und heuristische Komponenten. Wir verwenden einen eigenen Datensatz von Echtbildern aus einer Logistik-Umgebung für Training und Evaluation unseres Verfahrens. Wir zeigen, dass unsere Lösung in der Lage ist, die korrekte Packstruktur in etwa 85% der Testfälle unseres Datensatzes zu erkennen, und sogar eine höhere Genauigkeit erzielt wird, wenn nur die meist vorkommenden Packstücktypen betrachtet werden. Für eine ausgewählte Bilderkennungs-Komponente unseres Algorithmus vergleichen wir das Potenzial der Verwendung weniger rechenintensiver, eigens designter Bildverarbeitungsmethoden mit den zuvor implementierten Deep Learning Verfahren. Aus dieser Untersuchung schlussfolgern wir die bessere Eignung der lernenden Verfahren, welche wir auf deren sehr gute Fähigkeit zur Generalisierung zurückführen. Außerdem formulieren wir das Problem der Objekt-Lokalisierung in Bildern anhand selbst gewählter Merkmalspunkte, wie beispielsweise Eckpunkte logistischer Transporteinheiten. Ziel hiervon ist es, Objekte präziser zu lokalisieren, als dies insbesondere im Vergleich zur Verwendung herkömmlicher umgebender Rechtecke möglich ist, während gleichzeitig die Objektform durch bekanntes Vorwissen zur Objektgeometrie forciert wird. Wir stellen ein spezifisches Deep Learning Modell vor, welches die beschriebene Aufgabe löst im Fall von Objekten, welche durch vier Eckpunkte beschrieben werden können. Das dabei entwickelte Modell mit Namen TetraPackNet wird evaluiert mittels allgemeiner und anwendungsbezogener Metriken. Wir belegen die Anwendbarkeit der Lösung im Falle unserer Bilderkennungs-Pipeline und argumentieren die Relevanz für andere Anwendungsfälle, wie beispielweise Kennzeichenerkennung

Iris Identification using Keypoint Descriptors and Geometric Hashing

Iris is one of the most reliable biometric trait due to its stability and randomness. Conventional recognition systems transform the iris to polar coordinates and perform well for co-operative databases. However, the problem aggravates to manifold for recognizing non-cooperative irises. In addition, the transformation of iris to polar domain introduces aliasing effect. In this thesis, the aforementioned issues are addressed by considering Noise Independent Annular Iris for feature extraction. Global feature extraction approaches are rendered as unsuitable for annular iris due to change in scale as they could not achieve invariance to ransformation and illumination. On the contrary, local features are invariant to image scaling, rotation and partially invariant to change in illumination and viewpoint. To extract local features, Harris Corner Points are detected from iris and matched using novel Dual stage approach. Harris corner improves accuracy but fails to achieve scale invariance. Further, Scale Invariant Feature Transform (SIFT) has been applied to annular iris and results are found to be very promising. However, SIFT is computationally expensive for recognition due to higher dimensional descriptor. Thus, a recently evolved keypoint descriptor called Speeded Up Robust Features (SURF) is applied to mark performance improvement in terms of time as well as accuracy. For identification, retrieval time plays a significant role in addition to accuracy. Traditional indexing approaches cannot be applied to biometrics as data are unstructured. In this thesis, two novel approaches has been developed for indexing iris database. In the first approach, Energy Histogram of DCT coefficients is used to form a B-tree. This approach performs well for cooperative databases. In the second approach, indexing is done using Geometric Hashing of SIFT keypoints. The latter indexing approach achieves invariance to similarity transformations, illumination and occlusion and performs with an accuracy of more than 98% for cooperative as well as non-cooperative databases

Urban Treetop Detection and Tree-Height Estimation from Unmanned-Aerial-Vehicle Images

Individual tree detection for urban forests in subtropical environments remains a great challenge due to the various types of forest structures, high canopy closures, and the mixture of evergreen and deciduous broadleaved trees. Existing treetop detection methods based on the canopy-height model (CHM) from UAV images cannot resolve commission errors in heterogeneous urban forests with multiple trunks or strong lateral branches. In this study, we improved the traditional local-maximum (LM) algorithm using a dual Gaussian filter, variable window size, and local normalized correlation coefficient (NCC). Specifically, we adapted a crown model of maximum/minimum tree-crown radii and an angle strategy to detect treetops. We then removed and merged the pending tree vertices. Our results showed that our improved LM algorithm had an average user accuracy (UA) of 87.3% (SD± 4.6), an average producer accuracy (PA) of 82.8% (SD± 4.1), and an overall accuracy of 93.3% (SD± 3.9) for sample plots with canopy closures less than 0.5. As for the sample plots with canopy closures from 0.5 to 1, the accuracies were 78.6% (SD± 31.5), 73.8% (SD± 10.3), and 68.1% (SD± 12.7), respectively. The tree-height estimation accuracy reached more than 0.96, with an average RMSE of 0.61 m. Our results show that the UAV-image-derived CHM can be used to accurately detect individual trees in mixed forests in subtropical cities like Shanghai, China, to provide vital tree-structure parameters for precise and sustainable forest management.National Key R&D Program of ChinaNational Natural Science Foundation of ChinaChina Postdoctoral Science FoundationPeer Reviewe