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

SMPTE JOURNAL 2001年第6期110卷 383-394页

作者： Demos, G DemoGraFX Santa Monica CA 90405 USA

Electronic cameras and projectors are improving at a rapid pace, Computational elements are increasing in power to the point where substantial processing cart be applied to the image stream, and compression algorithms have improved to the level M,here very high quality can be maintained at high compression ratios. The combination of high resolution and high frame rate can bring unprecedented image clarity to an electronic imaging system. With high-quality compression as a central system element, image capture and presentation systems can realize their full technological potential, While it is evident that uncompressed digital video at standard definition is widely available for many video system elements, it is now becoming apparent that imaging systems are poised to jump orders of magnitude in quality beyond this. HDTV implementations of the last decade now look like a small step in comparison to the leap in quality that is anticipated.

关键词： Projectors compression algorithms compression ratio image definition Imaging Cinema Display systems system component Scientific potential Frame Rate

来源：评论

学校读者我要写书评

暂无评论

AUTOCORRELATION-BASED PITCH DETERMINATION algorithms FOR REALTIME VOCODERS WITH THE TMS32020-C25

引用

MICROPROCESSORS AND MICROSYSTEMS 1990年第8期14卷 511-516页

作者： TSAKALOS, N ZIGOURIS, E Electronics Laboratory Physics Department Patras University GR-261 10 Patras Greece

In the paper, an autocorrelation-based pitch determination algorithm (PDA) is described. Realtime implementation on TMS32020/C25 digital signal processors is considered. Several optimizations and variations of autocorrelation PDAs have been implemented on a single TMS32020-based system. The algorithms are primarily designed with TMS32020/C25 LPC vocoders in mind and combine high speed, good performance and flexibility.

关键词： compression algorithms digital signal processing microprocessors

来源：评论

学校读者我要写书评

暂无评论

EXTENSIONS TO THE STEP TRANSFORM SAR PROCESSING TECHNIQUE

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 1985年第3期21卷 338-344页

作者： WU, KH VANT, MR Station H. Ottawa Communications Rcscarch Centre ONT Canada

In previous descriptions of the step transform SAR azimuth compression algorithm, it has been assumed that the azimuth signal is linear FM and is strictly confined within a single range cell. These conditions do not always hold. Under stringent imaging conditions range curvature occurs, i.e., a nonlinear range migration of the energy associated with a point target takes place. If the system must also operate at a high squint angle, the azimuth signal becomes nonlinear FM. This paper describes extensions to the basic step transform algorithm that allow these imaging situations to be accommodated.

关键词： Radar antennas Radar imaging Spaceborne radar Doppler radar Azimuth Frequency modulation Synthetic aperture radar Directive antennas Image coding compression algorithms

来源：评论

学校读者我要写书评

暂无评论

DIGICIPHER - ALL DIGITAL, CHANNEL COMPATIBLE, HDTV BROADCAST SYSTEM

引用

IEEE TRANSACTIONS ON BROADCASTING 1990年第4期36卷 245-254页

作者： PAIK, W General Instruments Corporation San Diego CA USA

General Instrument's DigiCipher(TM) System is an all digital HDTV system that can be transmitted over a single 6 MHz VHF or UHF channel. It provides full HDTV performance with virtually no visible transmission impairments due to noise, multipath, and interference. It offers high picture quality, while the complexity of the decoder is low. Furthermore, low transmitting power can be used, making it ideal for simulcast HDTV transmission using unused or taboo channels. The DigiCipher(TM) HDTV System can also be used for cable and satellite transmission of HDTV. There is absolutely no satellite receive dish size penalty (compared to FM-NTSC) in the satellite delivery of DigiCipher(TM) HDTV. This is important not only for DBS, but for broadcast and cable since broadcast network and cable programming is typically delivered to affiliates via satellite. To achieve the full HDTV performance in a single 6 MHz bandwidth, a highly efficient unique compression algorithm based on DCT transform coding is used. Through the extensive use of the computer simulation, the compression algorithm has been refined and optimized. Computer simulation results show excellent video quality for a variety of HDTV material. For error free transmission of the digital data, powerful error correction coding combined with adaptive equalization is used. At a carrier-to-noise ratio of above 19 dB, essentially error free reception can be achieved.

关键词： HDTV Satellite broadcasting compression algorithms Discrete cosine transforms Computer simulation Computer errors TV broadcasting Interference Decoding Cable TV

来源：评论

学校读者我要写书评

暂无评论

Compressibility of Positive Semidefinite Factorizations and Quantum Models

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第5期62卷 2867-2880页

作者： Stark, Cyril J. Harrow, Aram W. MIT Ctr Theoret Phys Cambridge MA 02139 USA

We investigate compressibility of the dimension of positive semidefinite matrices, while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of nonnegative matrices or (if the matrices are subject to additional normalization constraints) as compression of quantum models. We derive both lower and upper bounds on compressibility. Applications are broad and range from the analysis of experimental data to bounding the one-way quantum communication complexity of Boolean functions.

关键词： Mathematical programming Quantum mechanics compression algorithms Data analysis

来源：评论

学校读者我要写书评

暂无评论

Multimedia broadcasting over the Internet: Part I

引用

IEEE MULTIMEDIA 1998年第4期5卷 78-82页

作者： Furht, B Westwater, R Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA

Although the industry is still in the early stages of webcasting, we can already foresee what the Internet will offer a few years down the line: clear, crisp audio and full-screen, high-quality, on-demand video. We have developed a technology that provides all these required features for Internet webcasting. This technology consists of: IP Simulcast, a new Internet broadcast protocol, which provides inexpensive, efficient, and reliable audio and video broadcasting; and new audio and video compression algorithms, which allow real-time audio and video transmission of data at low bit rates and with high quality. In this article, we describe a new Internet broadcast technology.

关键词： Video transmission compression algorithms Internets EIS IMPLEMENTATION PLANS Audio Web broadcasts video communications MULTI-MEDIA SYSTEM broadcasting Video on demand Broadcast technology

来源：评论

学校读者我要写书评

暂无评论

Modified patchwork algorithm: A novel audio watermarking scheme

引用

IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING 2003年第4期11卷 381-386页

作者： Yeo, IK Kim, HJ Chonbuk Natl Univ Div Math & Stat Informat Jeonju 561756 South Korea Kangwon Natl Univ Dept Control & Instrumentat Engn Chunchon 200701 South Korea

This paper presents the Modified Patchwork Algorithm (MPA), a statistical technique for audio watermarking algorithm in the transform (not only Discrete Cosine Transform (DCT), but also DFT and DWT) domain. The MPA is an enhanced version of the conventional patchwork algorithm. The MPA is sufficiently robust to withstand some attacks defined by Secure Digital Music Initiative (SDMI). Experimental results show that the proposed watermarking algorithm is sustainable against compression algorithms such as MP3 and AAC, as well as common signal processing manipulation attacks.

关键词： Watermarking Signal processing algorithms Robustness Humans Discrete cosine transforms Ear Information technology Discrete transforms Discrete wavelet transforms compression algorithms

来源：评论

学校读者我要写书评

暂无评论

EMBEDDED IMAGE-CODING USING ZEROTREES OF WAVELET COEFFICIENTS

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1993年第12期41卷 3445-3462页

作者： SHAPIRO, JM David Samoff Research Center Inc. Princeton NJ USA

The embedded zerotree wavelet algorithm (EZW) is a simple, yet remarkably effective, image compression algorithm, having the property that the bits in the bit stream are generated in order of importance, yielding a fully embedded Code. The embedded code represents a sequence of binary decisions that distinguish an image from the ''null'' image. Using an embedded coding algorithm, an encoder can terminate the encoding at any point thereby allowing a target rate or target distortion metric to be met exactly. Also, given a bit stream, the decoder can cease decoding at any point in the bit stream and still produce exactly the same image that would have been encoded at the bit rate corresponding to the truncated bit stream. In addition to producing a fully embedded bit stream, EZW consistently produces compression results that are competitive with virtually all known compression algorithms on standard test images. Yet this performance is achieved with a technique that requires absolutely no training, no pre-stored tables or Codebooks, and requires no prior knowledge of the image source. The EZW algorithm is based on four key concepts: 1) a discrete wavelet transform or hierarchical subband decomposition, 2) prediction of the absence of significant information across scales by exploiting the self-similarity inherent in images, 3) entropy-coded successive-approximation quantization, and 4) universal lossless data compression which is achieved via adaptive arithmetic coding.

关键词： Image coding Wavelet coefficients Streaming media Decoding Discrete wavelet transforms Rate distortion theory Bit rate compression algorithms Testing Quantization

来源：评论

学校读者我要写书评

暂无评论

A new complexity measure for time series analysis and classification

引用

EUROPEAN PHYSICAL JOURNAL-SPECIAL TOPICS 2013年第3-4期222卷 847-860页

作者： Nagaraj, Nithin Balasubramanian, Karthi Dey, Sutirth Amrita Vishwa Vidyapeetham Amrita Sch Engn Dept Elect & Commun Engn Kollam 690525 Kerala India Indian Inst Sci Educ & Res Div Biol Pune 411021 Maharashtra India Natl Inst Adv Studies Sch Nat Sci & Engn Adjunct Fac Bangalore 560012 Karnataka India

Complexity measures are used in a number of applications including extraction of information from data such as ecological time series, detection of non-random structure in biomedical signals, testing of random number generators, language recognition and authorship attribution etc. Different complexity measures proposed in the literature like Shannon entropy, Relative entropy, Lempel-Ziv, Kolmogrov and Algorithmic complexity are mostly ineffective in analyzing short sequences that are further corrupted with noise. To address this problem, we propose a new complexity measure ETC and define it as the "Effort To Compress" the input sequence by a lossless compression algorithm. Here, we employ the lossless compression algorithm known as Non-Sequential Recursive Pair Substitution (NSRPS) and define ETC as the number of iterations needed for NSRPS to transform the input sequence to a constant sequence. We demonstrate the utility of ETC in two applications. ETC is shown to have better correlation with Lyapunov exponent than Shannon entropy even with relatively short and noisy time series. The measure also has a greater rate of success in automatic identification and classification of short noisy sequences, compared to entropy and a popular measure based on Lempel-Ziv compression (implemented by Gzip).

关键词： complexity ETC classification Input sequence Complexity compression algorithms entropy time series analysis Algorithmic complexity Electron transport chain Lempel-Ziv Time series European territorial cooperation Automatic toll collection

来源：评论

学校读者我要写书评

暂无评论

ADAPTING BOYER-MOORE-LIKE algorithms FOR SEARCHING HUFFMAN ENCODED TEXTS

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2012年第2期23卷 343-356页

作者： Cantone, Domenico Faro, Simone Giaquinta, Emanuele Univ Catania Dipartimento Matemat & Informat Viale A Doria 6 I-95125 Catania Italy

In this paper we propose an efficient approach to the compressed string matching problem on Huffman encoded texts, based on the BOYER-MOORE strategy. Once a candidate valid shift has been located, a subsequent verification phase checks whether the shift is codeword aligned by taking advantage of the skeleton tree data structure. Our approach leads to algorithms that exhibit a sublinear behavior on the average, as shown by extensive experimentation.

关键词： String matching compression algorithms Huffman coding Boyer-Moore algorithm text processing information retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：