首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   26篇
  免费   0篇
  国内免费   3篇
无线电   6篇
自动化技术   23篇
  2022年   4篇
  2021年   7篇
  2020年   2篇
  2019年   2篇
  2018年   8篇
  2017年   1篇
  2016年   1篇
  2015年   2篇
  2010年   1篇
  1999年   1篇
排序方式: 共有29条查询结果,搜索用时 15 毫秒
1.

In this paper, we present an in-depth study on the computational aspects of high-order discrete orthogonal Meixner polynomials (MPs) and Meixner moments (MMs). This study highlights two major problems related to the computation of MPs. The first problem is the overflow and the underflow of MPs values (“Nan” and “infinity”). To overcome this problem, we propose two new recursive Algorithms for MPs computation with respect to the polynomial order n and with respect to the variable x. These Algorithms are independent of all functions that are the origin the numerical overflow and underflow problem. The second problem is the propagation of rounding errors that lead to the loss of the orthogonality property of high-order MPs. To fix this problem, we implement MPs based on the following orthogonalization methods: modified Gram-Schmidt process (MGS), Householder method, and Givens rotation method. The proposed Algorithms for the stable computation of MPs are efficiently applied for the reconstruction and localization of the region of interest (ROI) of large-sized 1D signals and 2D/3D images. We also propose a new fast method for the reconstruction of large-size 1D signal. This method involves the conversion of 1D signal into 2D matrix, then the reconstruction is performed in the 2D domain, and a 2D to 1D conversion is performed to recover the reconstructed 1D signal. The results of the performed simulations and comparisons clearly justify the efficiency of the proposed Algorithms for the stable analysis of large-size signals and 2D/3D images.

  相似文献   
2.

In this article, we will present a new set of hybrid polynomials and their corresponding moments, with a view to using them for the localization, compression and reconstruction of 2D and 3D images. These polynomials are formed from the Hahn and Krawtchouk polynomials. The process of calculating these is successfully stabilized using the modified recurrence relations with respect to the n order, the variable x and the symmetry property. The hybrid polynomial generation process is carried out in two forms: the first form contains the separable discrete orthogonal polynomials of Krawtchouk–Hahn (DKHP) and Hahn–Krawtchouk (DHKP). The latter are generated as the product of the discrete orthogonal Hahn and Krawtchouk polynomials, while the second form is the square equivalent of the first form, it consists of discrete squared Krawtchouk–Hahn polynomials (SKHP) and discrete polynomials of Hahn–Krawtchouk squared (SHKP). The experimental results clearly show the efficiency of hybrid moments based on hybrid polynomials in terms of localization property and computation time of 2D and 3D images compared to other types of moments; on the other hand, encouraging results have also been shown in terms of reconstruction quality and compression despite the superiority of classical polynomials.

  相似文献   
3.
In this paper, we introduce new sets of 2D and 3D rotation, scaling and translation invariants based on orthogonal radial Racah moments. We also provide theoretical mathematics to derive them. Thus, this work proposes in the first case a new 2D radial Racah moments based on polar representation of an object by one-dimensional orthogonal discrete Racah polynomials on non-uniform lattice, and a circular function. In the second case, we present new 3D radial Racah moments using a spherical representation of volumetric image by one-dimensional orthogonal discrete Racah polynomials and a spherical function. Further 2D and 3D invariants are extracted from the proposed 2D and 3D radial Racah moments respectively will appear in the third case. To validate the proposed approach, we have resolved three problems. The 2D/ 3D image reconstruction, the invariance of 2D/3D rotation, scaling and translation, and the pattern recognition. The result of experiments show that the Racah moments have done better than the Krawtchouk moments, with and without noise. Simultaneously, the mentioned reconstruction converges rapidly to the original image using 2D and 3D radial Racah moments, and the test 2D/3D images are clearly recognized from a set of images that are available in COIL-20 database for 2D image, and PSB database for 3D image.  相似文献   
4.
5.

In this work, we propose new sets of 2D and 3D rotation invariants based on orthogonal radial dual Hahn moments, which are orthogonal on a non-uniform lattice. We also present theoretical mathematics to derive them. Thus, this paper presents in the first case new 2D radial dual Hahn moments based on polar representation of an image by one-dimensional orthogonal discrete dual Hahn polynomials and a circular function. The dual Hahn polynomials are general case of Tchebichef and Krawtchouk polynomials. In the second case, we introduce new 3D radial dual Hahn moments employing a spherical representation of volumetric image by one-dimensional orthogonal discrete dual Hahn polynomials and a spherical function, which are orthogonal on a non-uniform lattice. The 2D and 3D rotational invariants are extracts from the proposed 2D and 3D radial dual Hahn moments respectively. In order to test the proposed approach, three problems namely image reconstruction, rotational invariance and pattern recognition are attempted using the proposed moments. The result of experiments shows that the radial dual Hahn moments have performed better than the radial Tchebichef and Krawtchouk moments, with and without noise. Simultaneously, the mentioned reconstruction converges quickly to the original image using 2D and 3D radial dual Hahn moments, and the test images are clearly recognized from a set of images that are available in COIL-20 database for 2D image and PSB database for 3D image.

  相似文献   
6.
In this paper, we propose a new set of 2D and 3D rotation invariants based on orthogonal radial Meixner moments. We also present a theoretical mathematics to derive them. Hence, this paper introduces in the first case a new 2D radial Meixner moments based on polar representation of an object by a one-dimensional orthogonal discrete Meixner polynomials and a circular function. In the second case, we present a new 3D radial Meixner moments using a spherical representation of volumetric image by a one-dimensional orthogonal discrete Meixner polynomials and a spherical function. Further 2D and 3D rotational invariants are derived from the proposed 2D and 3D radial Meixner moments respectively. In order to prove the proposed approach, three issues are resolved mainly image reconstruction, rotational invariance and pattern recognition. The result of experiments prove that the Meixner moments have done better than the Krawtchouk moments with and without nose. Simultaneously, the reconstructed volumetric image converges quickly to the original image using 2D and 3D radial Meixner moments and the test images are clearly recognized from a set of images that are available in a PSB database.  相似文献   
7.
Karmouni  H.  Yamni  M.  El ogri  O.  Daoui  A.  Sayyouri  M.  Qjidaa  H. 《Multimedia Tools and Applications》2020,79(39-40):29121-29144
Multimedia Tools and Applications - In this paper, we propose a new fast computation method of 3D discrete orthogonal invariant moments of Meixner. This proposed method is based on two fundamental...  相似文献   
8.

Text summarization presents several challenges such as considering semantic relationships among words, dealing with redundancy and information diversity issues. Seeking to overcome these problems, we propose in this paper a new graph-based Arabic summarization system that combines statistical and semantic analysis. The proposed approach utilizes ontology hierarchical structure and relations to provide a more accurate similarity measurement between terms in order to improve the quality of the summary. The proposed method is based on a two-dimensional graph model that makes uses statistical and semantic similarities. The statistical similarity is based on the content overlap between two sentences, while the semantic similarity is computed using the semantic information extracted from a lexical database whose use enables our system to apply reasoning by measuring semantic distance between real human concepts. The weighted ranking algorithm PageRank is performed on the graph to produce significant score for all document sentences. The score of each sentence is performed by adding other statistical features. In addition, we address redundancy and information diversity issues by using an adapted version of Maximal Marginal Relevance method. Experimental results on EASC and our own datasets showed the effectiveness of our proposed approach over existing summarization systems.

  相似文献   
9.
Multimedia Tools and Applications - In this paper, we propose a new method for image classification by the content in heterogeneous databases. This approach is based on the use of new series of...  相似文献   
10.
Multidimensional Systems and Signal Processing - Orthogonal moments are the projections of image functions on particular functions of the kernel. They play an essential role in image extraction:...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号