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

IEEE Annual Conference on Decision and Control

作者： M. Eren Ahsen M. Vidyasagar IBM Thomas J. Watson Research Center Yorktown Heights NY Erik Jonsson School of Engineering and Computer Science

ISBN: (纸本)9781479978878

This paper builds upon earlier work of the authors in formulating the one-bit compressed sensing (OBCS) problem as a problem in probably approximately correct (PAC) learning theory. It is shown that the solution to the OBCS problem consists of two parts. The first part is to determine the statistical complexity of OBCS by determining the Vapnik-Chervonenkis (VC-) dimension of the set of half-spaces generated by sparse vectors. The second is to determine the algorithmic complexity of the problem by developing a "consistent" algorithm. In this paper, we generalize the earlier results of the authors by deriving both upper and lower bounds on the VC-dimension of half-spaces generated by sparse vectors, even when the separating hyperplane need not pass through the origin. As with earlier bounds, these bounds grow linearly with respect to with the sparsity dimension and logarithmically with the vector dimension,

关键词： Compressed sensing algorithmic complexity dimensions Lower bound Bound Writers

来源：评论

学校读者我要写书评

暂无评论

Linear Profilometry: A Low Cost 3D Acquisition System

Linear Profilometry: A Low Cost 3D Acquisition System

引用

IEEE/SICE International Symposium on System Integration

作者： Arwan Ahmad Khoiruddin Research Center for Informatics Indonesian Institute of Sciences (LIPI)

ISBN: (纸本)9781467372435

Numerous methods have been proposed for 3D acquisition using Fringe Projection Profilometry (FPP). Most methods assume that the signal acquired by the camera is perfectly sinusoidal. However, due to color response and optical aberration on projector and camera, inter-color crosstalk, as well as the presence of noise, it is very difficult to get a perfect sinusoidal. Several methods have been proposed to analyze non-sinusoidal signal by performing polynomial fitting on the signal. However, due to noise, polynomial fitting may produce oscillated errors. In this paper, a low cost method named Linear Profilometry is proposed. As no polynomial fitting is needed, oscillated error can be avoided. Moreover, as no monotonic part of the signal needs to be extracted, nor any unwrapping is needed, the algorithm complexity is extremely low. However, as no signal fitting is performed, the noise will remain unreduced. Thus, signal filter is needed during pre-processing. The final results of the method will highly depend on the noise filtering. In this paper, average and median filter are used.

关键词： algorithmic complexity PROFILOMETRY noise filtering signal filtering Optical aberrations Noise color response MACHINE SHOP PRACTICE median filters signals Cameras acquisition system Polynomial

来源：评论

学校读者我要写书评

暂无评论

A PULL-PUSH METHOD FOR FAST NON-LOCAL MEANS FILTERING

A PULL-PUSH METHOD FOR FAST NON-LOCAL MEANS FILTERING

引用

IEEE International Conference on Image Processing

作者： John R. Isidoro Peyman Milanfar Google Research

ISBN: (纸本)9781467399623

Non-local means filtering (NLM), has garnered a large amount of interest in the image processing community due to its capability to exploit image patch self-similarity in order to effectively filter noisy images. However, the computational complexity of non-local means filtering is the product of three different factors;namely, O(NDK), where K is the number of filter kernel taps (e.g. search window size), D is the number of patch taps, and N is number of pixels. We propose a fast approximation of non-local means filtering using the multiscale methodology of the pull-push scattered data interpolation method. By using NLM with a small filter kernel to selectively propagate filtering results and noise variance estimates from fine to coarse scales and back, the process can be used to provide comparable filtering capability to brute force NLM but with algorithmic complexity that is linear in the number of image pixels and the patch comparison taps, O(ND). In practical application, we demonstrate its denoising capability is comparable to NLM with much larger filter kernels, but at a fraction of the computational cost.

关键词： Non-local means Multiscale Pull-push Image denoising nonlinear material image denoising Filtration Filter kernel non-local interaction NONLOCAL POTENTIAL WATER FAUCETS algorithmic complexity pixel

来源：评论

学校读者我要写书评

暂无评论

PLL-less SRF technique for operation of SAPF under unbalanced and distorted supply voltage

PLL-less SRF technique for operation of SAPF under unbalance...

引用

5th IET International Conference on Clean Energy and Technology (CEAT2018)

作者： Y. Hoon M. A. M. Radzi M. K. Hassan N. F. Mailah Department of Electrical and Electronic Engineering Faculty of Engineering Universiti Putra Malaysia 43400 UPM Serdang Selangor Malaysia

Shunt active power filter (SAPF) has been recognized as a feasible solution to current harmonics issues. In its controller, due to structure simplicity, synchronous reference frame (SRF) technique is best suited to be applied in generating reference current. However, the existing SRF algorithm performs inefficiently due to limitations of numerical low-pass filter (LPF). Besides, the existing algorithm is as yet considered to have excessive features which are not required in the procedure of generating reference current. Most importantly, its dependency on traditional phase-locked loop (PLL) has greatly degraded its effectiveness when the source voltage is unbalanced and/or distorted. Therefore, this paper presents a PLL-less SRF algorithm for generating reference current to effectively control performance of a SAPF developed based on three-level neutral-point-clamped (NPC) inverter. Specifically, three notable refinements are implemented: (1) eliminate the traditional use of LPF by replacing it with a mathematical-based average current detector; (2) reduce algorithm complexity by removing excessive features; (3) eliminate synchronization error of PLL by integrating a new self-tuning-filter (STF)-based synchronization technique. The proposed algorithm is created and assessed in MATLAB-Simulink. Simulation and experimental results are provided, demonstrating superiority of the proposed PLL-less SRF algorithm over the existing SRF algorithm.

关键词： self-resonance frequency Low pass filters supply voltage Phase locked loops reference current Prolymphocytic Leukemia algorithmic complexity synchronization error Unbalance algorithms Surgery Feasible Solution

来源：评论

学校读者我要写书评

暂无评论

Predictive Systems Toxicology

Predictive Systems Toxicology

引用

作者： Narsis A. Kiani Ming-Mei Shang Hector Zenil Jesper Tegner

In this review we address to what extent computational techniques can augment our ability to predict toxicity. The first section provides a brief history of empirical observations on toxicity dating back to the dawn of Sumerian civilization. Interestingly, the concept of dose emerged very early on, leading up to the modern emphasis on kinetic properties, which in turn encodes the insight that toxicity is not solely a property of a compound but instead depends on the interaction with the host organism. The next logical step is the current conception of evaluating drugs from a personalized medicine point of view. We review recent work on integrating what could be referred to as classical pharmacokinetic analysis with emerging systems biology approaches incorporating multiple omics data. These systems approaches employ advanced statistical analytical data processing complemented with machine learning techniques and use both pharmacokinetic and omics data. We find that such integrated approaches not only provide improved predictions of toxicity but also enable mechanistic interpretations of the molecular mechanisms underpinning toxicity and drug resistance. We conclude the chapter by discussing some of the main challenges, such as how to balance the inherent tension between the predicitive capacity of models, which in practice amounts to constraining the number of features in the models versus allowing for rich mechanistic interpretability, i.e., equipping models with numerous molecular features. This challenge also requires patient-specific predictions on toxicity, which in turn requires proper stratification of patients as regards how they respond, with or without adverse toxic effects. In summary, the transformation of the ancient concept of dose is currently successfully operationalized using rich integrative data encoded in patient-specific models. less

关键词： Computational Techniques Machine Learning Systems biology Toxicology Omics Network pharmacology algorithmic complexity

来源：评论

学校读者我要写书评

暂无评论

A Class of Affine Projection Filters that Exploit Sparseness under Symmetric alpha-Stable noise

A Class of Affine Projection Filters that Exploit Sparseness...

引用

Oceans 2013 - Norway

作者： Konstantinos Pelekanakis Mandar Chitre Acoustic Research Laboratory Tropical Marine Science Institute National University of Singapore

ISBN: (纸本)9781479900022

A new algorithmic framework for sparse underwater acoustic channel estimation under the presence of Symmetric α-Stable (SαS) noise is proposed. The framework is inspired by the low-complexity affine projection algorithm (APA) and employs a novel cost function that includes robust methods for impulsive noise suppression and a sparseness constraint. The constraint exploits the non-isotropic (Riemannian) structure of the channel, which leads to natural gradient adaptation. Based on this framework, new algorithms are derived with linear algorithmic complexity. The effectiveness of the new algorithms is confirmed by computer simulations.

关键词： Noise suppression Affine In-law Frameworks CENTROSYMMETRIC Noise Computer Simulation Constraint Filters Underwater Acoustic Channels algorithmic complexity

来源：评论

学校读者我要写书评

暂无评论

Filter Bubbles? Also Protector Bubbles! Folk Theories of Zhihu Algorithms Among Chinese Gay Men

引用

SOCIAL MEDIA + SOCIETY 2023年第2期9卷

作者： Zhao, Longxuan East China Normal Univ Sociol Shanghai Peoples R China London Sch Econ & Polit Sci London England East China Normal Univ Dept Sociol 500 Dongchuan Rd Shanghai 200241 Peoples R China

In light of the awareness that we know little about how algorithms are perceived by groups other than those in the mainstream, this study investigates how Chinese gay men on Zhihu generate folk theories of the operation and impact of the platform algorithms. After recruiting 16 long-term users on Zhihu as informants and conducting thematic analysis, two overarching themes are identified: (1) the algorithm as evictor, supported by the users' folk theories of sidelining, disorganizing, and defaming;and (2) the algorithm as protector, supported by the users' folk theories of shielding, recognizing, and exclusive networks. Based on the empirical data collected, this study provides inspiration for understanding algorithmic complexity, and challenges the mainstream appeal to break through filter bubbles (information cocoons) by indicating its (hetero)normativity.

关键词： algorithmic folk theory algorithmic marginalization hiding in plain sight algorithmic complexity filter bubbles

来源：评论

学校读者我要写书评

暂无评论

SIMPLIFIED ADDRESSING SCHEME FOR MIXED RADIX FFT ALGORITHMS

SIMPLIFIED ADDRESSING SCHEME FOR MIXED RADIX FFT ALGORITHMS

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Cuimei Ma Yizhuang Xie He Chen Yi Deng Wen Yan Beijing Institute of Technology Beijing 100081 China Virginia Polytechnic Institute and State University Arlington VA 22044 USA

ISBN: (纸本)9781479928941

A mixed radix algorithm for the in-place fast Fourier transform (FFT), which is broadly used in most embedded signal processing fields, can be explicitly expressed by an iterative equation based on the Cooley-Tukey algorithm. The expression can be applied to either decimation-in-time (DIT) or decimation-in-frequency (DIF) FFTs with ordered inputs. For many newly emerging low power portable computing applications, such as mobile high definition video compressing, mobile fast and accurate satellite location, etc., the existing methods perform either resource consuming or non-flexible. In this paper, we propose a new addressing scheme for efficiently implementing mixed radix FFTs. In this scheme, we elaborately design an accumulator that can generate accessing addresses for the operands, as well as the twiddle factors. The analytical results show that the proposed scheme reduces the algorithm complexity meanwhile helps the designer to efficiently choose an arbitrary FFT to design the in-place architecture.

关键词： Fast Fourier transform Addressing accumulator Public Speaking Designers Root Radix Base of a number system Addressing schemes algorithms Scheme high definition video operand algorithmic complexity

来源：评论

学校读者我要写书评

暂无评论

Sparsity-Aware Successive Interference Cancellation with Practical Constraints

Sparsity-Aware Successive Interference Cancellation with Pra...

引用

WSA 2013;17th International ITG Workshop on Smart Antennas

作者： Benjamin Knoop Fabian Monsees Carsten Bockelmann Dirk Wuebben Steffen Paul Armin Dekorsy Institute of Electrodynamics and Microelectronics (ITEM) University of Bremen Department of Communications Engineering University of Bremen

This paper investigates new detection methods for low data-rate Machine Type Communication. Special attention is paid to uplink communication in networks where nodes are only active occasionally, which requires a joint activity and data detection at the receiver. This paper shows that a modified version of Successive Interference Cancellation is a viable approach for the detection of these low data-rate multi-user signals. The analysis is in the context of a hardware implementation, which we address particularly as we investigate the algorithmic complexity of the introduced algorithms.

关键词： Interference cancellation inspection methods Data transfer rates algorithmic complexity data detection Communication Research Ganglia

来源：评论

学校读者我要写书评

暂无评论

HIERARCHICAL SKELETON FOR SHAPE MATCHING

HIERARCHICAL SKELETON FOR SHAPE MATCHING

引用

IEEE International Conference on Image Processing

作者： Aurelie Leborgne Julien Mille Laure Tougne Univ Lyon INSA-Lyon LIRIS INSA-Centre Val de Loire Univ Lyon Universite Lyon 2 LIRIS

ISBN: (纸本)9781467399623

The skeleton is an efficient and complete shape descriptor often used for matching. However, existing skeleton-based shape matching methods are computationally intensive. To reduce the algorithmic complexity, we propose to exploit the natural hierarchy of the skeleton. The aim is to quantify the importance of skeleton branches to guide the shape matching algorithm, in order to match branches having the same order of importance. Our method is based on successive shape smoothing operations and on the deformability of the skeleton to adapt it to each smoothed shape. Moreover, we show that our method is independent from the initial skeleton.

关键词： Hierarchical skeleton Matching Pruning Pattern recognition Skeletons bone structure Pattern recognition tree surgery smoothing algorithmic complexity Deformability branches Shape

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：