The main drawback of conventional filtering based methods for small dim target (SDT) detection is they could not guarantee sufficient suppression ability towards trivial high frequency component which belongs to backg...
详细信息
ISBN:
(纸本)9781479928941
The main drawback of conventional filtering based methods for small dim target (SDT) detection is they could not guarantee sufficient suppression ability towards trivial high frequency component which belongs to background, such as strong corners and edges. To overcome this bottleneck, this paper proposes an effective SDT detection algorithm by using local connectedness constraint. Our method provides direct control for target size, ensure high accuracy and could be easily embedded into the classical sliding-window based framework. The effectiveness of the proposed method is validated using images with cluttered background.
To obtain complementary information of difference image and gain a better change detection result, this paper proposes an unsupervised change detection algorithm. The technique is based on minimum spanning tree (MST) ...
详细信息
To obtain complementary information of difference image and gain a better change detection result, this paper proposes an unsupervised change detection algorithm. The technique is based on minimum spanning tree (MST) clustering. First of all, a normalized neighborhood ratio approach is adopted to obtain the difference image of two images acquired in the same geographical area at different moments. Then divide pixels into changed pixels, unchanged pixels and uncertain pixels according to gray difference histogram. Aiming at uncertain pixels, use minimum spanning tree algorithm twice to clustering: texture features and minimum spanning tree algorithm are used for first clustering, then calculate every clustering's average weight, and regarded first clustering results as nodes to calculate the minimum spanning tree again. Finally, on the basis of optimal objective function, the uncertain pixels belong to the two clusters: changed pixels and unchanged pixels. In this paper, the effectiveness of the algorithm is proved by numerical calculation. Mexico data accuracy is 99.01% and operation time is 8.49 s, Sardinia data accuracy is 98.62% and operation time is 8.49 s. Compared with the other three kinds of algorithms, the proposed algorithm can obtain higher detection accuracy and shorter running time.
The skeleton of an image object is a simplified representation, which is of great significance for the imagerecognition and matching. To obtain a smooth and accurate skeleton of a specified object in the gray image, ...
详细信息
In this paper, we investigate the Max-Cut problem and propose a probabilistic heuristic to address its classic and weighted version. Our approach is based on the Estimation of Distribution Algorithm (EDA) that creates...
详细信息
Graph models offer high representational power and useful structural cues. Unfortunately, tracking objects by matching graphs over time is in general NP-hard. Simple appearance-based trackers are able to find temporal...
Graph centrality has been extensively applied in Social Network Analysis to model the interaction of actors and the information flow inside a graph. In this paper, we investigate the usage of graph centralities in the...
详细信息
Identity-based Broadcast Encryption (IBBE) has the inherent key escrow problem that Private Key Generator (PKG) can fully determine the user's private key, which is an obstacle of the application of IBBE. The exis...
详细信息
Identity-based Broadcast Encryption (IBBE) has the inherent key escrow problem that Private Key Generator (PKG) can fully determine the user's private key, which is an obstacle of the application of IBBE. The existing approaches to solving key escrow problem need the user to submit identity to multiple PKGs or interactions between PKG and the user in the private key extraction phase. For Point-to-Multipoint Identity-based Broadcast Encryption (P2MIBBE) that the computing capabilities of receiver are limited, these approaches are impracticable. We propose a new approach what we call Augmented Broadcaster Identity-based Broadcast Encryption (ABIBBE). It requires neither multiple PKGs nor calculation of receiver in the private key extraction phase. We construct a universal scheme to realize AB-IBBE, such that any IND-ID-CPA secure IBBE scheme can be extended to an IND-ID-CPA secure AB-IBBE scheme.
Many existing methods for salient object detection are performed by over-segmenting images into non-overlapping regions, which facilitate local/global color statistics for saliency computation. In this paper, we propo...
详细信息
Many existing methods for salient object detection are performed by over-segmenting images into non-overlapping regions, which facilitate local/global color statistics for saliency computation. In this paper, we propose a new approach: spectral salient object detection, which is benefited from selected attributes of normalized cut, enabling better retaining of holistic salient objects as comparing to conventionally employed pre-segmentation techniques. The proposed saliency detection method recursively bi-partitions regions that render the lowest cut cost in each iteration, resulting in binary spanning tree structure. Each segmented region is then evaluated under criterion that fit Gestalt laws and statistical prior. Final result is obtained by integrating multiple intermediate saliency maps. Experimental results on three benchmark datasets demonstrate the effectiveness of the proposed method against 13 state-of-the-art approaches to salient object detection.
In this paper, we introduce a novel class of coplanar conics, the pencil of which can doubly contact to calibrate camera and estimate pose. We first analyze the properties of con-axes and con-eccentricity ellipses, wh...
详细信息
In this paper, we introduce a novel class of coplanar conics, the pencil of which can doubly contact to calibrate camera and estimate pose. We first analyze the properties of con-axes and con-eccentricity ellipses, which consist of a naturM extending pattern of concentric circles. Then the general case that two ellipses have two repeated complex intersection points is presented. This degenerate configuration results in a one-parameter family of homographies which map the planar pattern to its image. Although it is unable to compute the complete homography, an indirect 3-degree polynomial or 5-degree polynomial constraint on intrinsic parameters from one image can also be used for camera calibration and pose estimation under the minimal conditions. Furthermore, this nonlinear problem can be treated as a polynomial optimization problem (POP) and the global optimization solution can be also obtained by using SparsePOP (a sparse semidefinite programming relaxation of POPs), Finally, the experiments with simulated data and real images are shown to verify the correctness and robustness of the proposed technique.
Recently many graph-based salient region/object detection methods have been developed. They are rather effective for still images. However, little attention has been paid to salient region detection in videos. This pa...
详细信息
ISBN:
(纸本)9781479952106
Recently many graph-based salient region/object detection methods have been developed. They are rather effective for still images. However, little attention has been paid to salient region detection in videos. This paper addresses salient region detection in videos. A unified approach towards graph construction for salient object detection in videos is proposed. The proposed method combines static appearance and motion cues to construct graph, enabling a direct extension of original graph-based salient region detection to video processing. To maintain coherence in both intra- and inter-frames, a spatial-temporal smoothing operation is proposed on a structured graph derived from consecutive frames. The effectiveness of the proposed method is tested and validated using seven videos from two video datasets.
暂无评论