检索结果-内蒙古大学图书馆

Exact Zernike and pseudo-Zernike moments image reconstruction based on circular overlapping blocks and Chamfer distance

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2017年第7期11卷 1313-1320页

作者： Bahaoui, Zaineb El Fadili, Hakim Zenkouar, Khalid Zarghili, Arsalane Univ Sidi Mohamed Ben Abdellah LSIA Fac Tech Sci Fes Morocco Univ Sidi Mohamed Ben Abdellah Lab LIPI Informat & Phys Interdisciplinaire Natl Sch Appl Sci Fes Morocco

This study aims to explore a novel approach to reconstruct multi-gray-level images based on circular blocks reconstruction method using two exact and fast moments: Zernike (CBR-EZM) and pseudo-Zernike (CBR-EPZM): An image is first divided into a set of sub-images which are then reconstructed independently. We also introduced Chamfer distance (CD) to capitalize on the use of discrete distance instead of Euclidean one. The combination of our methods and CD leads to CBR-EZM-CD and CBR-EPZM-CD methods. Obviously, image partitioning offers significant advantages, but an undesirable circular blocking effect can occur. To mitigate this effect, we have implemented overlapping feature to our new methods leading to OCBR-EZM-CD and OCBR-EPZM-CD, by exploiting neighborhood information of the circular blocks. The main motivation of this novel approach is to explore new applications of Zernike and pseudo-Zernike moments. One of the fields is feature extraction for pattern recognition: Zernike and pseudo-Zernike moments are well known to capture only the global features, but thanks to the circular block reconstruction, we can now use those moments to extract also local features.

关键词： Exact Zernike moments computation Exact pseudo-Zernike moments computations fast algorithm Chamfer distance gray-level images Circular blocking artifact Overlapping method Time processing

来源：评论

学校读者我要写书评

暂无评论

Mixed-Type Galerkin Variational Principle and Numerical Simulation for a Generalized Nonlocal Elastic Model

引用

JOURNAL OF SCIENTIFIC COMPUTING 2017年第2期71卷 660-681页

作者： Jia, Lueling Chen, Huanzhen Wang, Hong Shandong Normal Univ Sch Math & Stat Jinan 250014 Peoples R China Univ South Carolina Dept Math Columbia SC 29208 USA

A mixed-type Galerkin variational principle is proposed for a generalized nonlocal elastic model. The solvability and regularity of its solution is naturally derived through the Lax-Milgram lemma, from which a solvability criterion is inferred for a Fredholm integral equation of the first kind. A mixed-type finite element procedure is therefore developed and the existence and uniqueness of the discrete solution is proved. This compensates the lack of solvability proof for the collocation-finite difference scheme proposed in Du et al. (J Comput Phys 297:72-83, 2015). Numerical error bounds for the unknown and the intermediate variable are proved. By carefully exploring the structure of the coefficient matrices of the numerical method, we develop a fast conjugate gradient algorithm , which reduces the computations to per iteration and the memory to . The use of the preconditioner significantly reduces the number of iterations. Numerical results show the utility of the method.

关键词： Generalized nonlocal elastic model Fractional derivative equation Mixed-type variational principle Mixed-type finite element procedure fast algorithm

来源：评论

学校读者我要写书评

暂无评论

fast harmonic chirp summation

Fast harmonic chirp summation

引用

2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017

作者： Nielsen, Jesper Kjaer Jensen, Tobias Lindstrom Rindom Jensen, Jesper Christensen, Mads Graesboll Jensen, Soren Holdt Audio Analysis Lab AD:MT Aalborg University Denmark Acoustic Research Bang and Olufsen A/S Struer Denmark Dept. of Electronic Systems Aalborg University Denmark

ISBN: (纸本)9781509041176

The harmonic chirp signal model has only very recently been introduced for modelling approximately periodic signals with a time-varying fundamental frequency. A number of estimators for the parameters of this model have already been proposed, but they are either inaccurate, non-robust to noise, or very computationally intensive. In this paper, we propose a fast algorithm for the harmonic chirp summation method which has been demonstrated in the literature to be accurate and robust to noise. The proposed algorithm is orders of magnitudes faster than previous algorithms which is also demonstrated via timing studies. © 2017 IEEE.

关键词： fast algorithm Harmonic chirp model harmonic chirp summation

来源：评论

学校读者我要写书评

暂无评论

fast MIMO-ISAR Back Projection algorithm Based on FFT

Fast MIMO-ISAR Back Projection Algorithm Based on FFT

引用

2016 4th International Conference on Machinery,Materials and Information Technology Applications(ICMMITA 2016)

作者： Wang Xiuyou Wang Hao Xu Dongqing Liu Huaming Fan Jianzhong School of Computer and Information Engineering Fuyang Teachers College

ISBN: (纸本)9781510835467

In order to reduce the computational cost in the current MIMO-ISAR back projection imaging algorithm, a fast algorithm based on FFT is proposed for MIMO-ISAR back projection. First, we establish the reflected wave signal model for MIMO-ISAR imaging. The approximate representation of linear change of phase compensation factor is provided. Second, the constraints of the conversion from non-linear phase compensation factor to linear compensation factor is given. Finally, an efficient algorithm for MIMO-ISAR back projection based on FFT is achieved. Simulation results show that compared with traditional methods, the proposed algorithm reduces the computational cost greatly.

关键词： MIMO-ISAR back projection fast algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Affinity Propagation Clustering for Business Districts Mining

Improved Affinity Propagation Clustering for Business Distri...

引用

IEEE International Conference on Tools with Artificial Intelligence

作者： Zhi Chen Jian Xu Yang Wu Ning Zheng Liming Tu Ming Luo Comput. Sci. & Technol. Hangzhou Dianzi University Hangzhou Zhejiang CN Computer Science and Technology Hangzhou DianZi University Hangzhou China

Business districts serve as basic structures for understanding the organization of real-world economic network. Discovering these business districts in cities establish new types of valuable applications that can benefit end users: Business investors can better identify the proximity of existing business districts and hence, can contribute a better future planning for investing. In this paper, we propose improved affinity propagation clustering for business districts mining. Given check-in data, whose geography information represents business venues' location, we introduce a affinity propagation clustering algorithm (AP), a basic solution, to cluster venues. This strategy requires that real-valued messages are exchanged among business venues until a set of centers and corresponding business districts gradually emerges. However, the computational complexity of AP is affected by the scale of input. And it's not adaptive for random distribution of venues when mining business districts. To conduct business districts mining efficiently, we introduce a pruning method, termed as PAP. And then present merging based mine approach, termed as MAP. We conduct experiments from Yelp data, and experimental results show that our proposed method outperforms the basic solutions and resolves the problem well.

关键词： Business district Affinity propagation fast algorithm Exemplar-based clustering PAP MAP

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT INTRA CODING algorithm BASED ON STATISTICAL LEARNING FOR SCREEN CONTENT CODING 24

AN EFFICIENT INTRA CODING ALGORITHM BASED ON STATISTICAL LEA...

引用

24th IEEE International Conference on Image Processing (ICIP)

作者： Yang, Hao Shen, Liquan An, Ping Shanghai Univ Sch Commun & Informat Engn Shanghai 200072 Peoples R China

ISBN: (纸本)9781509021758

Screen content has different characteristics compared with natural content captured by cameras. To achieve more efficient compression, some new coding tools have been developed in the High Efficiency Video Coding (HEVC) Screen Content Coding (SCC) Extension, which also increase the computational complexity of encoder. In this paper, complexity analysis are first conducted to explore the distribution of complexities. Then, two classification trees, including early coding units (CU) partition tree (EPT) and CU content classification tree (CCT), are designed based on statistical characteristics and coding information. EPT is used to decide whether the CU skip the mode decision process of current depth level and CCT is used to classify the blocks into either natural blocks or screen blocks. Natural blocks will skip screen coding modes and screen blocks skip normal intra modes. Experimental results show the proposed algorithm can save 49% encoding time with 2.7% BD-rate increase on average for All Intra configuration under the SCC common test condition.

关键词： Screen Content Coding Machine Learning fast algorithm Intra Prediction

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Cuckoo Search and K-Means for Clustering Problem

A Hybrid Cuckoo Search and K-Means for Clustering Problem

引用

International Conference on Electrical Engineering and Computer Science (ICECOS)

作者： Girsang, Abba Suganda Yunanto, Ardian Aslamiah, Ayu Hidayah Bina Nusantara Univ Comp Sci Jakarta Indonesia Bina Nusantara Univ Sch Comp Sci Jakarta Indonesia

ISBN: (纸本)9781479976751

Cuckoo search algorithm (CSA) is one of behavior algorithm which is effective to solve optimization problem including the clustering problem. Based on investigation, k-means is also effective to solve the clustering problem specially in fast convergence. This paper combines two algorithms, cuckoo search algorithm and k-means algorithm in clustering problem called FCSA. Cuckoo search is used to build the robust initialization, while K-means is used to accelerate by building the solutions. The result confirms that FCSA's computational time in ten datasets is faster than the compared algorithm

关键词： Clustering Cuckoo search algorithm (CSA) K-means algorithm fast algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Transformation Design of RNA to DNA for Signal Processing 2

A Novel Transformation Design of RNA to DNA for Signal Proce...

引用

2nd International Conference on Bio-engineering for Smart Technologies (BioSMART)

作者： Lee, Moon Ho Hai, Han Selvaprabhu, Poongundran Chonbuk Natl Univ Div Elect Engn Jeonju South Korea

ISBN: (纸本)9781538607060

This letter presents a single strand of ribonucleic acid (RNA) with the Kronecker product of double stochastic matrix becoming the deoxyribose nucleic acid (DNA) double helix for signal processing design. Inspired by this manner of the life science and employing the characteristics of the block circulant Jacket matrix (BCJM), a novel algorithm is investigated named RNA-DNA algorithm. The RNA matrix decomposition is the form of the Kronecker product of Hadamard and identity matrices based on its pair complementarity. The variants of kernel of the Kronecker families are produced by the permutations of the four letters, i.e., C, A, U and G on the positions in the matrix. Based on this manner, a novel DNA-RNA decomposition (DNA-RNA-D) is investigated by employing the clustered regularly interspaced short palindromic repeats (CRISPR) and the Kronecker product of the symmetrical genetic matrices which strictly follow the complementary principle.

关键词： RNA DNA Kronecker product Hadamard /identity matrix fast algorithm

来源：评论

学校读者我要写书评

暂无评论

Affine Motion Model Based Rolling Shutter Removal algorithm 2

Affine Motion Model Based Rolling Shutter Removal Algorithm

引用

2nd International Conference on Mechanical, Control and Computer Engineering (ICMCCE)

作者： Wang, Yu Wuchang Shipbldg Ind Co Ltd Wuhan Hubei Peoples R China

ISBN: (纸本)9781538626283

Geometric distortions may appear in videos captured by rolling shutter cameras. Existing rolling shutter rectification algorithms can remove these distortions effectively, but they are slow and complex. It is hard for mobile devices to satisfy the requirements of these algorithms. An affine motion model based fast algorithm is proposed. This algorithm first use point correspondences to estimate the affine transformation between local image patches. Then, simple curve interpolation is performed for each element in the affine matrices to get the parameters of the motion model. At last, a new image without distortion is generated using the motion model. The experimental results on synthetic data sets and real videos show that the proposed algorithm is accurate and fast.

关键词： rolling shutter affine transformation curve interpolation image restoration fast algorithm

来源：评论

学校读者我要写书评

暂无评论

fast Computing for Distance Covariance

引用

TECHNOMETRICS 2016年第4期58卷 435-447页

作者： Huo, Xiaoming Szekely, Gabor J. Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA Natl Sci Fdn Arlington VA 22203 USA Hungarian Acad Sci Alfred Renyi Inst Math Budapest Hungary

Distance covariance and distance correlation have been widely adopted in measuring dependence of a pair of random variables or random vectors. If the computation of distance covariance and distance correlation is implemented directly accordingly to its definition then its computational complexity is O(n(2)), which is a disadvantage compared to other faster methods. In this article we show that the computation of distance covariance and distance correlation of real-valued random variables can be implemented by an O(nlogn) algorithm and this is comparable to other computationally efficient algorithms. The new formula we derive for an unbiased estimator for squared distance covariance turns out to be a U-statistic. This fact implies some nice asymptotic properties that were derived before via more complex methods. We apply the fast computing algorithm to some synthetic data. Our work will make distance correlation applicable to a much wider class of problems. A supplementary file to this article, available online, includes a Matlab and C-based software that realizes the proposed algorithm.

关键词： Distance correlation fast algorithm Statistical dependence

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：