This paper presents a new affine registration approach for planar point pattern matching. A process of parameter space clustering is implemented to confirm a one-to-one mapping between the maximal subsets of feature p...
详细信息
Traditional path planning methods are too slow to meet the real-time requirement in practical applications. In order to solve this problem, an idea of path net was proposed in this paper. The path planning procedure i...
详细信息
It is difficult to meet both direction and curvature constraints for traditional Fast Marching (FM) method in path planning. Based on adjusting the cost function in Eiknoal equation-the control equation for FM, a new ...
详细信息
Convolution is an important and useful operation in the fields of digital signal processing. In this paper, based on the previous work of performing discrete Fourier transform (DFT) via linear sums of discrete moments...
详细信息
Convolution is an important and useful operation in the fields of digital signal processing. In this paper, based on the previous work of performing discrete Fourier transform (DFT) via linear sums of discrete moments, we have made development to eliminate multiplications in discrete Fourier transforms by performing appropriate bit operations and shift operations in binary system, which can be implemented by integer additions of fixed points; then using the convolution theorem with the DFT, we compute the convolution with two DFTs, a point-by-point product, and an inverse DFT. Our algorithm involves fewer multiplications and can deal with arbitrary length signals.
Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, based on our previous work of performing DHT via linear sums of discrete moments, we have made development to eliminat...
详细信息
Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, based on our previous work of performing DHT via linear sums of discrete moments, we have made development to eliminate multiplications in discrete Hartley transforms by performing appropriate bit operations and shift in binary system, which can be implemented by integer additions of fixed points. An efficient and regular systolic array is designed to implement it, and the complexity analysis is also given. Different to other fast Hartley transforms, our algorithm can deal with arbitrary length signals and get high precision. The approach is also applicable to multi-dimensional DHT and DHT inverses.
image mosaic technology is an important research field of imageprocessing and a research focus on the computer vision and computer graphics. The traditional method is to select the feature points by manual selection ...
详细信息
In this paper we propose a method for segmenting characters in multispectral images of ancient documents. Due to the low quality of the document images the main idea of our study is to combine the multispectral behavi...
详细信息
ISBN:
(纸本)9781617388767
In this paper we propose a method for segmenting characters in multispectral images of ancient documents. Due to the low quality of the document images the main idea of our study is to combine the multispectral behavior and contextual spatial information. Therefore we utilize a Markov Random Field model using the spectral information of the images and stroke properties to include spatial dependencies of the characters. The whole process is parameter free since we calculate the stroke properties and the Gaussian parameters for the imaging model automatically. The study shows the effectiveness of using multispectral data for a computer aided analysis of ancient text documents. We compare the results of the proposed segmentation method to traditional methods based on color images as well as gray level images.
Simulating the soft tissue deformation based on bone-related planning is one of the most difficult issues in generating realistic motion of soft tissues. The difficulty of this problem arises from unclear boundary con...
详细信息
A new algorithm for linear instantaneous independent component analysis is proposed based on maximizing the log-likelihood contrast function which can be changed into a gradient equation. An iterative method is introd...
详细信息
A new algorithm for linear instantaneous independent component analysis is proposed based on maximizing the log-likelihood contrast function which can be changed into a gradient equation. An iterative method is introduced to solve this equation efficiently. The unknown probability density functions as well as their first and second derivatives in the gradient equation are estimated by kernel density method. Computer simulations on artificially generated signals and gray scale natural scene images confirm the efficiency and accuracy of the proposed algorithm. Copyright.
Shadow detection in high spatial resolution remote sensing image is very critical for locating geographical targets. In this paper, we proposed a new shadow detection method using Affinity Propagation (AP) algorithm i...
详细信息
Shadow detection in high spatial resolution remote sensing image is very critical for locating geographical targets. In this paper, we proposed a new shadow detection method using Affinity Propagation (AP) algorithm in the Hue-Saturation-Intensity (HSI) color space. Because the pixel matrix is a large-scale matrix, if we apply AP algorithm directly on the raw pixel space, it will be computation intensive to calculate the similarity matrix. To solve this problem, we propose to divide the matrix into several blocks and then applying AP to detect shadows in H, S and I components respectively. Then, three detected images are fused to obtain a final shadow detection result. Comparative experiments are performed for K-means and threshold segmentation methods. The experimental results show that higher detection accuracy of the proposed approach is obtained, and it can solve the problems of false dismissals of K-means and threshold segmentation method.
暂无评论