This paper presents an overview of various detection and estimation algorithms that have been implemented in the RADARSAT-2 MODEX Processor as well as experimental plans for the validation and demonstration of the spa...
详细信息
This paper presents an overview of various detection and estimation algorithms that have been implemented in the RADARSAT-2 MODEX Processor as well as experimental plans for the validation and demonstration of the space-based GMTI mode. Preliminary RADARSAT-2 GMTI results are also presented.
This paper analyzed the performance of a detection algorithm using MB-OFDM UWB receiver based on silent time when the victim signal is received by detection limit of -80 dBm/MHz proposed in Korea for DAA. Simulation r...
详细信息
ISBN:
(纸本)9781424425983
This paper analyzed the performance of a detection algorithm using MB-OFDM UWB receiver based on silent time when the victim signal is received by detection limit of -80 dBm/MHz proposed in Korea for DAA. Simulation results show that the performance of the proposed detection algorithm is enough to detect the victim signal with 95% detection probability within the +/-0.5 dB error range if repeat Number over 4 is used.
Many networks, including social and biological networks, are naturally divided into communities. Community detection is an important task for the discovering underlying structure in networks. GN algorithm is one of th...
详细信息
Many networks, including social and biological networks, are naturally divided into communities. Community detection is an important task for the discovering underlying structure in networks. GN algorithm is one of the most influential detection algorithms based on betweenness scores of edges, but it is computationally costly, as all betweenness scores should be repeatedly computed once an edge is removed. Here, an algorithm is presented, which is also based on betweenness scores but more than one edge can be removed when all betweenness scores have been computed. This method is motivated by the consideration: many components, divided from networks, are independent each other in their recalculation of betweenness scores and their split into smaller components. It is shown that this method is fast and effective through theoretical analysis and experiments with several real data sets, which have been acted as test beds in many related works.
ML-DFE algorithm is known as the combination of the ZF-DFE algorithm and ML algorithm. In this paper, OSIC-ML is proposed as the simplified algorithm of the ML-DFE, by exchanging the executive order of OSIC and ML, us...
详细信息
ML-DFE algorithm is known as the combination of the ZF-DFE algorithm and ML algorithm. In this paper, OSIC-ML is proposed as the simplified algorithm of the ML-DFE, by exchanging the executive order of OSIC and ML, using simple matrix operations to replace the method of through QR decomposition to find a unitary matrix for matrix resolution. ML-DFE algorithm decreases complexity of the matrix operations, and gets almost the same performance of ML-DFE algorithm by the Matlab simulation results.
Automated line detection is a classical image processing topic with many applications such as road detection in remote images and vessel detection in medical images. Many traditional line detectors, such as Gabor filt...
详细信息
Automated line detection is a classical image processing topic with many applications such as road detection in remote images and vessel detection in medical images. Many traditional line detectors, such as Gabor filter, the second order derivative of Gaussian and Radon transform will response not only to lines but also to edges, e.g. they will give high responses to the edges of bright lines or blobs when only dark lines are required. To reduce false detections when extracting only dark (or bright) lines, in this paper we propose a line detector by using the first derivative of Gaussian. It can detect dark lines without much false detection on blobs or bright lines. Meanwhile, the proposed method can estimate line width simultaneously. Experiments on various images are performed to test the proposed algorithm.
Anomaly detection for remote sensing has drawn a lot of attention lately. An anomaly has distinct spectral features from its neighborhood, whose spectral signature is not known a priori, and it usually has small size ...
详细信息
Anomaly detection for remote sensing has drawn a lot of attention lately. An anomaly has distinct spectral features from its neighborhood, whose spectral signature is not known a priori, and it usually has small size with only a few pixels. It is very challenge to detect anomalies, especially without any information of the background environment in hyperspectral data with hundreds of co-registered image bands. Several methods are devoted to this problem, including the well-known RX algorithm which takes advantage of the second-order statistics and other algorithms which detect anomaly based on higher order statistics such as skewness and kurtosis. It has been proved that the High-Order Automatic Anomaly detection Algorithm can outperform RX algorithm by distinguishing different types of anomalies. However, the initialization of the High-Order Automatic Anomaly detection Algorithm remains a challenge problem. When the initial vectors are selected randomly for this recursive algorithm, they might be trapped in the local maximums and give different projection directions. But in our experiments, all those directions will show different types of anomalies. Therefore, this algorithm is particular suitable for parallel processing to increase the computing efficiency. In the parallel architecture, we will first randomly generate initial vectors for each process, and then united those output results for the orthogonal projection base. We will also compare the computational efficiency with the number of parallel processes we used.
In this paper, we present a new detection algorithm for line defects of scale-covered steel billets. Because of the presence of scales on the billet surface, features of surface images such as brightness and textures ...
详细信息
In this paper, we present a new detection algorithm for line defects of scale-covered steel billets. Because of the presence of scales on the billet surface, features of surface images such as brightness and textures are non-uniform. To minimize the influence of scales and to improve the accuracy of detection, a new detection method based on undecimated wavelet transform is proposed. The vertical projection profile of subimage with high-frequency information produced by undecimated wavelet transform is used to detect the line defects. Experimental results conducted on billets surface image from actual steel production line show that the proposed algorithm is capable of detecting line defects on billet surface.
When an iterative-decoding aided system is configured to operate at a near-capacity performance, an excessive complexity may be imposed by the iterative process. In this paper, we propose the novel framework of generi...
详细信息
When an iterative-decoding aided system is configured to operate at a near-capacity performance, an excessive complexity may be imposed by the iterative process. In this paper, we propose the novel framework of generic detection, which invokes appropriately amalgamated multiple detectors. Hence the proposed Irregular Generic detection (IrGD) algorithm may reduce the complexity of iterative detectors. We show in the context of an iterative Down-Link (DL) Space Division Multiple Access (SDMA) system that the proposed IrGD may indeed reduce the complexity of the iterative receiver. The IrGD aided DL-SDMA system detects the appropriate fractions of the received bitstream with the aid of different detectors. This allows us to match the Extrinsic Information Transfer (EXIT) curve of the detector to that of the channel decoder, hence facilitating a near-capacity operation, which reducing the detection complexity by about 28% compared to a powerful near-Maximum-Likelihood (ML) sphere detector benchmark system.
This paper presents a new normalcy model of a scene for change detection using images taken from multiple views and varying illumination conditions. Each coregistered pixel site is statistically modeled by a probabili...
详细信息
ISBN:
(纸本)9781424421749
This paper presents a new normalcy model of a scene for change detection using images taken from multiple views and varying illumination conditions. Each coregistered pixel site is statistically modeled by a probability distribution conditioned on a set of pixels in a non-local neighborhood that are less likely to be affected by a change that happens at the pixel of interest. These ldquonon-compact neighborsrdquo are located using information theoretic approaches. The associated change detection algorithm is called non-compact Markovian Likelihood (NorMaL), which predicts normalcy of a scene based on non-compact neighborhoods using non-parametric conditional density estimation.
Message races, which can cause nondeterministic executions of a message-passing program, should be detected for debugging. Especially it is more important to detect the first race that occurs for the first time in a p...
详细信息
Message races, which can cause nondeterministic executions of a message-passing program, should be detected for debugging. Especially it is more important to detect the first race that occurs for the first time in a process than to detect affected races that might be side effects of nondeterminism. The previous techniques are not efficient to detect those races because they require more than two runs of a program. This paper presents an efficient technique that requires only one execution to detect the first race in each process. For this, we use a new information, called message history, that consists of send/receive events related to the first race. Also we introduce an algorithm to detect the first races using message history. In the experiment, we show that our technique exactly detects the first race during an execution using several MPI programs.
暂无评论