Search

With the development of society and changes in the human living environment, people are increasingly attaching importance to their own health. Regarding medical imaging examinations of certain parts of the body, the process of medical image segmentation has become extremely important. This paper presents a novel hybrid algorithm: SAOBL-IA, a fusion of the Simulated Annealing(SA), Opposition-based Learning(OBL)and Island Algorithm(IA). The Island Algorithm itself suffers from slow convergence speed and the tendency to get stuck in local optimum. To address these limitations, we introduce opposition-based learning to enhance the search range and avoid local optimum. Furthermore, we leverage the simulated annealing approach to accelerate the convergence of SAOBL-IA. Comparing the experimental results, it can be seen that SAOBL-IA has better comprehensive performance. Subsequently, the SAOBL-IA algorithm is utilized in conjunction with an optimized two-dimensional OTSU fusion segmentation technique for the purpose of medical image processing. This study proposes an application of image segmentation based on the SAOBL-IA. The segmentation of pixels around the background and target regions using the two-dimensional OTSU method faces challenges in terms of accuracy. To address this issue, an adaptive thresholding technique known as Adaptive Forking is employed for optimization. By determining the slope of the fork based on the misclassified pixel ratio, enhanced segmentation accuracy can be achieved. This improved approach is then integrated with the SAOBL-IA algorithm and applied to the segmentation of lung medical images. The experimental findings show that the amalgamation of SAOBL-IA with the adaptive two-dimensional OTSU segmentation approach, as proposed in this study, manifests superior segmentation speed and enhanced precision in the context of medical image segmentation. [ABSTRACT FROM AUTHOR]

The bin packing problem has a wide range of applications in industry. With the upgrade of the task difficulty, the traditional 2d rectangular layout algorithm can no longer meet the needs of modern industry, such as express packing task and exoplanet ore collection task. The express or ore samples come in heterogeneous shapes so they cannot all be treated as rectangular pieces. In this paper, we propose a three-stage method called covering, corner-searching and occupying (C,S&O) to solve the two-dimensional multishape part packing problem. The objective of the packing problem variant is to ensure maximum use of the raw material and minimize the trim loss. The algorithm cannot make use of information about the sequence of future objects that are going to arrive, only knowing the shape and size of the coming one, and the coming part must be packed into the bin immediately after its arrival without buffering or readjusting. The method of C,S&O hybridizes the idea of "gold corners, silver edges and grass belly" in the Chinese game Go and the method of finding picture corners in machine vision. In the first stage, the rectangular bin and the coming part are transformed into matrix representation, and generating the position matrix that indicates possible ways of packing the part into the bin. In the second stage, the suitable layout position of the coming part is obtained using machine vision image processing technology for reference. The third stage is calculating the environment matching degree to determine the current optimal placement orientation. In order to facilitate the display of the simulation results, only three shapes of parts are considered in the simulation, rectangle, circle and triangle. The experimental results show the effectiveness of this method. Consulting the literature, it is found that this paper is the first to propose a layout method for multishape manufacturing parts. [ABSTRACT FROM AUTHOR]

In this study, we employed the principle of Relative Mode Transfer Method (RMTM) to establish a model for a single pendulum subjected to sudden changes in its length. An experimental platform for image processing was constructed to accurately track the position of a moving ball, enabling experimental verification of the pendulum's motion under specific operating conditions. The experimental data demonstrated excellent agreement with simulated numerical results, validating the effectiveness of the proposed methodology. Furthermore, we performed simulations of a double obstacle pendulum system, investigating the effects of different parameters, including obstacle pin positions, quantities, and initial release angles, on the pendulum's motion through numerical simulations. This research provides novel insights into addressing the challenges associated with abrupt and continuous changes in pendulum length. [ABSTRACT FROM AUTHOR]

In the realm of digital image applications, image processing technology occupies a pivotal position, with image segmentation serving as a foundational component. As the digital image application domain expands across industries, the conventional segmentation techniques increasingly challenge to cater to modern demands. To address this gap, this paper introduces an MCMC-based image segmentation algorithm based on the Markov Random Field (MRF) model, marking a significant stride in the field. The novelty of this research lies in its method that capitalizes on domain information in pixel space, amplifying the local segmentation precision of image segmentation algorithms. Further innovation is manifested in the development of an adaptive segmentation image denoising algorithm based on MCMC sampling. This algorithm not only elevates image segmentation outcomes, but also proficiently denoises the image. In the experimental results, MRF-MCMC achieves better segmentation performance, with an average segmentation accuracy of 94.26% in Lena images, significantly superior to other common image segmentation algorithms. In addition, the study proposes that the denoising model outperforms other algorithms in peak signal-to-noise ratio and structural similarity in environments with noise standard deviations of 15, 25, and 50. In essence, these experimental findings affirm the efficacy of this study, opening avenues for refining digital image segmentation methodologies. [ABSTRACT FROM AUTHOR]

In view of the special engineering properties of red clay and the waste of phosphogypsum resources, the expansion and contraction deformation and fissure evolution of phosphogypsum stabilized red clay under different conditions were investigated by laboratory tests and image processing system. The research results show that: (1) the absolute expansion and absolute shrinkage of phosphogypsum stabilized red clay are positively correlated with the compaction degree, the number of dry and wet cycles and the cement dosage, and negatively correlated with the initial water content and the phosphogypsum dosage; (2) the fissure rate increases with the increase of the number of dry and wet cycles, and decreases with the increase of the initial water content, the compaction degree, the cement, and the phosphogypsum dosage; (3) The relationship among absolute expansion rate (absolute shrinkage), degree of compaction and fracture rate can be fitted by the equation f(x,y) = ax+by+cx2+dy2+e; (4) Phosphogypsum has an obvious inhibiting effect on the expansion, shrinkage and cracking of the mix. It is recommended that the cement mixing amount of 6% and phosphogypsum: red clay = 1:1~1:2 as roadbed filler. [ABSTRACT FROM AUTHOR]

With the exploration and development of marine resources, deep learning is more and more widely used in underwater image processing. However, the quality of the original underwater images is so low that traditional semantic segmentation methods obtain poor segmentation results, such as blurred target edges, insufficient segmentation accuracy, and poor regional boundary segmentation effects. To solve these problems, this paper proposes a semantic segmentation method for underwater images. Firstly, the image enhancement based on multi-spatial transformation is performed to improve the quality of the original images, which is not common in other advanced semantic segmentation methods. Then, the densely connected hybrid atrous convolution effectively expands the receptive field and slows down the speed of resolution reduction. Next, the cascaded atrous convolutional spatial pyramid pooling module integrates boundary features of different scales to enrich target details. Finally, the context information aggregation decoder fuses the features of the shallow network and the deep network to extract rich contextual information, which greatly reduces information loss. The proposed method was evaluated on RUIE, HabCam UID, and UIEBD. Compared with the state-of-the-art semantic segmentation algorithms, the proposed method has advantages in segmentation integrity, location accuracy, boundary clarity, and detail in subjective perception. On the objective data, the proposed method achieves the highest MIOU of 68.3 and OA of 79.4, and it has a low resource consumption. Besides, the ablation experiment also verifies the effectiveness of our method. [ABSTRACT FROM AUTHOR]

A fault detection method using skeleton extraction based on orientation field consistency is proposed to improve the efficiency of fault detection, reduce the influence of transverse nonstructural factors on fault detection, and realize automatic fault extraction. In fingerprint image processing, the consistency of the orientation field reaches a maximum value when all orientations are parallel and takes a smaller value when not all orientations are parallel. The orientation field ceases to be parallel in the presence of a stratigraphic discontinuity, and the consistency of the orientation field in the corresponding region is lower than that in parallel regions. This characteristic can be exploited to extract discontinuous regions from seismic data. Then, binarization and closing operations are used to extract fault areas and increase fault continuity. Finally, a skeleton extraction method based on extracting the longitudinal center point is used to identify the fault lines. Compared with the classical ant tracking method, the proposed method requires the adjustment of fewer parameters, thus simplifying fault identification process to a certain extent. Moreover, the proposed method effectively suppresses transverse discontinuities, highlights the longitudinal fault characteristics, and strengthens fault continuity. [ABSTRACT FROM AUTHOR]

Stirling et al., (10.1371/journal.pone.0108482) presented an analysis on some of our publications on the formation of stripe-like domains on mixed-ligand coated gold nanoparticles. The authors shed doubts on some of our results however no valid argument is provided against what we have shown since our first publication: scanning tunneling microscopy (STM) images of striped nanoparticles show stripe-like domains that are independent of imaging parameters and in particular of imaging speed. We have consistently ruled out the presence of artifacts by comparing sets of images acquired at different tip speeds, finding invariance of the stipe-like domains. Stirling and co-workers incorrectly analyzed this key control, using a different microscope and imaging conditions that do not compare to ours. We show here data proving that our approach is rigorous. Furthermore, we never solely relied on image analysis to draw our conclusions; we have always used the chemical nature of the particles to assess the veracity of our images. Stirling et al. do not provide any justification for the spacing of the features that we find on nanoparticles: ~1 nm for mixed ligand particles and ~ 0.5 nm for homoligand particles. Hence our two central arguments remain unmodified: independence from imaging parameters and dependence on ligand shell chemical composition. The paper report observations on our STM images; none is a sufficient condition to prove that our images are artifacts. We thoroughly addressed issues related to STM artifacts throughout our microscopy work. Stirling et al. provide guidelines for what they consider good STM images of nanoparticles, such images are indeed present in our literature. They conclude that the evidences we provided to date are insufficient, this is a departure from one of the authors’ previous article which concluded that our images were composed of artifacts. Given that four independent laboratories have reproduced our measurements and that no scientifically rigorous argument is presented to invalidate our STM images, and also given that Stirling et al. do not contest the quality of our recent STM images, we re-affirm that specific binary mixture of ligands spontaneously form features in their ligand shell that we describe as stripe-like domains ~1 nm in width. [ABSTRACT FROM AUTHOR]

The distortion measurement plays an important role in panoramic image processing. Most measurement algorithms judge the panoramic image quality by means of weighting the quality of the local areas. However, such a calculation fails to globally reflect the quality of the panoramic image. Therefore, the multi-region adjacent pixels correlation (MRAPC) is proposed as the efficient feature for no-reference panoramic images quality assessment in this paper. Specifically, from the perspective of the statistical characteristics, the differences of the adjacent pixels in panoramic image are proved to be highly related to the degree of distortion and independent of image content. Besides, the difference map has limited pixel value range, which can improve the efficiency of quality assessment. Based on these advantages, the proposed MRAPC feature collaborates with the support vector regression to globally predict the quality of panoramic images. Extensive experimental results show that the proposed no-reference panoramic image quality assessment algorithm achieves higher evaluation performance than the existing algorithms. [ABSTRACT FROM AUTHOR]

Aerial photography is a long-range, non-contact method of target detection technology that enables qualitative or quantitative analysis of the target. However, aerial photography images generally have certain chromatic aberration and color distortion. Therefore, effective segmentation of aerial images can further enhance the feature information and reduce the computational difficulty for subsequent image processing. In this paper, we propose an improved version of Golden Jackal Optimization, which is dubbed Helper Mechanism Based Golden Jackal Optimization (HGJO), to apply multilevel threshold segmentation to aerial images. The proposed method uses opposition-based learning to boost population diversity. And a new approach to calculate the prey escape energy is proposed to improve the convergence speed of the algorithm. In addition, the Cauchy distribution is introduced to adjust the original update scheme to enhance the exploration capability of the algorithm. Finally, a novel "helper mechanism" is designed to improve the performance for escape the local optima. To demonstrate the effectiveness of the proposed algorithm, we use the CEC2022 benchmark function test suite to perform comparison experiments. the HGJO is compared with the original GJO and five classical meta-heuristics. The experimental results show that HGJO is able to achieve competitive results in the benchmark test set. Finally, all of the algorithms are applied to the experiments of variable threshold segmentation of aerial images, and the results show that the aerial photography images segmented by HGJO beat the others. Noteworthy, the source code of HGJO is publicly available at https://github.com/Vang-z/HGJO. [ABSTRACT FROM AUTHOR]

Research on underwater image processing has increased significantly in the past decade due to the precious resources that exist underwater. However, it is still a challenging problem to restore degraded underwater images. Existing prior-based methods show limited performance in many cases due to their reliance on hand-crafted features. Therefore, in this paper, we propose an effective unsupervised generative adversarial network(GAN) for underwater image restoration. Specifically, we embed the idea of contrastive learning into the model. The method encourages two elements (corresponding patches) to map the similar points in the learned feature space relative to other elements (other patches) in the data set, and maximizes the mutual information between input and output through PatchNCE loss. We design a query attention (Que-Attn) module, which compares feature distances in the source domain, and gives an attention matrix and probability distribution for each row. We then select queries based on their importance measure calculated from the distribution. We also verify its generalization performance on several benchmark datasets. Experiments and comparison with the state-of-the-art methods show that our model outperforms others. [ABSTRACT FROM AUTHOR]

With the increase of the camera resolution, the number of pixels contained in froth image is increased, which brings many challenges to image segmentation. Froth size and distribution are the important index in froth flotation. The segmentation of froth images is always a problem in building flotation model. In segmenting froth images, Otsu method is usually used to get a binary image for classification of froth images, this method can get a satisfactory segmentation result. However, each gray level is required to calculate each of the between-class variance, it takes a longer time in froth images with a large number of pixels. To solve this problem, an improved method is proposed in this paper. Most froth images have the pixel distribution characteristic that the gray histogram curve is a sawtooth shape. The proposed method uses polynomial to fit the curve of gray histogram and takes the characteristic of gray histogram's valley into consideration in Otsu method. Two performance comparison methods are introduced and used. Experimental comparison between Otsu method and the proposed method shows that the proposed method has a satisfactory image segmentation with a low computing time. [ABSTRACT FROM AUTHOR]

This paper details the development and testing of the GIFT macro, which is a freely available program for ImageJ for the automated measurement of fiber diameters in SEM images of electrospun materials. The GIFT macro applies a validated method which distinguishes fiber diameters based on distance frequencies within an image. In this work, we introduce an applied version of the GIFT method which has been designed to be user-friendly while still allowing complete control over the various parameters involved in the image processing steps. The macro quickly processes large data sets and creates results that are reproducible and accurate. The program outputs both raw data and fiber diameter averages, so that the user can quickly assess the results and has the opportunity for further analysis if desired. The GIFT macro was compared directly to other software designed for fiber diameter measurements and was found to have comparable or lower average error, especially when measuring very small fibers, and reduced processing times per image. The macro, detailed instructions for use, and sample images are freely available online (https://github.com/IBMTRostock/GIFT). We believe that the GIFT macro is a valuable new tool for researchers looking to quickly, easily and reliably assess fiber diameters in electrospun materials. [ABSTRACT FROM AUTHOR]

Color-based image segmentation classifies pixels of digital images in numerous groups for further analysis in computer vision, pattern recognition, image understanding, and image processing applications. Various algorithms have been developed for image segmentation, but clustering algorithms play an important role in the segmentation of digital images. This paper presents a novel and adaptive initialization approach to determine the number of clusters and find the initial central points of clusters for the standard K-means algorithm to solve the segmentation problem of color images. The presented scheme uses a scanning procedure of the paired Red, Green, and Blue (RGB) color-channel histograms for determining the most salient modes in every histogram. Next, the histogram thresholding is applied and a search in every histogram mode is performed to accomplish RGB pairs. These RGB pairs are used as the initial cluster centers and cluster numbers that clustered each pixel into the appropriate region for generating the homogeneous regions. The proposed technique determines the best initialization parameters for the conventional K-means clustering technique. In this paper, the proposed approach was compared with various unsupervised image segmentation techniques on various image segmentation benchmarks. Furthermore, we made use of a ranking approach inspired by the Evaluation Based on Distance from Average Solution (EDAS) method to account for segmentation integrity. The experimental results show that the proposed technique outperforms the other existing clustering techniques by optimizing the segmentation quality and possibly reducing the classification error. [ABSTRACT FROM AUTHOR]

Analyzing geological drilling hole images acquired by Axial View Panoramic Borehole Televiewer (APBT) is a key step to explore the geological structure in a geological exploration. Conventionally, the borehole images are examined by technicians, which is inefficient and subjective. In this paper, three dominant types of borehole-wall images on coal-rock mass structure, namely, border images, fracture images and intact rock mass images are mainly studied. The traditional image classification methods based on unified feature extraction algorithm and single classifier is not effect for the borehole images. Therefore, this paper proposes a novel two-stage classification approach to improve the classification performance of borehole images. In the first-stage classification, the border images are identified from three kinds of images based on texture features and gray-scale histograms features. For the remaining two types of images, in the second-stage classification, Gabor filter is first applied to segment the region of interest (ROI) (such as microfracture, absciss layer and horizontal cracks, etc.) and the central interference region. Then, using the same feature vector after eliminating the central interference region, fracture images are separated from intact rock mass images. We test our two-stage classification system with real borehole images. The results of experimental show that the two-stage classification method can effectively classify three major borehole-wall images with the correction rate of 95.55% in the first stage and 95% in the second stage. [ABSTRACT FROM AUTHOR]

In developing nations, many expanding cities are facing challenges that result from the overwhelming numbers of people and vehicles. Collecting real-time, reliable and precise traffic flow information is crucial for urban traffic management. The main purpose of this paper is to develop an adaptive model that can assess the real-time vehicle counts on urban roads using computer vision technologies. This paper proposes an automatic real-time background update algorithm for vehicle detection and an adaptive pattern for vehicle counting based on the virtual loop and detection line methods. In addition, a new robust detection method is introduced to monitor the real-time traffic congestion state of road section. A prototype system has been developed and installed on an urban road for testing. The results show that the system is robust, with a real-time counting accuracy exceeding 99% in most field scenarios. [ABSTRACT FROM AUTHOR]

Cerebrovascular Reactivity (CVR) provides an assessment of the brain's vascular reserve and has been postulated to be a sensitive marker in cerebrovascular diseases. MRI-based CVR measurement typically employs alterations in arterial carbon dioxide (CO2) level while continuously acquiring Blood-Oxygenation-Level-Dependent (BOLD) images. CO2-inhalation and resting-state methods are two commonly used approaches for CVR MRI. However, processing of CVR MRI data often requires special expertise and may become an obstacle in broad utilization of this promising technique. The aim of this work was to develop CVR-MRICloud, a cloud-based CVR processing pipeline, to enable automated processing of CVR MRI data. The CVR-MRICloud consists of several major steps including extraction of end-tidal CO2 (EtCO2) curve from raw CO2 recording, alignment of EtCO2 curve with BOLD time course, computation of CVR value on a whole-brain, regional, and voxel-wise basis. The pipeline also includes standard BOLD image processing steps such as motion correction, registration between functional and anatomic images, and transformation of the CVR images to canonical space. This paper describes these algorithms and demonstrates the performance of the CVR-MRICloud in lifespan healthy subjects and patients with clinical conditions such as stroke, brain tumor, and Moyamoya disease. CVR-MRICloud has potential to be used as a data processing tool for a variety of basic science and clinical applications. [ABSTRACT FROM AUTHOR]

A quality detection system for the "Red Fuji" apple in Luochuan was designed for automatic grading. According to the Chinese national standard, the grading principles of apple appearance quality and Brix detection were determined. Based on machine vision and image processing, the classifier models of apple defect, contour, and size were constructed. And then, the grading thresholds were set to detect the defective pixel ratio t, aspect ratio λ, and the cross-sectional diameter Wp in the image of the apple. Spectral information of apples in the wavelength range of 400 nm~1000 nm was collected and the multiple scattering correction (MSC) and standard normal variable (SNV) transformation methods were used to preprocess spectral reflectance data. The competitive adaptive reweighted sampling (CARS) algorithm and the successive projections algorithm (SPA) were used to extract characteristic wavelength points containing Brix information, and the CARS-PLS (partial least squares) algorithm was used to establish a Brix prediction model. Apple defect, contour, size, and Brix were combined as grading indicators. The apple quality online grading detection platform was built, and apple's comprehensive grading detection algorithm and upper computer software were designed. The experiments showed that the average accuracy of apple defect, contour, and size grading detection was 96.67%, 95.00%, and 94.67% respectively, and the correlation coefficient Rp of the Brix prediction set was 0.9469. The total accuracy of apple defect, contour, size, and Brix grading was 96.67%, indicating that the detection system designed in this paper is feasible to classify "Red Fuji" apple in Luochuan. [ABSTRACT FROM AUTHOR]

In the context of intelligent driving, pedestrian detection faces challenges related to low accuracy in target recognition and positioning. To address this issue, a pedestrian detection algorithm is proposed that integrates a large kernel attention mechanism with the YOLOV5 lightweight model. The algorithm aims to enhance long-term attention and dependence during image processing by fusing the large kernel attention module with the C3 module. Furthermore, it addresses the lack of long-distance relationship information in channel and spatial feature extraction and representation by introducing the Coordinate Attention mechanism. This mechanism effectively extracts local information and focused location details, thereby improving detection accuracy. To improve the positioning accuracy of obscured targets, the alpha CIOU bounding box regression loss function is employed. It helps mitigate the impact of occlusions and enhances the algorithm's ability to precisely localize pedestrians. To evaluate the effectiveness of trained model, experiments are conducted on the BDD100K pedestrian dataset as well as the Pascal VOC dataset. Experimental results demonstrate that the improved attention fusion YOLOV5 lightweight model achieves an average accuracy of 60.3%. Specifically, the detection accuracy improves by 1.1% compared to the original YOLOV5 algorithm, and the accuracy performance index reaches 73.0%. These findings strongly indicate the proposed algorithm in significantly enhancing the accuracy of pedestrian detection in road scenes. [ABSTRACT FROM AUTHOR]

In 1979 Haralick famously introduced a method for analyzing the texture of an image: a set of statistics extracted from the co-occurrence matrix. In this paper we investigate novel sets of texture descriptors extracted from the co-occurrence matrix; in addition, we compare and combine different strategies for extending these descriptors. The following approaches are compared: the standard approach proposed by Haralick, two methods that consider the co-occurrence matrix as a three-dimensional shape, a gray-level run-length set of features and the direct use of the co-occurrence matrix projected onto a lower dimensional subspace by principal component analysis. Texture descriptors are extracted from the co-occurrence matrix evaluated at multiple scales. Moreover, the descriptors are extracted not only from the entire co-occurrence matrix but also from subwindows. The resulting texture descriptors are used to train a support vector machine and ensembles. Results show that our novel extraction methods improve the performance of standard methods. We validate our approach across six medical datasets representing different image classification problems using the Wilcoxon signed rank test. The source code used for the approaches tested in this paper will be available at: http://www.dei.unipd.it/wdyn/?IDsezione=3314&IDgruppo_pass=124&preview=. [ABSTRACT FROM AUTHOR]

The Euler's elastica energy regularizer has been widely used in image processing and computer vision tasks. However, finding a fast and simple solver for the term remains challenging. In this paper, we propose a new dual method to simplify the solution. Classical fast solutions transform the complex optimization problem into simpler subproblems, but introduce many parameters and split operators in the process. Hence, we propose a new dual algorithm to maintain the constraint exactly, while using only one dual parameter to transform the problem into its alternate optimization form. The proposed dual method can be easily applied to level-set-based segmentation models that contain the Euler's elastic term. Lastly, we demonstrate the performance of the proposed method on both synthetic and real images in tasks image processing tasks, i.e. denoising, inpainting, and segmentation, as well as compare to the Augmented Lagrangian method (ALM) on the aforementioned tasks. [ABSTRACT FROM AUTHOR]

Image segmentation is a fundamental task in image processing and is still a challenging problem when processing images with high noise, low resolution and intensity inhomogeneity. In this paper, a weighted region-based level set method, which is based on the techniques of local statistical theory, level set theory and curve evolution, is proposed. Specifically, a new weighted pressure force function (WPF) is first presented to flexibly drive the closed contour to shrink or expand outside and inside of the object. Second, a faster and smoother regularization term is added to ensure the stability of the curve evolution and that there is no need for initialization in curve evolution. Third, the WPF is integrated into the region-based level set framework to accelerate the speed of the curve evolution and improve the accuracy of image segmentation. Experimental results on medical and natural images demonstrate that the proposed segmentation model is more efficient and robust to noise than other state-of-the-art models. [ABSTRACT FROM AUTHOR]

Motion blur in images is usually modeled as the convolution of a point spread function (PSF) and the original image represented as pixel intensities. The knife-edge function can be used to model various types of motion-blurs, and hence it allows for the construction of a PSF and accurate estimation of the degradation function without knowledge of the specific degradation model. This paper addresses the problem of image restoration using a knife-edge function and optimal window Wiener filtering. In the proposed method, we first calculate the motion-blur parameters and construct the optimal window. Then, we use the detected knife-edge function to obtain the system degradation function. Finally, we perform Wiener filtering to obtain the restored image. Experiments show that the restored image has improved resolution and contrast parameters with clear details and no discernible ringing effects. [ABSTRACT FROM AUTHOR]

This paper studies the problem of the restoration of images corrupted by mixed Gaussian-impulse noise. In recent years, low-rank matrix reconstruction has become a research hotspot in many scientific and engineering domains such as machine learning, image processing, computer vision and bioinformatics, which mainly involves the problem of matrix completion and robust principal component analysis, namely recovering a low-rank matrix from an incomplete but accurate sampling subset of its entries and from an observed data matrix with an unknown fraction of its entries being arbitrarily corrupted, respectively. Inspired by these ideas, we consider the problem of recovering a low-rank matrix from an incomplete sampling subset of its entries with an unknown fraction of the samplings contaminated by arbitrary errors, which is defined as the problem of matrix completion from corrupted samplings and modeled as a convex optimization problem that minimizes a combination of the nuclear norm and the -norm in this paper. Meanwhile, we put forward a novel and effective algorithm called augmented Lagrange multipliers to exactly solve the problem. For mixed Gaussian-impulse noise removal, we regard it as the problem of matrix completion from corrupted samplings, and restore the noisy image following an impulse-detecting procedure. Compared with some existing methods for mixed noise removal, the recovery quality performance of our method is dominant if images possess low-rank features such as geometrically regular textures and similar structured contents; especially when the density of impulse noise is relatively high and the variance of Gaussian noise is small, our method can outperform the traditional methods significantly not only in the simultaneous removal of Gaussian noise and impulse noise, and the restoration ability for a low-rank image matrix, but also in the preservation of textures and details in the image. [ABSTRACT FROM AUTHOR]

Depth image-based rendering (DIBR), which is used to render virtual views with a color image and the corresponding depth map, is one of the key techniques in the 2D to 3D conversion process. Due to the absence of knowledge about the 3D structure of a scene and its corresponding texture, DIBR in the 2D to 3D conversion process, inevitably leads to holes in the resulting 3D image as a result of newly-exposed areas. In this paper, we proposed a structure-aided depth map preprocessing framework in the transformed domain, which is inspired by recently proposed domain transform for its low complexity and high efficiency. Firstly, our framework integrates hybrid constraints including scene structure, edge consistency and visual saliency information in the transformed domain to improve the performance of depth map preprocess in an implicit way. Then, adaptive smooth localization is cooperated and realized in the proposed framework to further reduce over-smoothness and enhance optimization in the non-hole regions. Different from the other similar methods, the proposed method can simultaneously achieve the effects of hole filling, edge correction and local smoothing for typical depth maps in a united framework. Thanks to these advantages, it can yield visually satisfactory results with less computational complexity for high quality 2D to 3D conversion. Numerical experimental results demonstrate the excellent performances of the proposed method. [ABSTRACT FROM AUTHOR]

High-speed imaging equipment can be an expensive investment, especially when certain applications require custom solutions. In this paper, we present a low-cost high-speed prototype camera built on a low-end Zynq-7000 System-on-Chip (SoC) platform and off-the-shelf components with the aim of removing the entry barrier into various high-speed imaging applications. The camera is standalone (does not require a host computer) and can achieve 211 frames per second (fps) at its maximum resolution of 1280x1024, and up to 2329 fps at a 256x256 resolution. With a current cost of only several hundred dollars and resource utilization of ~5%, the open-source design's modularity and customizability allows users with sufficient hardware or programming experience to modify the camera to suit their needs, potentially driving the cost lower. This can be done by utilizing the large remaining programmable logic for custom image processing algorithms, creating user interface software on the CPU, attaching extensions through the peripheral Module connections, or creating custom carrier or daughter boards. The development and design of the camera is described and a figure-of-merit is presented to provide a value assessment of some available commercial high-speed cameras against which our camera is competitive. Finally, the camera was tested to record low frequency spatial vibration and was found to be useful in investigating phenotypes associated with aging in a leading animal model, the nematode (worm) Caenorhabditis elegans. [ABSTRACT FROM AUTHOR]

Image compression and image encryption are two essential tasks in image processing. The former aims to reduce the cost for storage or transmission of images while the latter aims to change the positions or values of pixels to protect image content. Nowadays, an increasing number of researchers are focusing on the combination of these two tasks. In this paper, we propose a novel joint image compression and encryption approach that integrates a quantum chaotic system, sparse Bayesian learning (SBL) and a bit-level 3D Arnold cat map, so-called QSBLA, for such a purpose. Specifically, the QSBLA consists of 6 stages. First, a quantum chaotic system is employed to generate chaotic sequences for subsequent compression and encryption. Second, as one method of compressive sensing, SBL is used to compress images. Third, an operation of diffusion is performed on the compressed image. Fourth, the compressed and diffused image is transformed into several bit-level cubes. Fifth, 3D Arnold cat maps are used to permute each bit-level cube. Finally, all the bit-level cubes are integrated and transformed into a 2D pixel-level image, resulting in the compressed and encrypted image. Extensive experiments on 8 publicly-accessed images demonstrate that the proposed QSBLA is superior or comparable to some state-of-the-art approaches in terms of several measurement indices, indicating that the QSBLA is promising for joint image compression and encryption. [ABSTRACT FROM AUTHOR]

The production of banana—one of the highly consumed fruits—is highly affected due to loss of certain number of banana plants in an early phase of vegetation. This affects the ability of farmers to forecast and estimate the production of banana. In this paper, we propose a deep learning (DL) based method to precisely detect and count banana plants on a farm exclusive of other plants, using high resolution RGB aerial images collected from Unmanned Aerial Vehicle (UAV). An attempt to detect the plants on the normal RGB images resulted less than 78.8% recall for our sample images of a commercial banana farm in Thailand. To improve this result, we use three image processing methods—Linear Contrast Stretch, Synthetic Color Transform and Triangular Greenness Index—to enhance the vegetative properties of orthomosaic, generating multiple variants of orthomosaic. Then we separately train a parameter-optimized Convolutional Neural Network (CNN) on manually interpreted banana plant samples seen on each image variants, to produce multiple results of detection on our region of interest. 96.4%, 85.1% and 75.8% of plants were correctly detected on three of our dataset collected from multiple altitude of 40, 50 and 60 meters, of same farm. Further discussion on results obtained from combination of multiple altitude variants are also discussed later in the research, in an attempt to find better altitude combination for data collection from UAV for the detection of banana plants. The results showed that merging the detection results of 40 and 50 meter dataset could detect the plants missed by each other, increasing recall upto 99%. [ABSTRACT FROM AUTHOR]

The paper presents the results of a quantitative analysis of speeches by Nobel laureates in the sciences (Physics, Chemistry, Medicine) at the Prize gala dinner throughout the whole history of the Prize, 1901–2018. The results outline key themes and historical trends. A dominant theme, common to most speeches, is the exaltation of science as a profession by the laureate. Since the 1970s, especially in chemistry, this element becomes more domain-specific and less related to science in general. One could speculate whether this happens chiefly in chemistry because its area of activity has been perceived to be at risk of erosion from competing fields (e.g. physics, biology). Over time, speeches become more technical, less ceremonial and more lecture-oriented. Emphasis on broad, beneficial impact of science for humanity and mankind (as emphasised in Nobel’s will) is more present in laureates’ speeches during the first half of the XXth century, while its relevance clearly declines during the last decades. Politics and its relationship with science is also a relevant topic in Nobel speeches. Particularly between the two World Wars, science is seen as terrain where nationalistic stances and fights among nations could actually find a context for peaceful competition and even cooperation. [ABSTRACT FROM AUTHOR]

Compressive sensing (CS) theory asserts that we can reconstruct signals and images with only a small number of samples or measurements. Recent works exploiting the nonlocal similarity have led to better results in various CS studies. To better exploit the nonlocal similarity, in this paper, we propose a non-convex smoothed rank function based model for CS image reconstruction. We also propose an efficient alternating minimization method to solve the proposed model, which reduces a difficult and coupled problem to two tractable subproblems. Experimental results have shown that the proposed method performs better than several existing state-of-the-art CS methods for image reconstruction. [ABSTRACT FROM AUTHOR]

The basic principle of nonlocal means is to denoise a pixel using the weighted average of the neighbourhood pixels, while the weight is decided by the similarity of these pixels. The key issue of the nonlocal means method is how to select similar patches and design the weight of them. There are two main contributions of this paper: The first contribution is that we use two images to denoise the pixel. These two noised images are with the same noise deviation. Instead of using only one image, we calculate the weight from two noised images. After the first denoising process, we get a pre-denoised image and a residual image. The second contribution is combining the nonlocal property between residual image and pre-denoised image. The improved nonlocal means method pays more attention on the similarity than the original one, which turns out to be very effective in eliminating gaussian noise. Experimental results with simulated data are provided. [ABSTRACT FROM AUTHOR]

As a common ocular complication for diabetic patients, diabetic retinopathy has become an important public health problem in the world. Early diagnosis and early treatment with the help of fundus imaging technology is an effective control method. In this paper, a robust inverse diffusion equation combining a self-similarity filtering is presented to detect and evaluate diabetic retinopathy using retinal image enhancement. A flux corrected transport technique is used to control diffusion flux adaptively, which eliminates overshoots inherent in the Laplacian operation. Feature preserving denoising by the self-similarity filtering ensures a robust enhancement of noisy and blurry retinal images. Experimental results demonstrate that this algorithm can enhance important details of retinal image data effectively, affording an opportunity for better medical interpretation and subsequent processing. [ABSTRACT FROM AUTHOR]

Information carried by an image can be distorted due to different image processing steps introduced by different electronic means of storage and communication. Therefore, development of algorithms which can automatically assess a quality of the image in a way that is consistent with human evaluation is important. In this paper, an approach to image quality assessment (IQA) is proposed in which the quality of a given image is evaluated jointly by several IQA approaches. At first, in order to obtain such joint models, an optimisation problem of IQA measures aggregation is defined, where a weighted sum of their outputs, i.e., objective scores, is used as the aggregation operator. Then, the weight of each measure is considered as a decision variable in a problem of minimisation of root mean square error between obtained objective scores and subjective scores. Subjective scores reflect ground-truth and involve evaluation of images by human observers. The optimisation problem is solved using a genetic algorithm, which also selects suitable measures used in aggregation. Obtained multimeasures are evaluated on four largest widely used image benchmarks and compared against state-of-the-art full-reference IQA approaches. Results of comparison reveal that the proposed approach outperforms other competing measures. [ABSTRACT FROM AUTHOR]

In this paper, we give a systematic study to report several deep insights into the HOG, one of the most widely used features in the modern computer vision and image processing applications. We first show that, its magnitudes of gradient can be randomly projected with random matrix. To handle over-fitting, an integral histogram based on the differences of randomly selected blocks is proposed. The experiments show that both the random projection and integral histogram outperform the HOG feature obviously. Finally, the two ideas are combined into a new descriptor termed IHRP, which outperforms the HOG feature with less dimensions and higher speed. [ABSTRACT FROM AUTHOR]

This paper attempts to design an automated, efficient and intelligent tomato grading method that facilitates the graded selling of the fruit. Based on machine vision, the color images of tomatoes with different morphologies were studied, and the color, shape and size were selected as the key features. On this basis, an automated grading classifier was created based on the surface features of tomatoes, and a grading platform was set up to verify the effect of the classifier. Specifically, the Hue value distributions of tomatoes with different maturities were investigated, and the Hue value ranges were determined for mature, semi-mature and immature tomatoes, producing the color classifier. Next, the first-order Fourier descriptor (1D- FD) was adopted to describe the radius sequence of tomato contour, and an equation was established to compute the irregularity of tomato contour, creating the shape classifier. After that, a linear regression equation was constructed to reflect the relationship between the transverse diameters of actual tomatoes and tomato images, and a classifier between large, medium and small tomatoes was produced based on the transverse diameter. Finally, a comprehensive tomato classifier was built based on the color, shape and size diameters. The experimental results show that the mean grading accuracy of the proposed method was 90.7%. This means our method can achieve automated real-time grading of tomatoes. [ABSTRACT FROM AUTHOR]

The recent progress in photon-counting detector technology using high-Z semiconductor sensors provides new possibilities for spectral x-ray imaging. The benefits of the approach to extract spectral information directly from measurements in the projection domain are very advantageous for material science studies with x-rays as polychromatic artifacts like beam-hardening are handled properly. Since related methods require accurate knowledge of all energy-dependent system parameters, we utilize an adapted semi-empirical model, which relies on a simple calibration procedure. The method enables a projection-based decomposition of photon-counting raw-data into basis material projections. The objective of this paper is to investigate the method’s performance applied to x-ray micro-CT with special focus on applications in material science and non-destructive testing. Projection-based dual-energy micro-CT is shown to be of good quantitative accuracy regarding material properties such as electron densities and effective atomic numbers. Furthermore, we show that the proposed approach strongly reduces beam-hardening artifacts and improves image contrast at constant measurement time. [ABSTRACT FROM AUTHOR]

Image segmentation applied to medical image analysis is still a critical and important task. Although there exist several segmentation algorithms that have been widely studied in literature, these are subject to segmentation problems such as over- and under-segmentation as well as non-closed edges. In this paper, a simple method that combines well-known segmentation algorithms is presented. This method is applied to detect acid-fast bacilli (AFB) in bacilloscopies used to diagnose pulmonary tuberculosis (TB). This diagnosis can be performed through different tests, and the most used worldwide is smear microscopy because of its low cost and effectiveness. This diagnosis technique is based on the analysis and counting of the bacilli in the bacilloscopy observed under an optical microscope. The proposed method is used to segment the bacilli in digital images from bacilloscopies processed using Ziehl-Neelsen (ZN) staining. The proposed method is fast, has a low computational cost and good efficiency compared to other methods. The bacilli image segmentation is performed by image processing and analysis techniques, probability concepts and classifiers. In this work, a Bayesian classifier based on a Gaussian mixture model (GMM) is used. The segmentations' results are validated by using the Jaccard index, which indicates the efficiency of the classifier. [ABSTRACT FROM AUTHOR]

Microscopic examination of peripheral blood plays an important role in the field of diagnosis and control of major diseases. Peripheral leukocyte recognition by manual requires medical technicians to observe blood smears through light microscopy, using their experience and expertise to discriminate and analyze different cells, which is time-consuming, labor-intensive and subjective. The traditional systems based on feature engineering often need to ensure successful segmentation and then manually extract certain quantitative and qualitative features for recognition but still remaining a limitation of poor robustness. The classification pipeline based on convolutional neural network is of automatic feature extraction and free of segmentation but hard to deal with multiple object recognition. In this paper, we take leukocyte recognition as object detection task and apply two remarkable object detection approaches, Single Shot Multibox Detector and An Incremental Improvement Version of You Only Look Once. To improve recognition performance, some key factors involving these object detection approaches are explored and the detection models are generated using the train set of 14,700 annotated images. Finally, we evaluate these detection models on test sets consisting of 1,120 annotated images and 7,868 labeled single object images corresponding to 11 categories of peripheral leukocytes, respectively. A best mean average precision of 93.10% and mean accuracy of 90.09% are achieved while the inference time is 53 ms per image on a NVIDIA GTX1080Ti GPU. [ABSTRACT FROM AUTHOR]

A number of recent studies have shown that cell shape and cytoskeletal texture can be used as sensitive readouts of the physiological state of the cell. However, utilization of this information requires the development of quantitative measures that can describe relevant aspects of cell shape. In this paper we develop a toolbox, TISMorph, that calculates a set of quantitative measures to address this need. Some of the measures introduced here have been used previously, while others are new and have desirable properties for shape and texture quantification of cells. These measures, broadly classifiable into the categories of textural, irregularity and spreading measures, are tested by using them to discriminate between osteosarcoma cell lines treated with different cytoskeletal drugs. We find that even though specific classification tasks often rely on a few measures, these are not the same between all classification tasks, thus requiring the use of the entire suite of measures for classification and discrimination. We provide detailed descriptions of the measures, as well as the TISMorph package to implement them. Quantitative morphological measures that capture different aspects of cell morphology will help enhance large-scale image-based quantitative analysis, which is emerging as a new field of biological data. [ABSTRACT FROM AUTHOR]

Lifespan and healthspan machines can undergo C. elegans image segmentation errors due to changes in lighting conditions, which produce non-uniform images. Most C. elegans monitoring machines use backlight techniques based on the transparency of both the container and media. Backlight illumination obtains high-contrast images with dark C. elegans and a bright background. However, changes in illumination or media transparency conditions can produce non-uniform images, which are currently alleviated by image processing techniques. Besides, these machines should avoid C. elegans exposure to light as much as possible because light stresses worms, and can even affect their lifespan, mainly when using (1) long exposure times, (2) high intensities or (3) wavelengths that come close to ultraviolet. However, if short exposure of worms to light is required for visual monitoring, then light can also be used as a movement stimulus. In this paper, an active backlight method is analysed. The proposed method consists of controlling the light intensities and wavelengths of an illumination dots matrix with PID regulators. These regulators adapt illumination to some changing conditions. The experimental results shows that this method simplifies the image segmentation problem because it is able to automatically compensate not only changes in media transparency throughout assay days, but also changes in ambient conditions, such as smooth condensation on the lid and light derivatives of the illumination source during its lifetime. In addition, the strategic application of wavelengths could be adapted for the requirements of each assay. For instance, a specific control strategy has been proposed to minimise stress to worms and trying to stimulate C. elegans movement in lifespan assays. [ABSTRACT FROM AUTHOR]

Diffusion MRI derives its contrast from MR signal attenuation induced by the movement of water molecules in microstructural environments. Associated with the signal attenuation is the reduction of signal-to-noise ratio (SNR). Methods based on total variation (TV) have shown superior performance in image noise reduction. However, TV denoising can result in stair-casing effects due to the inherent piecewise-constant assumption. In this paper, we propose a tight wavelet frame based approach for edge-preserving denoising of diffusion-weighted (DW) images. Specifically, we employ the unitary extension principle (UEP) to generate frames that are discrete analogues to differential operators of various orders, which will help avoid stair-casing effects. Instead of denoising each DW image separately, we collaboratively denoise groups of DW images acquired with adjacent gradient directions. In addition, we introduce a very efficient method for solving an ℓ0 denoising problem that involves only thresholding and solving a trivial inverse problem. We demonstrate the effectiveness of our method qualitatively and quantitatively using synthetic and real data. [ABSTRACT FROM AUTHOR]

The traditional image mosaic result based on SIFT feature points extraction, to some extent, has distortion errors: the larger the input image set, the greater the spliced panoramic distortion. To achieve the goal of creating a high-quality panorama, a new and improved algorithm based on the A-KAZE feature is proposed in this paper. This includes changing the way reference image are selected and putting forward a method for selecting a reference image based on the binary tree model, which takes the input image set as the leaf node set of a binary tree and uses the bottom-up approach to construct a complete binary tree. The root node image of the binary tree is the ultimate panorama obtained by stitching. Compared with the traditional way, the novel method improves the accuracy of feature points detection and enhances the stitching quality of the panorama. Additionally, the improved method proposes an automatic image straightening model to rectify the panorama, which further improves the panoramic distortion. The experimental results show that the proposed method cannot only enhance the efficiency of image stitching processing, but also reduce the panoramic distortion errors and obtain a better quality panoramic result. [ABSTRACT FROM AUTHOR]

Many lab studies have shown that colors can evoke powerful emotions and impact human behavior. Might these phenomena drive how we act online? A key research challenge for image-sharing communities is uncovering the mechanisms by which content spreads through the community. In this paper, we investigate whether there is link between color and diffusion. Drawing on a corpus of one million images crawled from Pinterest, we find that color significantly impacts the diffusion of images and adoption of content on image sharing communities such as Pinterest, even after partially controlling for network structure and activity. Specifically, Red, Purple and pink seem to promote diffusion, while Green, Blue, Black and Yellow suppress it. To our knowledge, our study is the first to investigate how colors relate to online user behavior. In addition to contributing to the research conversation surrounding diffusion, these findings suggest future work using sophisticated computer vision techniques. We conclude with a discussion on the theoretical, practical and design implications suggested by this work—e.g. design of engaging image filters. [ABSTRACT FROM AUTHOR]

Digital imaging has become one of the most important techniques in environmental monitoring and exploration. In the case of the marine environment, mobile platforms such as autonomous underwater vehicles (AUVs) are now equipped with high-resolution cameras to capture huge collections of images from the seabed. However, the timely evaluation of all these images presents a bottleneck problem as tens of thousands or more images can be collected during a single dive. This makes computational support for marine image analysis essential. Computer-aided analysis of environmental images (and marine images in particular) with machine learning algorithms is promising, but challenging and different to other imaging domains because training data and class labels cannot be collected as efficiently and comprehensively as in other areas. In this paper, we present Machine learning Assisted Image Annotation (MAIA), a new image annotation method for environmental monitoring and exploration that overcomes the obstacle of missing training data. The method uses a combination of autoencoder networks and Mask Region-based Convolutional Neural Network (Mask R-CNN), which allows human observers to annotate large image collections much faster than before. We evaluated the method with three marine image datasets featuring different types of background, imaging equipment and object classes. Using MAIA, we were able to annotate objects of interest with an average recall of 84.1% more than twice as fast as compared to “traditional” annotation methods, which are purely based on software-supported direct visual inspection and manual annotation. The speed gain increases proportionally with the size of a dataset. The MAIA approach represents a substantial improvement on the path to greater efficiency in the annotation of large benthic image collections. [ABSTRACT FROM AUTHOR]

In order to retrieve similar trademarks from large-scale trademark databases, combining the characteristics of trademark images, this paper presents a trademark image retrieval method based on regional and border feature fusion. Based on the target image extraction, the proposed approach describes the target region and border features. The region feature description is mainly based on the concept of partition block statistics. The region is divided into equal-area unit using concentric circles, and feature extraction is performed in each small block unit. For the border feature description, this study first detect corners, and then construct a Delaunay graph and extract features by combining the corner detected and the Delaunay triangulation reconstruction. In the search process, the method also incorporates information such as the trademark's color characteristics, trademark classification, and trademark keywords. The present study carried out image retrieval experiment on CE-SHAPE-1 database containing 1400 MPEG-7 core experimental shape, a classification trademark database containing 2000 images, and a national trademark database containing approximately 4.89 million images. The experimental results show that the proposed approach combines the advantages of region and border feature description, and can choose the best among various local optimizations, which makes the retrieval result more effective, more in line with human visual perception, and improves the retrieval accuracy. [ABSTRACT FROM AUTHOR]

The number of images taken per patient scan has rapidly increased due to advances in software, hardware and digital imaging in the medical domain. There is the need for medical image annotation systems that are accurate as manual annotation is impractical, time-consuming and prone to errors. This paper presents modeling approaches performed to automatically classify and annotate radiographs using several classification schemes, which can be further applied for automatic content-based image retrieval (CBIR) and computer-aided diagnosis (CAD). Different image preprocessing and enhancement techniques were applied to augment grayscale radiographs by virtually adding two extra layers. The Image Retrieval in Medical Applications (IRMA) Code, a mono-hierarchical multi-axial code, served as a basis for this work. To extensively evaluate the image enhancement techniques, five classification schemes including the complete IRMA code were adopted. The deep convolutional neural network systems Inception-v3 and Inception-ResNet-v2, and Random Forest models with 1000 trees were trained using extracted Bag-of-Keypoints visual representations. The classification model performances were evaluated using the ImageCLEF 2009 Medical Annotation Task test set. The applied visual enhancement techniques proved to achieve better annotation accuracy in all classification schemes. [ABSTRACT FROM AUTHOR]

In the human retina, rod and cone cells detect incoming light with a molecule called rhodopsin. After rhodopsin molecules are activated (by photon impact), these molecules activate the rest of the signalling process for a brief period of time until they are deactivated by a multistage process. First, active rhodopsin is phosphorylated multiple times. Following this, they are further inhibited by the binding of molecules called arrestins. Finally, they decay into opsins. The time required for each of these stages becomes progressively longer, and each stage further reduces the activity of rhodopsin. However, while this deactivation process itself is well researched, the roles of the above stages in signal (and image) processing are poorly understood. In this paper, we will show that the activity of rhodopsin molecules during the deactivation process can be described as the fractional integration of an incoming signal. Furthermore, we show how this affects an image; specifically, the effect of fractional integration in video and signal processing and how it reduces noise and the improves adaptability under different lighting conditions. Our experimental results provide a better understanding of vertebrate and human vision, and why the rods and cones of the retina differ from the light detectors in cameras. [ABSTRACT FROM AUTHOR]

Saliency detection is widely used in many visual applications like image segmentation, object recognition and classification. In this paper, we will introduce a new method to detect salient objects in natural images. The approach is based on a regional principal color contrast modal, which incorporates low-level and medium-level visual cues. The method allows a simple computation of color features and two categories of spatial relationships to a saliency map, achieving higher F-measure rates. At the same time, we present an interpolation approach to evaluate resulting curves, and analyze parameters selection. Our method enables the effective computation of arbitrary resolution images. Experimental results on a saliency database show that our approach produces high quality saliency maps and performs favorably against ten saliency detection algorithms. [ABSTRACT FROM AUTHOR]

Synthetic fingerprints are a potential threat to automatic fingerprint identification systems (AFISs). In this paper, we propose an algorithm to discriminate synthetic fingerprints from real ones. First, four typical characteristic factors—the ridge distance features, global gray features, frequency feature and Harris Corner feature—are extracted. Then, a support vector machine (SVM) is used to distinguish synthetic fingerprints from real fingerprints. The experiments demonstrate that this method can achieve a recognition accuracy rate of over 98% for two discrete synthetic fingerprint databases as well as a mixed database. Furthermore, a performance factor that can evaluate the SVM's accuracy and efficiency is presented, and a quantitative optimization strategy is established for the first time. After the optimization of our synthetic fingerprint discrimination task, the polynomial kernel with a training sample proportion of 5% is the optimized value when the minimum accuracy requirement is 95%. The radial basis function (RBF) kernel with a training sample proportion of 15% is a more suitable choice when the minimum accuracy requirement is 98%. [ABSTRACT FROM AUTHOR]

In this paper, based on low-rank representation and eigenface extraction, we present an improvement to the well known Sparse Representation based Classification (SRC). Firstly, the low-rank images of the face images of each individual in training subset are extracted by the Robust Principal Component Analysis (Robust PCA) to alleviate the influence of noises (e.g., illumination difference and occlusions). Secondly, Singular Value Decomposition (SVD) is applied to extract the eigenfaces from these low-rank and approximate images. Finally, we utilize these eigenfaces to construct a compact and discriminative dictionary for sparse representation. We evaluate our method on five popular databases. Experimental results demonstrate the effectiveness and robustness of our method. [ABSTRACT FROM AUTHOR]