Fast, non-destructive and on-site quality control tools, mainly high sensitive imaging techniques, are important to assess the reliability of photovoltaic plants. To minimize the risk of further damages and electrical yield losses, electroluminescence (EL) imaging is used to detect local defects in an early stage, which might cause future electric losses. For an automated defect recognition on EL measurements, a robust detection and rectification of modules, as well as an optional segmentation into cells is required. This paper introduces a method to detect solar modules and crossing points between solar cells in EL images. We only require 1-D image statistics for the detection, resulting in an approach that is computationally efficient. In addition, the method is able to detect the modules under perspective distortion and in scenarios, where multiple modules are visible in the image. We compare our method to the state of the art and show that it is superior in presence of perspective distortion while the performance on images, where the module is roughly coplanar to the detector, is similar to the reference method. Finally, we show that we greatly improve in terms of computational time in comparison to the reference method.
There are not many preliminary works on the automated detection of solar modules. al Vetter @cite_3 proposed an object detection pipeline that consists of several stacked filters followed by a Hough transform to detect solar modules in noisy infrared thermography measurements. Recently, al Deitsch @cite_1 proposed a processing pipeline for solar modules that jointly detects the modules in an EL image, estimates the configuration ( the number of rows and columns of cells), estimates the lens distortion and performs segmentation into rectified cell images. Their approach consists of a preprocessing step, where a multiscale vesselness filter @cite_8 is used to extract ridges (separating lines between cells) and bus bars. Then, parabolic curves are fitted onto the result to obtain a parametric model of the module. Finally, the distortion is estimated and module corners are extracted. Since this is, to the best of our knowledge, the only method that automatically detects solar modules and cell crossing points in EL images, we use this as a reference method to assess the performance of our approach.
@cite_1 @cite_3 @cite_8
2808042620 2312404918 2129534965
Abstract Local electric defects may result in considerable performance losses in solar cells. Infrared thermography is an essential tool to detect these defects on photovoltaic modules. Accordingly, IR-thermography is frequently used in R&D labs of PV manufactures and, furthermore, outdoors in order to identify faulty modules in PV-power plants. Massive amount of data is acquired which needs to be analyzed. An automatized method for detecting solar modules in IR-images would enable a faster and automatized analysis of the data. However, IR-images tend to suffer from rather large noise, which makes an automatized segmentation challenging. The aim of this study was to establish a reliable segmentation algorithm for R&D labs. We propose an algorithm, which detects a solar cell or module within an IR-image with large noise. We tested the algorithm on images of 10 PV-samples characterized by highly sensitive dark lock-in thermography (DLIT). The algorithm proved to be very reliable in detecting correctly the solar module. In our study, we focused on thin film solar cells, however, a transfer of the algorithm to other cell types is straight forward. High resolution electroluminescence (EL) images captured in the infrared spectrum allow to visually and non-destructively inspect the quality of photovoltaic (PV) modules. Currently, however, such a visual inspection requires trained experts to discern different kind of defects, which is time-consuming and expensive. In this work, we make an important step towards improving the current state-of-the-art in solar module inspection. We propose a robust automated segmentation method to extract individual solar cells from EL images of PV modules. Automated segmentation of cells is a key step in automating the visual inspection workflow. It also enables controlled studies on large amounts of data to understanding the effects of module degradation over time - a process not yet fully understood. The proposed method infers in several steps a high level solar module representation from low-level edge features. An important step in the algorithm is to formulate the segmentation problem in terms of lens calibration by exploiting the plumbline constraint. We evaluate our method on a dataset of various solar modules types containing a total of 408 solar cells with various defects. Our method robustly solves this task with a median weighted Jaccard index of 96.09 and an @math score of 97.23 . Voting in each column around an initial peak is considered to be a random variable.The optimal ? is determined by fitting and minimizing a 2nd-order curve.The optimal ? is determined by fitting and interpolating a sine curve.We calculate voting boundaries instead of searching for non-zero voting cells.The endpoint coordinates are determined by fitting instead of by solving equations. Line segment detection is a fundamental procedure in computer vision, pattern recognition, or image analysis applications. This paper proposes a statistical method based on the Hough transform for line segment detection by considering quantization error, image noise, pixel disturbance, and peak spreading, also taking the choice of the coordinate origin into account.A random variable is defined in each column in a peak region. Statistical means and statistical variances are calculated; the statistical non-zero cells are analyzed and computed. The normal angle is determined by minimizing the function which fits the statistical variances; the normal distance is calculated by interpolating the function which fits the statistical means. Endpoint coordinates of a detected line segment are determined by fitting a sine curve (rather than searching for the first and last non-zero voting cells, and solving equations containing coordinates of such cells).Experimental results on simulated data and real world images validate the performance of the proposed method for line segment detection. Fault-prone module detection in source code is important for assurance of software quality. Most previous fault-prone detection approaches have been based on software metrics. Such approaches, however, have difficulties in collecting the metrics and in constructing mathematical models based on the metrics. To mitigate such difficulties, we have proposed a novel approach for detecting fault-prone modules using a spam-filtering technique, named Fault-Prone Filtering. In our approach, fault-prone modules are detected in such a way that the source code modules are considered as text files and are applied to the spam filter directly. In practice, we use the training only errors procedure and apply this procedure to fault-prone. Since no pre-training is required, this procedure can be applied to an actual development field immediately. This paper describes an extension of the training only errors procedures. We introduce a precise unit of training, "modified lines of code," instead of methods. In addition, we introduce the dynamic threshold for classification. The result of the experiment shows that our extension leads to twice the precision with about the same recall, and improves 15 on the best F1 measurement. Developing a robust and reliable vehicle detection and speed estimation system that alerts drivers about driving conditions and helps them avoid joining traffic jams is an important problem that has attracted lots of attention recently. In this paper, we introduce a novel RF-based vehicle motion detection and speed estimation system (ReVISE). Our system leverages the fact that the presence of objects in an RF environment affects the received signal strength and hence, can be used to detect and identify different characteristics of the objects in an area of interest. Our long-term vision for ReVISE is to leverage common wireless networks, such as WiFi or cellular, to detect the density of traffic and estimate the car speed based on the mobile devices carried by users. This gives us an edge over the current techniques for traffic estimation as we do not require any specialized hardware and the cellular signal strength information is available from all cell phones, providing large-scale ubiquitous traffic estimation. We present the design and analysis of ReVISE including its vehicle detection and speed estimation modules. The detection module can differentiate between an empty street, stationary cars, and moving cars based on a multi-class SVM approach that uses features from the RF signal strength. We also present two novel speed estimation techniques based on statistical and curve fitting approaches. Evaluation of ReVISE in a real testbed shows that the proposed techniques can detect vehicle motion with an accuracy of 100 and estimate the vehicle speed with an accuracy of 90 in typical streets. This highlights the feasibility and promise of using RF for vehicle detection and speed estimation. Neural encoding and decoding provide perspectives for understanding neural representations of sensory inputs. Recent functional magnetic resonance imaging fMRI studies have succeeded in building prediction models for encoding and decoding numerous stimuli by representing a complex stimulus as a combination of simple elements. While arbitrary visual images were reconstructed using a modular model that combined the outputs of decoder modules for multiscale local image bases elements, the shapes of the image bases were heuristically determined. In this work, we propose a method to establish mappings between the stimulus and the brain by automatically extracting modules from measured data. We develop a model based on Bayesian canonical correlation analysis, in which each module is modeled by a latent variable that relates a set of pixels in a visual image to a set of voxels in an fMRI activity pattern. The estimated mapping from a latent variable to pixels can be regarded as an image basis. We show that the model estimates a modular representation with spatially localized multiscale image bases. Further, using the estimated mappings, we derive encoding and decoding models that produce accurate predictions for brain activity and stimulus images. Our approach thus provides a novel means of revealing neural representations of stimuli by automatically extracting modules, which can be used to generate effective prediction models for encoding and decoding. This paper considers the problem of single image depth estimation. The employment of convolutional neural networks (CNNs) has recently brought about significant advancements in the research of this problem. However, most existing methods suffer from loss of spatial resolution in the estimated depth maps; a typical symptom is distorted and blurry reconstruction of object boundaries. In this paper, toward more accurate estimation with a focus on depth maps with higher spatial resolution, we propose two improvements to existing approaches. One is about the strategy of fusing features extracted at different scales, for which we propose an improved network architecture consisting of four modules: an encoder, decoder, multi-scale feature fusion module, and refinement module. The other is about loss functions for measuring inference errors used in training. We show that three loss terms, which measure errors in depth, gradients and surface normals, respectively, contribute to improvement of accuracy in an complementary fashion. Experimental results show that these two improvements enable to attain higher accuracy than the current state-of-the-arts, which is given by finer resolution reconstruction, for example, with small objects and object boundaries. Abstract With a wide range of applications in different fields like airport management and military warfare, airplane detection has been a critical part in remote sensing image processing. In this paper, we focus on the airplane detection in large (usually larger than 10,000 × 10,000 pixels) panchromatic image (PI) with high spatial resolution (usually superior to 1 m), and propose an automated airplane detection system. The system contains two main modules: In the first module, line segment detector (LSD) is applied to detect runway of an airport, thus segmenting airport region in a large PI and reducing airplane candidates. The other is used to detect airplanes in the segmented airport regions. We first use circle frequency filter to further locating airplane candidates, then accomplish precise detection task by combining Histograms of Oriented Gradients (HOG) descriptor and AdaBoost algorithm. Therefore, besides a practical airplane detection system, the other contributions of our approach include the following three parts: (1) it locates runway of an airport with LSD; (2) it classifies airplane candidates by using circle frequency filter; (3) it precisely detects airplanes by exploiting HOG and AdaBoost algorithm. Experimental results on real data indicate the efficacy of the proposed system. The airport and airplane detection rates are higher than 94 and 96 , respectively. Meanwhile, the false alarm rate of airplane detection is superior to 0.05 . Moreover, the whole time cost for handling a large PI is less than 2.5 min, which implies that the system is a satisfactory choice for airplane detection in practical applications. This paper presents a novel method for the segmentation of partially overlapping nanoparticles with a convex shape in silhouette images. The proposed method involves two main steps: contour evidence extraction and contour estimation. Contour evidence extraction starts with contour segmentation where contour segments are recovered from a binarized image by detecting concave points. After this, contour segments which belong to the same object are grouped by utilizing properties of fitted ellipses. Finally, the contour estimation is implemented through a non-linear ellipse fitting problem in which partially observed objects are modeled in the form of ellipse-shape objects. The experiments on a dataset consisting of nanoparticles demonstrate that the proposed method outperforms two current state-of-art approaches in overlapping nanoparticles segmentation. The method relies only on edge information and can be applied to any segmentation problems where the objects are partially overlapping and have an approximately elliptical shape, such as cell segmentation. Object reconstruction from a single image - in the wild - is a problem where we can make progress and get meaningful results today. This is the main message of this paper, which introduces an automated pipeline with pixels as inputs and 3D surfaces of various rigid categories as outputs in images of realistic scenes. At the core of our approach are deformable 3D models that can be learned from 2D annotations available in existing object detection datasets, that can be driven by noisy automatic object segmentations and which we complement with a bottom-up module for recovering high-frequency shape details. We perform a comprehensive quantitative analysis and ablation study of our approach using the recently introduced PASCAL 3D+ dataset and show very encouraging automatic reconstructions on PASCAL VOC. Digital pathology and microscopy image analysis is widely used for comprehensive studies of cell morphology or tissue structure. Manual assessment is labor intensive and prone to interobserver variations. Computer-aided methods, which can significantly improve the objectivity and reproducibility, have attracted a great deal of interest in recent literature. Among the pipeline of building a computer-aided diagnosis system, nucleus or cell detection and segmentation play a very important role to describe the molecular morphological information. In the past few decades, many efforts have been devoted to automated nucleus cell detection and segmentation. In this review, we provide a comprehensive summary of the recent state-of-the-art nucleus cell segmentation approaches on different types of microscopy images including bright-field, phase-contrast, differential interference contrast, fluorescence, and electron microscopies. In addition, we discuss the challenges for the current methods and the potential future work of nucleus cell detection and segmentation. In this paper we present a time-efficient estimation framework for camera-based pedestrian tracking from a moving host car using a monocular camera. An image processing system processes the camera output to find the location of objects of interest in each frame. The position and sensor information about the host translation and rotation are passed to a tracking module. The module uses the position of the detected objectpsilas foot point as measurement input and connects them over time to estimate the movement of the objects of interest in order to reduce noise and single frame failures in the detection process. We have developed a new method to estimate the target movement which takes into account the host movement and allows to exploit prior information about the intrinsic and extrinsic camera parameters. The basic idea is to assume that host and target movements can be modelled as 2-dimensional movements on a flat ground-plane. Our developed motion model is based on this assumption and includes host motion as well as the target ego motion. A measurement is modelled as a perspective projection of a point on the ground-plane to the image plane. The motion and the measurement model are combined by an unscented Kalman filter. This filter is relatively new and has not been applied for pedestrian tracking before. Finally, we present a new logical initialization strategy for the selected filter, a part that is left out by most other publications. First results indicate that our approach gives good tracking results and allows to track pedestrians from a moving host in real time. A protein-protein interaction (PPI) network is a biomolecule relationship network that plays an important role in biological activities. Studies of functional modules in a PPI network contribute greatly to the understanding of biological mechanism. With the development of life science and computing science, a great amount of PPI data has been acquired by various experimental and computational approaches, which presents a significant challenge of detecting functional modules in a PPI network. To address this challenge, many functional module detecting methods have been developed. In this survey, we first analyze the existing problems in detecting functional modules and discuss the countermeasures in the data preprocess and postprocess. Second, we introduce some special metrics for distance or graph developed in clustering process of proteins. Third, we give a classification system of functional module detecting methods and describe some existing detection methods in each category. Fourth, we list databases in common use and conduct performance comparisons of several typical algorithms by popular measurements. Finally, we present the prospects and references for researchers engaged in analyzing PPI networks. This paper proposes a novel method to address the problem of estimating the number of people in surveillance scenes with people gathering and waiting. The proposed method combines a MID (mosaic image difference) based foreground segmentation algorithm and a HOG (histograms of oriented gradients) based head-shoulder detection algorithm to provide an accurate estimation of people counts in the observed area. In our framework, the MID-based foreground segmentation module provides active areas for the head-shoulder detection module to detect heads and count the number of people. Numerous experiments are conducted and convincing results demonstrate the effectiveness of our method. Iris segmentation is an essential module in iris recognition because it defines the effective image region used for subsequent processing such as feature extraction. Traditional iris segmentation methods often involve an exhaustive search of a large parameter space, which is time consuming and sensitive to noise. To address these problems, this paper presents a novel algorithm for accurate and fast iris segmentation. After efficient reflection removal, an Adaboost-cascade iris detector is first built to extract a rough position of the iris center. Edge points of iris boundaries are then detected, and an elastic model named pulling and pushing is established. Under this model, the center and radius of the circular iris boundaries are iteratively refined in a way driven by the restoring forces of Hooke's law. Furthermore, a smoothing spline-based edge fitting scheme is presented to deal with noncircular iris boundaries. After that, eyelids are localized via edge detection followed by curve fitting. The novelty here is the adoption of a rank filter for noise elimination and a histogram filter for tackling the shape irregularity of eyelids. Finally, eyelashes and shadows are detected via a learned prediction model. This model provides an adaptive threshold for eyelash and shadow detection by analyzing the intensity distributions of different iris regions. Experimental results on three challenging iris image databases demonstrate that the proposed algorithm outperforms state-of-the-art methods in both accuracy and speed. For object detection, the two-stage approach (e.g., Faster R-CNN) has been achieving the highest accuracy, whereas the one-stage approach (e.g., SSD) has the advantage of high efficiency. To inherit the merits of both while overcoming their disadvantages, in this paper, we propose a novel single-shot based detector, called RefineDet, that achieves better accuracy than two-stage methods and maintains comparable efficiency of one-stage methods. RefineDet consists of two inter-connected modules, namely, the anchor refinement module and the object detection module. Specifically, the former aims to (1) filter out negative anchors to reduce search space for the classifier, and (2) coarsely adjust the locations and sizes of anchors to provide better initialization for the subsequent regressor. The latter module takes the refined anchors as the input from the former to further improve the regression and predict multi-class label. Meanwhile, we design a transfer connection block to transfer the features in the anchor refinement module to predict locations, sizes and class labels of objects in the object detection module. The multi-task loss function enables us to train the whole network in an end-to-end way. Extensive experiments on PASCAL VOC 2007, PASCAL VOC 2012, and MS COCO demonstrate that RefineDet achieves state-of-the-art detection accuracy with high efficiency. Code is available at this https URL For object detection, the two-stage approach (e.g., Faster R-CNN) has been achieving the highest accuracy, whereas the one-stage approach (e.g., SSD) has the advantage of high efficiency. To inherit the merits of both while overcoming their disadvantages, in this paper, we propose a novel single-shot based detector, called RefineDet, that achieves better accuracy than two-stage methods and maintains comparable efficiency of one-stage methods. RefineDet consists of two inter-connected modules, namely, the anchor refinement module and the object detection module. Specifically, the former aims to (1) filter out negative anchors to reduce search space for the classifier, and (2) coarsely adjust the locations and sizes of anchors to provide better initialization for the subsequent regressor. The latter module takes the refined anchors as the input from the former to further improve the regression accuracy and predict multi-class label. Meanwhile, we design a transfer connection block to transfer the features in the anchor refinement module to predict locations, sizes and class labels of objects in the object detection module. The multitask loss function enables us to train the whole network in an end-to-end way. Extensive experiments on PASCAL VOC 2007, PASCAL VOC 2012, and MS COCO demonstrate that RefineDet achieves state-of-the-art detection accuracy with high efficiency. Code is available at https: github.com sfzhang15 RefineDet. A mobile medical device, dubbed HeartSaver, is developed for real-time monitoring of a patient's electrocardiogram (ECG) and automatic detection of several cardiac pathologies, including atrial fibrillation, myocardial infarction and atrio-ventricular block. HeartSaver is based on adroit integration of four different modern technologies: electronics, wireless communication, computer, and information technologies in the service of medicine. The physical device consists of four modules: sensor and ECG processing unit, a microcontroller, a link between the microcontroller and the cell phone, and mobile software associated with the system. HeartSaver includes automated cardiac pathology detection algorithms. These algorithms are simple enough to be implemented on a low-cost, limited-power microcontroller but powerful enough to detect the relevant cardiac pathologies. When an abnormality is detected, the microcontroller sends a signal to a cell phone. This operation triggers an application software on the cell phone that sends a text message transmitting information about patient's physiological condition and location promptly to a physician or a guardian. HeartSaver can be used by millions of cardiac patients with the potential to transform the cardiac diagnosis, care, and treatment and save thousands of lives. Scholarly documents contain multiple figures representing experimental findings. These figures are generated from data which is not reported anywhere else in the paper. We propose a modular architecture for analyzing such figures. Our architecture consists of the following modules: 1. An extractor for figures and associated metadata (figure captions and mentions) from PDF documents; 2. A Search engine on the extracted figures and metadata; 3. An image processing module for automated data extraction from the figures and 4. A natural language processing module to understand the semantics of the figure. We discuss the challenges in each step, report an extractor algorithm to extract vector graphics from scholarly documents and a classification algorithm for figures. Our extractor algorithm improves the state of the art by more than 10 and the classification process is very scalable, yet achieves 85 accuracy. We also describe a semi-automatic system for data extraction from figures which is integrated with our search engine to improve user experience. The fault-prone module detection in source code is of importance for assurance of software quality. Most of previous fault-prone detection approaches are based on software metrics. Such approaches, however, have difficulties in collecting the metrics and constructing mathematical models based on the metrics. In order to mitigate such difficulties, we propose a novel approach for detecting fault-prone modules using a spam filtering technique, named Fault-Prone Filtering. Because of the increase of needs for spam e-mail detection, the spam filtering technique has been progressed as a convenient and effective technique for text mining. In our approach, fault-prone modules are detected in a way that the source code modules are considered as text files and are applied to the spam filter directly. This paper describes the training on errors procedure to apply fault-prone filtering in practice. Since no pre-training is required, this procedure can be applied to actual development field immediately. In order to show the usefulness of our approach, we conducted an experiment using a large source code repository of Java based open source project. The result of experiment shows that our approach can classify about 85 of software modules correctly. The result also indicates that fault-prone modules can be detected relatively low cost at an early stage.