Data-Driven Shape Analysis and Processing

Data-driven methods play an increasingly important role in discovering geometric, structural, and semantic relationships between 3D shapes in collections, and applying this analysis to support intelligent modeling, editing, and visualization of geometric data. In contrast to traditional approaches, a key feature of data-driven approaches is that they aggregate information from a collection of shapes to improve the analysis and processing of individual shapes. In addition, they are able to learn models that reason about properties and relationships of shapes without relying on hard-coded rules or explicitly programmed instructions. We provide an overview of the main concepts and components of these techniques, and discuss their application to shape classification, segmentation, matching, reconstruction, modeling and exploration, as well as scene analysis and synthesis, through reviewing the literature and relating the existing works with both qualitative and numerical comparisons. We conclude our report with ideas that can inspire future research in data-driven shape analysis and processing.Comment: 10 pages, 19 figure

Novel Degradation Diagnosis Algorithm for Solar Cell Modules by Taking into Account Electrical Characteristics and Ambient Factors

The Korean national policies have enforced to spread the RES (renewable energy sources) as one of the alternative solutions to solve the environmental pollution problems caused by global climate change. Under these circumstances, installations of solar cell systems are considered due to the global concern in eco-friendly and renewable solar energy sources. Nevertheless, electrical performance results and lifetime of solar cell modules installed outside of the buildings have been gradually reduced due to the varied outer ambient circumstances such as temperature, humidity, ultra-violet rays that may cause the reduction of solar cell modules efficiency. Therefore, to solve these issues, this study aims to present a diagnosis algorithm and also perform a diagnosis algorithm to reduce a condition of solar cell modules by taking into account ambient factors and the electrical performance which is energetically related to annual degradation of solar cell modules. Furthermore, this study focused on the implementation of the diagnosis system of solar cell modules with the proposed evaluation algorithm. In addition, the results show that the proposed evaluation and diagnosis system of solar cell modules are practical and useful tools for the improvement of operational efficiency in the solar cell system

Towards Addressing Key Visual Processing Challenges in Social Media Computing

abstract: Visual processing in social media platforms is a key step in gathering and understanding information in the era of Internet and big data. Online data is rich in content, but its processing faces many challenges including: varying scales for objects of interest, unreliable and/or missing labels, the inadequacy of single modal data and difficulty in analyzing high dimensional data. Towards facilitating the processing and understanding of online data, this dissertation primarily focuses on three challenges that I feel are of great practical importance: handling scale differences in computer vision tasks, such as facial component detection and face retrieval, developing efficient classifiers using partially labeled data and noisy data, and employing multi-modal models and feature selection to improve multi-view data analysis. For the first challenge, I propose a scale-insensitive algorithm to expedite and accurately detect facial landmarks. For the second challenge, I propose two algorithms that can be used to learn from partially labeled data and noisy data respectively. For the third challenge, I propose a new framework that incorporates feature selection modules into LDA models.Dissertation/ThesisDoctoral Dissertation Computer Science 201

mARC: Memory by Association and Reinforcement of Contexts

This paper introduces the memory by Association and Reinforcement of Contexts (mARC). mARC is a novel data modeling technology rooted in the second quantization formulation of quantum mechanics. It is an all-purpose incremental and unsupervised data storage and retrieval system which can be applied to all types of signal or data, structured or unstructured, textual or not. mARC can be applied to a wide range of information clas-sification and retrieval problems like e-Discovery or contextual navigation. It can also for-mulated in the artificial life framework a.k.a Conway "Game Of Life" Theory. In contrast to Conway approach, the objects evolve in a massively multidimensional space. In order to start evaluating the potential of mARC we have built a mARC-based Internet search en-gine demonstrator with contextual functionality. We compare the behavior of the mARC demonstrator with Google search both in terms of performance and relevance. In the study we find that the mARC search engine demonstrator outperforms Google search by an order of magnitude in response time while providing more relevant results for some classes of queries

Using Social Media Websites to Support Scenario-Based Design of Assistive Technology

Indiana University-Purdue University Indianapolis (IUPUI)Having representative users, who have the targeted disability, in accessibility studies is vital to the validity of research findings. Although it is a widely accepted tenet in the HCI community, many barriers and difficulties make it very resource-demanding for accessibility researchers to recruit representative users. As a result, researchers recruit non-representative users, who do not have the targeted disability, instead of representative users in accessibility studies. Although such an approach has been widely justified, evidence showed that findings derived from non-representative users could be biased and even misleading. To address this problem, researchers have come up with different solutions such as building pools of users to recruit from. But still, the data is not widely available and needs a lot of effort and resource to build and maintain. On the other hand, online social media websites have become popular in the last decade. Many online communities have emerged that allow online users to discuss health-related subjects, exchange useful information, or provide emotional support. A large amount of data accumulated in such online communities have gained attention from researchers in the healthcare domain. And many researches have been done based on data from social media websites to better understand health problems to improve the wellbeing of people. Despite the increasing popularity, the value of data from social media websites for accessibility research remains untapped. Hence, my work aims to create methods that could extract valuable information from data collected on social media websites for accessibility practitioners to support their design process. First, I investigate methods that enable researchers to effectively collect representative data from social media websites. More specifically, I look into machine learning approaches that could allow researchers to automatically identify online users who have disabilities (representative users). Second, I investigate methods that could extract useful information from user-generated free-text using techniques drawn from the information extraction domain. Last, I explore how such information should be visualized and presented for designers to support the scenario-based design process in accessibility studies

NOVEL ALGORITHMS AND TOOLS FOR LIGAND-BASED DRUG DESIGN

Computer-aided drug design (CADD) has become an indispensible component in modern drug discovery projects. The prediction of physicochemical properties and pharmacological properties of candidate compounds effectively increases the probability for drug candidates to pass latter phases of clinic trials. Ligand-based virtual screening exhibits advantages over structure-based drug design, in terms of its wide applicability and high computational efficiency. The established chemical repositories and reported bioassays form a gigantic knowledgebase to derive quantitative structure-activity relationship (QSAR) and structure-property relationship (QSPR). In addition, the rapid advance of machine learning techniques suggests new solutions for data-mining huge compound databases. In this thesis, a novel ligand classification algorithm, Ligand Classifier of Adaptively Boosting Ensemble Decision Stumps (LiCABEDS), was reported for the prediction of diverse categorical pharmacological properties. LiCABEDS was successfully applied to model 5-HT1A ligand functionality, ligand selectivity of cannabinoid receptor subtypes, and blood-brain-barrier (BBB) passage. LiCABEDS was implemented and integrated with graphical user interface, data import/export, automated model training/ prediction, and project management. Besides, a non-linear ligand classifier was proposed, using a novel Topomer kernel function in support vector machine. With the emphasis on green high-performance computing, graphics processing units are alternative platforms for computationally expensive tasks. A novel GPU algorithm was designed and implemented in order to accelerate the calculation of chemical similarities with dense-format molecular fingerprints. Finally, a compound acquisition algorithm was reported to construct structurally diverse screening library in order to enhance hit rates in high-throughput screening

Nuclei/Cell Detection in Microscopic Skeletal Muscle Fiber Images and Histopathological Brain Tumor Images Using Sparse Optimizations

Nuclei/Cell detection is usually a prerequisite procedure in many computer-aided biomedical image analysis tasks. In this thesis we propose two automatic nuclei/cell detection frameworks. One is for nuclei detection in skeletal muscle fiber images and the other is for brain tumor histopathological images. For skeletal muscle fiber images, the major challenges include: i) shape and size variations of the nuclei, ii) overlapping nuclear clumps, and iii) a series of z-stack images with out-of-focus regions. We propose a novel automatic detection algorithm consisting of the following components: 1) The original z-stack images are first converted into one all-in-focus image. 2) A sufficient number of hypothetical ellipses are then generated for each nuclei contour. 3) Next, a set of representative training samples and discriminative features are selected by a two-stage sparse model. 4) A classifier is trained using the refined training data. 5) Final nuclei detection is obtained by mean-shift clustering based on inner distance. The proposed method was tested on a set of images containing over 1500 nuclei. The results outperform the current state-of-the-art approaches. For brain tumor histopathological images, the major challenges are to handle significant variations in cell appearance and to split touching cells. The proposed novel automatic cell detection consists of: 1) Sparse reconstruction for splitting touching cells. 2) Adaptive dictionary learning for handling cell appearance variations. The proposed method was extensively tested on a data set with over 2000 cells. The result outperforms other state-of-the-art algorithms with F1 score = 0.96