Search

Bipartite graphs widely exist in real-world scenarios and model binary relations like host-website, author-paper, and user-product. In bipartite graphs, a butterfly (i.e., $2\times 2$ 2 × 2 bi-clique) is the smallest non-trivial cohesive structure and plays an important role in applications such as anomaly detection. Considerable efforts focus on counting butterflies in static bipartite graphs. However, they suffer from high time and space complexity when the bipartite graph of interest is given as a stream of edges. Although there are methods for approximately counting butterflies from bipartite graph streams, they suffer from either low accuracy or high time complexity. Therefore, it is still a challenge to accurately estimate butterfly counts from bipartite graph streams in a short time. To address this issue, we develop novel algorithms by exploiting the bipartite nature, which subtly integrates sampling and sketching techniques. We provide accurate estimators for butterfly counts and derive simple yet exact formulas for bounding their errors. We also conduct extensive experiments on a variety of real-world large bipartite graphs. Experimental results demonstrate that our algorithms are up to 20.0 times more accurate and up to 286.3 times faster than state-of-the-art methods under the same memory usage. [ABSTRACT FROM AUTHOR]

Securing communication in our highly digitalized world has become a pressing issue due to the escalating threats of unauthorized data access and violations of network policies. Cryptographic techniques are employed to encrypt data for protection to address these challenges. However, a potential vulnerability arises during data transmission. Sophistic intruders may discern the encrypted information, leading to suspicions and unauthorized access. In response, steganography emerged as an alternative method for communication security. Steganography involves concealing confidential information within the codes of digital files, providing a unique approach that focuses on disguising the presence of communication to enhance data security. In this context, this paper introduces an enhanced information-hiding method implemented by utilizing image edges and modulus functions. This study provides a comparative analysis of various steganographic methods, highlighting the trade-offs between image quality, as evaluated by the Peak Signal-to-Noise Ratio (PSNR), and the payload size. The experimental results indicate that the proposed method has efficient data-hiding capabilities with minimum degradation in the quality of the resulting stego image. [ABSTRACT FROM AUTHOR]

While spin–orbit torque (SOT) devices are extensively investigated due to their potential for use in neural network computation, it remains challenging to explore the hardware for neural networks. In this paper, the field‐free memristive SOT switching of the CoPt single layer is used to propose a neuromorphic hardware circuit for detecting edges in images. Owing to its threefold symmetry of inversion, the polarity of SOT switching can be reversed by rotating the current by 60°. Moreover, the process of current‐induced SOT switching exhibits stable multi‐state magnetic switching behavior, and can be controllably tuned by using the pulse of the current. As the slope of the applied ramp pulse current increased, the wave of the anomalous Hall resistance changed from a curve with normally memristive property to trigonometric, and finally to cosine. The design of the hardware circuit for a single SOT device is subsequently formulated to detect the edges in images. The results of experiments verified the capability of this device to detect the edge lines in images with high accuracy, which confirms its potential for use in the hardware of neuromorphic computing platforms. The work here provides guidance for the application of SOT‐based devices to neuromorphic hardware. [ABSTRACT FROM AUTHOR]

Craters are among the most abundant features on the surface of many planets with great importance for planetary scientists. They reveal chronology information about planets and may be used for autonomous spacecraft navigation and landing. Although numerous research efforts have been carried out in the field of crater detection, existing crater detection algorithms (CDAs) are only helpful in a limited number of applications. A promising crater detection approach involves two main steps: 1) hypothesis generation (HG) and 2) hypothesis verification (HV). During HG, potential crater locations are detected. The validity of the hypothesized crater locations is then tested in a HV step. In this context, we discuss some commonly used algorithms for HG such as highlight-shadow region detection and Hough transform as well as our novel and enhanced algorithms based on interest point detection and convex grouping. A key objective of this paper is to analyze their performance while paying special attention to how they affect the accuracy of the verification step. To deal with different size craters, we focus on multiscale HG. For HV, we have chosen convolutional neural networks which have recently achieved state-of-the-art performance in many computer vision applications. Due to the variation of test sets in the literature, it is often challenging to compare the performance of different CDAs in a fair way. In this paper, we present a comprehensive performance evaluation and comparison of CDAs. Each algorithm has been trained/tested using common data sets generated by a systematic approach. [ABSTRACT FROM AUTHOR]

Due to the lack of distinctiveness to the background, robust monocular 6DOF pose tracking of less-distinct objects remains an important open problem. In this paper, we firstly analyze the object distinctiveness in the tracking process. Then, we propose a novel contour-part model based robust monocular pose tracking method for less-distinct objects. This paper uses the traditional contour feature for pose tracking in a novel strategy called contour part model. First, the contour part model is built by segmenting the projected contour rendered from the 3D model into contour segments of a certain length adaptively according to the Shi-Tomasi cornerness scores. Then, the correspondence is detected in the input image for each contour part by gradient orientation based template matching. Finally, pose tracking is achieved by solving the PnP problem. Experiment results on semi-synthetic and real images show that the proposed method performs better than the existing methods when pose tracking less-distinct objects and shows great robustness toward interference. Additionally, we combine the edge feature and the regional feature in a simple strategy. The overall performance of the fused method is boosted according to the experimental results on the RBOT dataset. The fact shows that the fusion of the edge and regional features has great potential for improving tracking performance. [ABSTRACT FROM AUTHOR]

This paper presents iRazor, a lightweight error detection and correction approach, to suppress the cycle time margin that is traditionally added to very large scale integration systems to tolerate process, voltage, and temperature variations. iRazor is based on a novel current-based detector, which is embedded in flip-flops on potentially critical paths. The proposed iRazor flip-flop requires only three additional transistors, yielding only 4.3% area penalty over a standard D flip-flop. The proposed scheme is implemented in an ARM Cortex-R4 microprocessor in 40 nm through an automated iRazor flip-flop insertion flow. To gain an insight into the effectiveness of the proposed scheme, iRazor is compared to other popular techniques that mitigate the impact of variations, through the analysis of the worst case margin in 40 silicon dies. To the best of the authors’ knowledge, this is the first paper that compares the measured cycle time margin and the power efficiency improvements offered by frequency binning and various canary approaches. Results show that iRazor achieves 26%–34% performance gain and 33%–41% energy reduction compared to a baseline design across the 0.6- to 1-V voltage range, at the cost of 13.6% area overhead. [ABSTRACT FROM AUTHOR]

With the coming of the Internet of Things (IoT) era, malware attacks targeting IoT networks have posed serious threats to users. Recently, the emerging of edge computing have paved the way for new data processing paradigms in IoT networks, but it is still a challenge for deploying malware detection systems on the IoT devices. This paper develops an IoT malware detection system based on trust hybrid user-edge evaluation, namely MDHE. This system decomposes a large and complex deep learning model into two parts, which are deployed on edge servers and end devices, respectively. Specifically, a trust evaluation mechanism is used to select the trusted devices to participate the model training. Moreover, we develop a private feature generation that leverages a graph mining technology to extract the subgraph features, which then are perturbed by leveraging the differential privacy technology to prevent user privacy from leaking. Finally, we reconstruct the perturbed features on edge server, and propose a Capsule Network (CapsNet) to identify malware. Experimental results show that MDHE can effectively detect malware. Specifically, it can reduce sensitive inference while maintaining the utility of data. [ABSTRACT FROM AUTHOR]

Image segmentation techniques are challenging to apply to large-size remote sensing imagery. Indeed, if the data to be processed are larger than the computer’s available memory, it must be split into smaller pieces. Without precaution, segmentation errors appear along the edges of these pieces. The goal of this paper is to present a tilewise processing method to overcome this issue for superpixel segmentation, applied in particular to the simple linear iterative clustering algorithm. Incidentally, tilewise methods allow for several pieces of the image to be processed simultaneously, which enables the deployment of these methods in a parallel processing environment. Estimations of the speed-up when using multiple processors are provided. Then, it is demonstrated that the result of the tilewise segmentation is equivalent to the segmentation of the complete image, with respect to a number of global unsupervised segmentation criteria. Finally, experimental results on a large-size Sentinel-2 time series validate the method’s feasibility. [ABSTRACT FROM AUTHOR]

The active contour model is a widely used technique for automatic object contour extraction. Existing methods based on this model can perform with high accuracy, even in the case of complex contours, but challenging issues remain, like the need for precise contour initialization for high curvature boundary segments or the handling of cluttered backgrounds. To deal with such issues, this paper presents a salient object extraction method, the first step of which is the introduction of an improved edge map that incorporates edge direction as a feature. The direction information in the small neighborhoods of image feature points is extracted, and the images’ prominent orientations are defined for direction-selective edge extraction. Using such improved edge information, we provide a highly accurate shape contour representation, which we also combine with texture features. The principle of the paper is to interpret an object as the fusion of its components: its extracted contour and its inner texture. Our goal in fusing textural and structural information is twofold: it is applied for automatic contour initialization, and it is also used to establish an improved external force field. This fusion then produces highly accurate salient object extractions. We performed extensive evaluations, which confirm that the presented object extraction method outperforms parametric active contour models and achieves higher efficiency than the majority of the evaluated automatic saliency methods. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) has evolved for building smart environments in a distributed system, where the data produced by IoT devices are transmitted through Edge computing devices to streamline the flow of traffic from IoT devices to a distributed network. In such a scenario, the attacker introduces many attacks to the edge before forwarding them to distributed servers. This necessitates intrusion detection systems for such environments to mitigate security attacks. This paper has projected a basis for characterization of intrusive behaviors in a distributed system based on the functional link neural nets response weighted-average and teaching–learning metaheuristic with elitism on weight-space. The proposed technique makes use of teaching–learning metaheuristic optimization to obtain suitable parameters for the functional link neural net. Furthermore, the processing of duplicate parameters is successfully avoided by using mutation operation. In addition to this, in this paper the proposed method is found to be more efficient in terms of computational burden. [ABSTRACT FROM AUTHOR]

In this paper, a low-complexity color interpolation algorithm is proposed for the very-large-scale integration (VLSI) implementation in real-time applications. The proposed novel algorithm consists of an edge detector, an anisotropic weighting model, and a filter-based compensator. The anisotropic weighting model is designed to catch more information in horizontal than vertical directions. The filter-based compensation methodology includes a Laplacian and spatial sharpening filters, which are developed to improve the edge information and reduce the blurring effect. In addition, the hardware cost was successfully reduced by hardware sharing and reconfigurable design techniques. The VLSI architecture of the proposed design achieves 200 MHz with 5.2-K gate counts, and its core area is 64~236~\mu m ^{\mathrm {\mathbf {2}}} synthesized by a 0.18- \mu $ m CMOS process. Compared with the previous low-complexity techniques, this paper not only reduces gate counts or power consumption by more than 8% or 91.7%, respectively, but also improves the average color peak signal-to-noise ratio quality by more than 1.6 dB. [ABSTRACT FROM PUBLISHER]

Multi-scale exposure fusion (MEF) is an efficient way to fuse differently exposed low dynamic range (LDR) images of a high dynamic range (HDR) scene into an information enriched LDR image. In this paper, a new MEF algorithm is proposed to merge the differently exposed LDR images by introducing novel content adaptive edge-preserving smoothing (CAS) pyramids for the weight maps of all the LDR images. With the proposed CAS pyramids, details in the brightest and darkest regions of the HDR scene are preserved better than existing MEF algorithms on top of the Gaussian pyramids and edge-preserving smoothing pyramids. Comparisons experimentally demonstrate the effectiveness of the proposed algorithm to nine state-of-the-art MEF algorithms from both subjective and objective points of view regardless the image sizes. [ABSTRACT FROM AUTHOR]

Structures matter in single image super-resolution (SISR). Benefiting from generative adversarial networks (GANs), recent studies have promoted the development of SISR by recovering photo-realistic images. However, there are still undesired structural distortions in the recovered images. In this paper, we propose a structure-preserving super-resolution (SPSR) method to alleviate the above issue while maintaining the merits of GAN-based methods to generate perceptual-pleasant details. First, we propose SPSR with gradient guidance (SPSR-G) by exploiting gradient maps of images to guide the recovery in two aspects. On the one hand, we restore high-resolution gradient maps by a gradient branch to provide additional structure priors for the SR process. On the other hand, we propose a gradient loss to impose a second-order restriction on the super-resolved images, which helps generative networks concentrate more on geometric structures. Second, since the gradient maps are handcrafted and may only be able to capture limited aspects of structural information, we further extend SPSR-G by introducing a learnable neural structure extractor (NSE) to unearth richer local structures and provide stronger supervision for SR. We propose two self-supervised structure learning methods, contrastive prediction and solving jigsaw puzzles, to train the NSEs. Our methods are model-agnostic, which can be potentially used for off-the-shelf SR networks. Experimental results on five benchmark datasets show that the proposed methods outperform state-of-the-art perceptual-driven SR methods under LPIPS, PSNR, and SSIM metrics. Visual results demonstrate the superiority of our methods in restoring structures while generating natural SR images. Code is available at https://github.com/Maclory/SPSR. [ABSTRACT FROM AUTHOR]

This paper proposes a multi-source data fusion algorithm for rail surface defect detection in both camera-based rail inspection images and ultrasound B-scan images. First, we design a rail surface segmentation algorithm based on image bilateral filtering, Sobel edge detection, and rail surface edge detection to extract the rail surface area. Second, we build a camera and ultrasound data fusion (CUFuse) model for rail surface defect detection, including two main networks: multi-source data feature extraction and multi-scale feature fusion networks. The multi-source data feature extraction network consists of two BoTNet 50 networks as feature extraction networks to extract five stages of features in camera-based images and ultrasound B-scan images. The multi-scale feature fusion network consists of five feature fusion modules to fuse the feature information output by the multi-source data feature extraction network. Finally, we use the CUFuse model to detect the rail surface defect dataset, and output five rail surface state types, including Light, Moderate, Severe, Normal, and Joint. The results show that the accuracy of the CUFuse model is 96.97%, which can accomplish the task of rail surface defect detection on railway sites. [ABSTRACT FROM AUTHOR]

Image smoothing is a fundamental procedure in applications of both computer vision and graphics. The required smoothing properties can be different or even contradictive among different tasks. Nevertheless, the inherent smoothing nature of one smoothing operator is usually fixed and thus cannot meet the various requirements of different applications. In this paper, we first introduce the truncated Huber penalty function which shows strong flexibility under different parameter settings. A generalized framework is then proposed with the introduced truncated Huber penalty function. When combined with its strong flexibility, our framework is able to achieve diverse smoothing natures where contradictive smoothing behaviors can even be achieved. It can also yield the smoothing behavior that can seldom be achieved by previous methods, and superior performance is thus achieved in challenging cases. These together enable our framework capable of a range of applications and able to outperform the state-of-the-art approaches in several tasks, such as image detail enhancement, clip-art compression artifacts removal, guided depth map restoration, image texture removal, etc. In addition, an efficient numerical solution is provided and its convergence is theoretically guaranteed even the optimization framework is non-convex and non-smooth. A simple yet effective approach is further proposed to reduce the computational cost of our method while maintaining its performance. The effectiveness and superior performance of our approach are validated through comprehensive experiments in a range of applications. Our code is available at https://github.com/wliusjtu/Generalized-Smoothing-Framework . [ABSTRACT FROM AUTHOR]

Community detection is one of the most fundamental problems in social network analysis, while most existing research focuses on unsigned graphs. In real applications, social networks involve not only positive relationships but also negative ones. It is important to exploit the signed information to identify more stable communities. In this paper, we propose a novel model, named stable $k$ k -core, to measure the stability of a community in signed graphs. The stable $k$ k -core model not only emphasizes user engagement, but also eliminates unstable structures. We show that the problem of finding the maximum stable $k$ k -core is NP-hard. To scale for large graphs, novel pruning strategies and searching methods are proposed. We conduct extensive experiments on 6 real-world signed networks to verify the efficiency and effectiveness of proposed model and techniques. [ABSTRACT FROM AUTHOR]

Continuous and accurate depth information of blast furnace burden surface is important for optimizing charging operations, thereby reducing its energy consumption and CO2 emissions. However, depth estimation for a single image is challenging, especially when estimating the depth of burden surface images in the harsh internal environment of the blast furnace. In this paper, a novel method that is based on edge defocus tracking is proposed to estimate the depth of burden surface images with different morphological characteristics. First, an endoscopic video acquisition system is designed, key frames of burden surface video in stable state are extracted based on feature point optical flow method, and the sparse depth is estimated by using the defocus-based method. Next, the burden surface image is divided into four subregions according to the distribution characteristics of the burden surface, the edge line trajectories and an eight-direction depth gradient template are designed to develop depth propagation rules. Finally, the depth is propagated from edge to the entire image based on edge line tracking method. The experimental results show that the proposed method can accurately and efficiently estimate the depth of the burden surface and provide key data support for optimizing the operation of blast furnace. [ABSTRACT FROM AUTHOR]

Community search that finds query-dependent communities has been studied on various kinds of graphs. As one instance of community search, intimate-core group (community) search over a weighted graph is to find a connected $k$ k -core containing all query nodes with the smallest group weight. However, existing state-of-the-art methods start from the maximal $k$ k -core to refine an answer, which is practically inefficient for large networks. In this paper, we develop an efficient framework, called local exploration k-core search (LEKS), to find intimate-core groups in graphs. We propose a small-weighted spanning tree to connect query nodes, and then expand the tree level by level to a connected $k$ k -core, which is finally refined as an intimate-core group. In addition, to support the intimate group search over large weighted graphs, we develop a weighted-core index (WC-index) and two new WC-index-based algorithms for expansion and refinement phases in LEKS. Specifically, we propose a WC-index-based expansion to efficiently find a candidate graph of intimate-core group, leveraging on a two-level expansion of $k$ k -breadth and 1-depth. We propose two graph removal strategies: coarse-grained refinement is designed for large graphs to delete a batch of nodes in a few iterations; fine-grained refinement is designed for small graphs to remove nodes carefully and achieve high-quality answers. Extensive experiments on real-life networks with ground-truth communities validate the effectiveness and efficiency of our proposed methods. [ABSTRACT FROM AUTHOR]

This paper proposes LinkBlackHole$^{*}$*, a novel algorithm for finding communities that are (i) overlapping in nodes and (ii) mixing (not separating clearly) in links. There has been a small body of work in each category, but this paper is the first one that addresses both. LinkBlackHole$^{*}$* is a merger of our earlier two algorithms, LinkSCAN$^{*}$* and BlackHole, inheriting their advantages in support of highly-mixed overlapping communities. The former is used to handle overlapping nodes, and the latter to handle mixing links in finding communities. Like LinkSCAN and its more efficient variant LinkSCAN$^{*}$*, this paper presents LinkBlackHole and its more efficient variant LinkBlackHole$^{*}$*, which reduces the number of links through random sampling. Thorough experiments show superior quality of the communities detected by LinkBlackHole$^{*}$* and LinkBlackHole to those detected by other state-of-the-art algorithms. In addition, LinkBlackHole$^{*}$* shows high resilience to the link sampling effect, and its running time scales up almost linearly with the number of links in a network. [ABSTRACT FROM AUTHOR]

Autonomous vehicles are expected to significantly enhance the human mobility. However, recently researchers have discovered and demonstrated some attacks on vehicles, which have caused a panic among the public. Furthermore, these attacks have demonstrated that the security issue is still one of the major challenges of vehicles. In this paper, we propose a novel edge computing based anomaly detection, coined edge computing based vehicle anomaly detection (EVAD), which exploits edge based sensor data fusion to identify the anomaly events. The time domain property, i.e., the correlation between different intra-vehicle sensors, and the frequency domain property of sensor data are utilized to judge whether an anomaly has occurred within the vehicle. Especially, to reduce the computation overhead and improve the performance, multiple sensors will be organized as ring architecture, which is a tradeoff of detection accuracy and complexity. In addition, the major components (e.g., anomaly detection module) of EVAD are embedded in edge computing devices, which make the anomaly detection be more efficient and privacy preserving. Meanwhile, a more appropriate model is generated on the cloud server, of which computation overhead maybe heavy for edge computing devices. This paper evaluates the performance of EVAD under different scenarios, and the experimental results demonstrate its feasibility and efficiency. The average true positive rate achieves 99.5% with 1% false positive rate. [ABSTRACT FROM AUTHOR]

Detection of small targets, more specifically cars, in aerial images of urban scenes, has various applications in several domains, such as surveillance, military, remote sensing, and others. This is a tremendously challenging problem, mainly because of the significant interclass similarity among objects in urban environments, e.g., cars and certain types of nontarget objects, such as buildings’ roofs and windows. These nontarget objects often possess very similar visual appearance to that of cars making it hard to separate the car and the noncar classes. Accordingly, most past works experienced low precision rates at high recall rates. In this paper, a novel framework is introduced that achieves a higher precision rate at a given recall than the state of the art. The proposed framework adopts a sliding-window approach and it consists of four stages, namely, window evaluation, extraction and encoding of features, classification, and postprocessing. This paper introduces a new way to derive descriptors that encode the local distributions of gradients, colors, and texture. Image descriptors characterize the aforementioned cues using adaptive cell distributions, wherein the distribution of cells within a detection window is a function of its dominant orientation, and hence, neither the rotation of the patch under examination nor the computation of descriptors at different orientations is required. The performance of the proposed framework has been evaluated on the challenging Vaihingen and Overhead Imagery Research data sets. Results demonstrate the superiority of the proposed framework to the state of the art. [ABSTRACT FROM PUBLISHER]

This paper presents an online highly accurate system for automatic number plate recognition (ANPR) that can be used as a basis for many real-world ITS applications. The system is designed to deal with unclear vehicle plates, variations in weather and lighting conditions, different traffic situations, and high-speed vehicles. This paper addresses various issues by presenting proper hardware platforms along with real-time, robust, and innovative algorithms. We have collected huge and highly inclusive data sets of Persian license plates for evaluations, comparisons, and improvement of various involved algorithms. The data sets include images that were captured from crossroads, streets, and highways, in day and night, various weather conditions, and different plate clarities. Over these data sets, our system achieves 98.7%, 99.2%, and 97.6% accuracies for plate detection, character segmentation, and plate recognition, respectively. The false alarm rate in plate detection is less than 0.5%. The overall accuracy on the dirty plates portion of our data sets is 91.4%. Our ANPR system has been installed in several locations and has been tested extensively for more than a year. The proposed algorithms for each part of the system are highly robust to lighting changes, size variations, plate clarity, and plate skewness. The system is also independent of the number of plates in captured images. This system has been also tested on three other Iranian data sets and has achieved 100% accuracy in both detection and recognition parts. To show that our ANPR is not language dependent, we have tested our system on available English plates data set and achieved 97% overall accuracy. [ABSTRACT FROM PUBLISHER]

Wafer-level direct bonding technology is a key process for the production of backside illuminated (BSI) CMOS image sensor (CIS). Usually, constant-depth mode scanning acoustic microscope (C-SAM) 300mm wafer images are acquired and defect size distribution is provided to monitor defects that degrade bonding yield. This acquisition technique is used as it is nondestructive and is able to capture the full wafer. Current solutions are not providing information detailed enough to identify the root cause of this degradation. A consequence is that most measurements and classification is currently done manually which take time and have reproducibility issues. In this paper, we propose a rule-based method for the classification of the defects and automatic segmentation of the defects to extract precise measurements depending on the type of defect. The classes of defects are precisely defined based on their origin in the process. All these information will allow to reduce the time to analyze the images and improve the precision and consistency of the analysis. These results will allow to identify more precisely the defects thus the causes of yield degradation during bonding process. [ABSTRACT FROM AUTHOR]

Recent years have seen deep learning algorithms such as Convolutional Neural Networks (CNNs) and their variants achieving competitive performance in the application of medical image processing. Yet their shortcomings are: (i) the need of a large collection of annotated data, and (ii) the involvement of careful design of CNN layers. In this paper, we presented a novel polyp detection architecture based on two ideas: (i) to use Conditional Generative Adversarial Network (CGAN) to expand the training datasets, specifically the Generator takes advantage of the Efficient Spatial Pyramid (ESP) and the Discriminator is based on the PatchGAN; (ii) to modify the architecture of YOLOv4 using dilated convolution and skip connections. Experiments were performed using three publicly available datasets, i.e., CVC-ClinicDB, CVC-ColonDB, and ETIS-Larib Polyp DB. Experimental results showed that our generative network outperformed U-Net and can synthesize more realistic polyp images. The modified YOLOv4 significantly improved the performance of polyp detection using the expanded dataset, with an accuracy of 92.37% and a detection rate of 17.2 frames per second. [ABSTRACT FROM AUTHOR]

A key challenge of image splicing detection is how to localize integral tampered regions without false alarm. Although current forgery detection approaches have achieved promising performance, the integrality and false alarm are overlooked. In this paper, we argue that the insufficient use of splicing boundary is a main reason for poor accuracy. To tackle this problem, we propose an Edge-enhanced Transformer (ET) for tampered region localization. Specifically, to capture rich tampering traces, a two-branch edge-aware transformer is built to integrate the splicing edge clues into the forgery localization network, generating forgery features and edge features. Furthermore, we design a feature enhancement module to highlight the artifacts of the edge area in forgery features and assign weight values to the resulting tensor in spatial domain for vital signal strengthening and noise suppression. Extensive experimental results on CASIA v1.0, CASIA v2.0 and NC2016 demonstrate that the proposed method can accurately localize tampered regions in both pixel and edge levels and outperforms state-of-the-art methods. [ABSTRACT FROM AUTHOR]

The superimposed text in color images is an important clue to help understand the content of the image. Extracting and translating it into a familiar language is a hot research topic in the current image field. However, because the background of the image is usually complicated, effective text extraction and restoration is very challenging. In view of the above problems, this paper proposes an English text repair and extraction algorithm for color images based on improved edge detection algorithm. Firstly, the text of the color image is repaired by the sample block-based method. Secondly, the traditional edge-based detection method is improved, and the image is grayed out, and the edge detection is performed to obtain the candidate text area. Then, using the restrictive conditions such as text color and size, the text area is filtered out to extract the target text. Finally, the text information embedded in the extracted processed color image is translated into the target language. The experimental results show that the proposed algorithm has higher accuracy and faster computing speed, and achieves a better comprehensive effect. It further illustrates the extraction of English text by image processing technology, which can facilitate machine translation. [ABSTRACT FROM AUTHOR]

Due to more or less deviations in the imaging system, there will be noise in the image, which makes the image segmentation inaccurate. To divide a natural image into a more accurate binary image, the target and background of the image are effectively separated to achieve a more effective segmentation result. Therefore, this paper proposes an image segmentation algorithm combining a saliency map and neutrosophic set (NS) theory. First, to overcome the problem of weak edges in the image, we highlight the details and use the guided filter to filter the various channels of the natural image. Then, the initial saliency map is generated. After the weighted superposition of the initial saliency map, the local entropy map and the gray scale map, the final saliency map can be generated using the nonlinear function, and it can effectively highlight the foreground information of the image. Second, the saliency map is transformed to the NS domain and interpreted by three subsets: true (T), indeterminate (I), and false (F). According to NS theory, the indeterminacy is reduced, and the segmentation results are finally obtained by using the method of threshold. Various experiments were done and compared with other state-of-the-art approaches. These experiments demonstrate the effect of the proposed work, which is fast and effective for de-noising. [ABSTRACT FROM AUTHOR]

The light field information would be captured through light field cameras and in different directions regarding 3D image view recordings. In this paper, in order to increase the spatio-angular super-resolution quality and to decrease the reconstruction error regarding the light field information, we use a graph-based light field super-resolution strategy. Accordingly, in order to apply the complementary data in the light field views, we use a graph regularizer for the total recovery of the information and an edge-preserving technique that represents an isometry between curves in the 2D manifold and 5D space of the RGB image views. Moreover, the reconstruction of the light field information is based on applying the alternating direction method of multipliers (ADMM) algorithm. Accordingly, a recent enhanced ADMM model has been used in this paper which is denominated as “Plug-and-Play” and permits the user to plug an image reconstruction technique and a denoising methodology as the first and second sub-problems respectively. On that account, we would be able to resolve the light field super-resolution problem considering the graph-based light field structure as the first sub-problem and the edge-preserving technique as the denoising methodology. Consequently, by applying the proposed super-resolution strategy, the super-resolved light field outcome would be more favorable in terms of visual quality and reconstruction errors in comparison with other state-of-the-art methodologies. [ABSTRACT FROM AUTHOR]

Haze has a serious impact on the outdoor optical imaging systems, and it will result in image blurring, color shift, and saturation reduction. Recently, many single image dehazing algorithms have been proposed for practical applications, such as surveillance. However, since the widely-used global atmospheric light in image dehazing fails to well describe the local illumination differences of images, these algorithms fail to well adapt to scenes with different haze concentrations and lighting conditions. Therefore, this paper proposes an adaptive single image dehazing algorithm using joint local-global illumination adjustment. A local illumination estimation for hazy image is proposed to replace the global atmospheric light constant in the atmospheric scattering model, and it can better adapt to the local differences of image illumination. Correspondingly, the global atmospheric light constant is proposed to be utilized to adaptively compensate the illumination intensity, which may better overcome the dark illumination problem within the dehazed image. The experimental results demonstrate that the proposed algorithm can outperform the state-of-the-art algorithms in terms of not only the dehazing effect but also the adaptability. [ABSTRACT FROM AUTHOR]

In order to improve the accuracy of sub-pixel grayscale centroid extraction for noise-containing spot images, an image denoising method based on low-rank and sparse decomposition (LRSD) was proposed in this paper. Relative total variation (RTV) was introduced into the method on the basis of the weighted nuclear norm minimization (WNNM) model to construct a new RTV-WNNM model, so as to enhance the denoising accuracy and detail-preserving capability of LRSD method. Alternating direction multiplier method (ADMM) was used to solve this convex problem iteratively. Moreover, in view that the existing LRSD denoising method had insufficient detail-preserving capability, an adaptive selection method of LRSD singular value threshold based on the improved elitist clone selection algorithm (ECSA) was also raised in this paper. The constructed RTV-WNNM model taken as the objective function, the improved ECSA could realize equilibrium between search in depth and optimization in breadth through the adaptive chaotic mutation operator and antibody reselection strategy based on antibody concentration and antigen affinity moment. Furthermore, it could reach rapid self-adaption to acquire a low-rank threshold and then form an image denoising fusion algorithm, which had both denoising and detail-preserving capabilities. Simulation and experimental results show that the proposed method can reach better results in both quantity measure and visual quality than the state-of-the-art image denoising methods, and it has also remarkably improved the accuracy of sub-pixel grayscale centroid extraction for noise-containing spot images. [ABSTRACT FROM AUTHOR]

Fasteners are an important part of railway security. The application of computer vision and image processing on fastener detection has become a research hot spot. However, most of the researches have focused on the missing and damage detection of fasteners up to now. In this paper, a method based on image processing is proposed to locate the center of the hexagon nut in the railway fastener. The precise position of the hexagon nut can be used for the automatic replacement of the nut, which is of great significance for the automatic railway construction and maintenance. The locating method proposed in this paper can be divided into two steps. First, the improved Canny detector which combines surrounding suppression and iterative excitation is used to extract the contours of the fastener. Then, a multifeature hierarchical locating (MHL) algorithm is proposed, which integrates the circle contour of the gasket and the hexagon features of the nut. The experimental results show that the improved Canny detector suppresses noises effectively and highlights the contours of fastener. The MHL algorithm in the next step improves the locating accuracy remarkably while guaranteeing the robustness meantime. [ABSTRACT FROM AUTHOR]

Robust vanishing point estimation has been widely applied to various applications in the field of computer vision and pattern recognition for robotics, advanced driver assistance systems, and autonomous driving vehicles. The major challenge for vanishing point detection lies in line segments, spurious vanishing candidate removal, and clustering for refinement. Recent vanishing point detection approaches have attempted to reduce the computational complexity involved with voting processes using optimized voter selection strategies to identify the vanishing point from line segments. This paper proposes a novel vanishing point detection method to select robust candidates, applying optimized minimum spanning tree-based clustering of the vanishing point candidates by analyzing the lines within a unit sphere domain. The proposed scheme was applied to an open database that included illumination, partial occlusion, and viewpoint changes to validate robustness without prior scene information. [ABSTRACT FROM AUTHOR]

Vision-based unstructured road following is a challenging task due to the nature of the scene. This paper describes a novel algorithm to improve the accuracy and robustness of vanishing point estimation with very low computational cost. The novelties of this paper are three aspects: 1) We use joint activities of four Gabor filters and confidence measure for speeding up the process of texture orientation estimation. 2) Misidentification chances and computational complexity of the algorithm are reduced by using a particle filter. It limits vanishing point search range and reduces the number of pixels to be voted. The algorithm combines the peakedness measure of vote accumulator space with the displacements of moving average of observations to regulate the distribution of vanishing point candidates. 3) Attributed to the design of a noise-insensitive observation model, the proposed system still has high detection accuracy even when less than 60 sparsely distributed vanishing point candidates are used for voting as the influence introduced by the stochastic measurement noise of vote function and the sparsity of the vanishing point candidates is reduced. The method has been implemented and tested over 20 000 video frames. Experimental results demonstrate that the algorithm achieves better performance than some state-of-the-art texture-based vanishing point detection methods in terms of detection accuracy and speed. [ABSTRACT FROM PUBLISHER]

Dam surface displacement measurement can monitor the safety of dam operation and provide early warning for dam accidents. This paper proposes a method for measuring the displacement of the dam surface based on double vision sensors. Mathematical morphology is combined with the Roberts edge detection operator to complete the sub-pixel extraction of the marker edge. The method makes the edge of the marker in the image smoother compared with the Zernike moment sub-pixel edge detection algorithm. The edge gray center of gravity method is proposed to realize the positioning of the marker, which improves the precision of the vision measurement method. Additionally, this paper proposes the design of a test system and describes the experiments conducted in this study. The results revealed that the proposed method can achieve millimeter-level measurement accuracy and has the advantages of simple operation, short measurement period, online monitoring, and low cost, which satisfies the requirements for measuring the dam surface displacement. [ABSTRACT FROM AUTHOR]

In recent years, many deep-network-based super-resolution techniques have been proposed and have achieved impressive results for 2 ${\times }$ and higher magnification factors. However, lower magnification factors encountered in some industrial applications have not received special attention, such as 720P-to-1080P (1.5 ${\times }$ magnification). Compared to traditional 2 ${\times }$ or higher magnification factors, these lower magnifications are much simpler, but reconstructions of high-definition images are time-consuming and computationally complex. Hence, in this paper, a fast image upsampling method is designed specifically for industrial applications at low magnification. In the proposed method, edge and nonedge areas are first distinguished and then reconstructed via different fast approaches. For the edge area, a local edge pattern encoding-based method is presented to recover sharp edges. For the nonedge area, a global iterative reconstruction with texture constraint is utilized. Moreover, some acceleration strategies are also presented to further reduce the complexity. The experimental results demonstrate that the proposed method can obtain performance comparable to that of some state-of-the-art methods for 720P-to-1080P magnification, but the computational cost is much lower. [ABSTRACT FROM AUTHOR]

Selective laser annealing system was developed to realize fabrications of low-temperature poly-Si thin-film transistors (TFTs) even for large substrate, while the conventional excimer laser annealing system has the limitation in substrate size due to the difficulty in obtaining uniform beam line. In this paper, this new system was applied to fabricate poly-Si TFTs, using two laser exposure methods such as the static exposure and the scan exposure. Grain size increased as the laser energy density increased, and TFTs with the field-effect mobility larger than 100 cm2V−1s−1 with the ON– OFF ratio of drain current of approximately 106 could be obtained. Furthermore, for the scan exposure, periodic grain structure was observed resulting from the lateral solidification. In this condition, variations of electrical properties of TFT could be reduced compared to the case of the static exposure. [ABSTRACT FROM AUTHOR]

The advent of depth sensing technologies means that the extraction of object contours in images—a common and important pre-processing step for later higher level computer vision tasks like object detection and human action recognition—has become easier. However, captured depth images contain acquisition noise and the detected contours suffer from errors as a result. In this paper, we propose to jointly denoise and compress detected contours in an image for bandwidth-constrained transmission to a client, who can then carry out aforementioned application-specific tasks using the decoded contours as input. First, we prove theoretically that in general a joint denoising/compression approach can outperform a separate two-stage approach that first denoises then encodes contours lossily. Adopting a joint approach, we propose a burst error model that models typical errors encountered in an observed string of directional edges. We then formulate a rate-constrained maximum a posteriori problem that trades off the posterior probability of an estimated string given with its code rate. We design a dynamic programming algorithm that solves the posed problem optimally, and propose a compact context representation called total suffix tree that can reduce complexity of the algorithm dramatically. To the best of our knowledge, we are the first in the literature to study the problem of joint denoising/compression of image contours and offer a computation-efficient optimization algorithm. Experimental results show that our joint denoising/compression scheme can reduce bitrate by up to 18% compared with a competing separate scheme at comparable visual quality. [ABSTRACT FROM AUTHOR]

In this paper, an all-digital process-variation-calibrated high-performance timing generator for an automatic test equipment is proposed. The proposed timing generator generates process-variation-tolerant variable delays for high and wide-range testing clock frequency. In order to increase the testing clock frequency, a channel of the proposed timing generator consists of four subtiming generators operating in parallel. In addition, to improve process variation robustness, a precise eight-phase generator consisting of an accurate reference generator and a phase generator with dual-loop calibration (CAL) is proposed, and a phase error of less than 1.21° is achieved. Dynamic and static CAL techniques are also adopted in the edge vernier. A prototype chip having eight channels is fabricated using 0.13- \mu \textm CMOS technology. The proposed timing generator has an arbitrary test cycle frequency of up to 1.2 GHz, a timing resolution of 1.95 ps, a power consumption of 90 mW, and an area of 1.5 mm2. [ABSTRACT FROM AUTHOR]

Fast and accurate visual scene understanding in autonomous vehicles is necessary but still very challenging. An autonomous vehicle must be taught to read the road like a human driver for better controlling the vehicle, so it is important to efficiently detect the road area and road markings. In this paper, we mainly focus on the vanishing point detection and its application in inverse perspective mapping (IPM) for road marking understanding. We first propose a fast and accurate vanishing point detection method for various types of roads, by adopting and improving Weber local descriptor to obtain salient representative texture and orientation information of the road area, and then voting for the dominant vanishing point with a simple line-voting scheme. Experimental results demonstrate that the proposed vanishing point detection approach gains a better performance than some state-of-the-art methods in terms of accuracy and computation time. Furthermore, we introduce the detected vanishing point into the IPM algorithm in the structured road environment, since some important calibration parameters can be automatically calculated by the vanishing point, especially on the rough road. Experiments also show that our proposed vanishing point-based IPM method is adaptive and accurate, which is conducive to the subsequent road marking detection and recognition. [ABSTRACT FROM AUTHOR]

Automatic test equipment must have high-precision and low-power pulse generators (PGs) for testing memory and device-under-test ICs. This paper describes a high-accuracy and wide-data-rate-range PG with a 10-ps time resolution. The PG comprises an edge combiner (EC) and a multiphase clock generator (MPCG). The EC can produce an arbitrary waveform through 32 phase outputs of the MPCG. The EC adopts a one/zero detector and phase selection logic to define an operational data rate range and a timing resolution, respectively. Therefore, the EC uses the phase selection logic to combine the period window of the one/zero detector with the MPCG output phases. The EC also uses a countdown counter for a wide operational range. In the MPCG, a multiphase oscillator (MPO) adopts a ring oscillator scheme with subfeedback loops to extend its maximum operational frequency. The MPO also uses a phase error corrector to reduce the output phase error resulting from process and layout mismatches. Thus, the PG can obtain high-accuracy waveforms owing to small phase errors. The test chip was implemented using a 0.13- \mu \textm CMOS process. The core area and power consumption of the PG were measured to be 250 \times 300 \,\,\mu \textm^2 and 18.7 mW, respectively. The data rate range of the PG was determined to be from 3.2 kHz to 893 MHz. The time resolution and average accuracy of the PG were measured to be 10 ps and ±0.3 LSB, respectively. [ABSTRACT FROM AUTHOR]

The automatic detection of buried threats in ground penetrating radar (GPR) data is an active area of research due to GPR's ability to detect both metal and nonmetal subsurface objects. Recent work on algorithms designed to distinguish between threats and nonthreats in GPR data has utilized computer vision methods to advance the state-of-the-art detection and discrimination performance. Feature extractors, or descriptors, from the computer vision literature have exhibited excellent performance in representing 2-D GPR image patches and allow for robust classification of threats from nonthreats. This paper aims to perform a broad study of feature extraction methods in order to identify characteristics that lead to improved classification performance under controlled conditions. The results presented in this paper show that gradient-based features, such as the edge histogram descriptor and the scale invariant feature transform, provide the most robust performance across a large and varied data set. These results indicate that various techniques from the computer vision literature can be successfully applied to target detection in GPR data and that more advanced techniques from the computer vision literature may provide further performance improvements. [ABSTRACT FROM PUBLISHER]

In this paper, we present a fast and robust visual-inertial odometry (VIO) algorithm, which realizes the tight coupling of monocular visual odometry (VO) and low-cost inertial measurement unit (IMU). Aiming at the problem of tracking loss caused by the interference of moving objects or blurred images in the traditional VIO algorithm, a sparse optical flow method combining edge detection algorithms is proposed. In the image preprocessing, Laplace edge detection is performed on the original image first, and an area with the most texture is searched according to the sharpened image. When tracking feature points with the sparse optical flow method, the feature points within the searched area are used as the main tracking targets to reduce the impact because of some unclear part in the image on the visual front-end. The trust region dogleg method is used for non-linear optimization in the back-end of the VIO system. The effectiveness of the proposed VIO system is validated on the public data set named EuRoC MAV and compared with the advanced VIO algorithm in recent years. Experimental results show that the new VIO system proposed in this paper has good robustness and can be applied to complex scenes such as fast motion, lighting changes, lack of features, and image blur. Compared with the traditional VIO algorithm, the pose estimation speed of the proposed VIO algorithm can be improved by 10% or more. [ABSTRACT FROM AUTHOR]

As the extension of high efficiency video coding (HEVC) standard, three dimensional-HEVC (3D-HEVC) is the latest 3D video coding standard. 3D-HEVC adopts many complicated coding algorithms to generate additional intermediate views for 3D video representation, which result in extremely high coding complexity. Therefore, this paper proposed a fast depth intra coding approach to reduce the 3D-HEVC complexity, which is based on convolutional neural network (CNN). First, we established a database based on the independent view of the depth map, which includes coding unit (CU) partition data of the depth map. Second, we constructed a depth edge classification CNN (DEC-CNN) framework to classify the edges for the depth map and embedded the network into a 3D-HEVC test platform. Finally, we utilized the pixel value of the binarized depth image to correct the above classification results. The experimental results demonstrated that our approach can reduce the intra coding time by 72.5% on average under negligible degradation of coding performance. This result outperforms the other state-of-the-art methods to reduce the coding complexity of 3D-HEVC. [ABSTRACT FROM AUTHOR]

The identification of biotic stress of rice crops using handheld sensing devices is a challenge, as computationally intensive machine learning models are difficult to be executed in these devices. This challenge is exacerbated in farmers’ fields located in remote regions with limited internet connectivity. Thus, an individualiased plant-specific solution to detect biotic stress due to crop infections is required in farms adopting digital agricultural practices. The existing biotic stress detection solutions are deficient in their ability to make decisions in real-time. It is required to have a system that is capable of making decisions at the edge in handheld devices having limited computational capability. This paper proposes RiceBioS, an AI-based deep learning-enabled handheld device for identifying biotic stress in rice crops using the computational capabilities of handheld devices. RiceBioS adopts Edge-as-a-Service (EaaS) as an approach for classifying rice crop images into two categories – healthy and stressed. The biotic stress condition is further diagnosed into two types of infections, fungal (rice blast) and bacterial (bacterial leaf blight of rice) by pruning the shrunk deep learning classification model and incorporating an automated RoI detection and feature extraction workflow, which makes use of adaptive thresholding and hierarchial masking techniques to perform dimensionality reduction. While RiceBioS demonstrates a test accuracy of 93.25%, it exhibits a negligible tradeoff on a smartphone after deployment. This cutting edge solution helps the farmers make informed decisions based on real-time insights provided by the user-friendly mobile application interface of RiceBioS. [ABSTRACT FROM AUTHOR]

Mobile image recognition services, which provide people with image recognition services through the cameras of mobile devices, are revolutionizing our lives. However, most existing cloud/edge-based approaches suffer from two major limitations, (i) Low recognition accuracy and high network bandwidth pressure, and (ii) Not easy to extract features based on currently available resources of mobile devices. In this paper, we propose a resource-aware feature extraction framework for mobile image recognition services. The proposed framework consists of discriminative feature extraction (DFE) and NestDFE algorithms. The DFE algorithm can generate an extractor ${{\mathbf E}}$ E to extract discriminative features from the image data set on the edge server and images on mobile devices. Thus, the proposed framework can achieve higher recognition accuracy and require mobile devices to upload less feature data to the edge server. The NestDFE algorithm generates a single multi-capacity extractor that acts as a series of sub-extractors and enables mobile devices to dynamically select sub-extractors. Experimental results show that the proposed framework improves recognition accuracy by about 23 percent and reduces network traffic by about 76 percent compared with existing approaches. [ABSTRACT FROM AUTHOR]

In the area of change detection, there were a rare number of optimization methods. Most of the optimization methods that are used by change detection are morphological transformation or median filtering, which cannot best optimize change detection algorithm. In this paper, a general post-processing algorithm for change detection is proposed. We believe that some problems cannot be avoided in the area of change detection such as 1) region of moving object generated by change detection is slightly larger than the ground-truth and 2) there are always some disjoint and small regions that are independent from the moving objects. To address the problem, our method can optimize the change detection algorithm bases on the idea of edge detection, which can remove the wrong edge or pixel. In the experiments, more than 20 change detection algorithms that include the best algorithm in ChangeDetection.net are selected. Most of these change detection algorithms are optimized by the proposed method on PWC, Precision, and FMeasure, where, our optimized algorithm named FgSegNet_v2 is better than all other algorithms in the CDnet. The best-optimized margin of PWC is 0.64, and the fast speed is 548FPS on CPU. Our approach can better resolve the afore-mentioned problems that cannot be avoided and is general and fast. The experiments can be reproduced with C++ on Github https://github.com/walty19950301/CDA-contour-optimizer. [ABSTRACT FROM AUTHOR]