一致性等效边缘电磁流的经验公式

本文给出了一种改进的等效电磁流公式，该公式是基于Ａ．Ｍｉｃｈｅａｌｉ［４］的表达式的。当观察方向位于Ｋｅｌｌｅｒ锥上时，改进的Ｄｅ，Ｄｍ表达式可化简为Ｋｏｕｙｏｕｍｊｉａｎ［１］的绕射系数，等效电磁流的表达式同Ｋｎｏｔｔ和Ｓｅｎｉｏｒ［２］的表达式完全一样。在阴影和反射边界上，改进的等效电磁流公式具有一致性     

二维离散余弦变换的一种新的快速算法

本文介绍了二维离散余弦变换（ＤＣＴ）的一种新的快速算法，对于Ｎ×Ｎ ＤＣＴ（Ｎ＝２＾ｍ），只需用Ｎ个一维ＤＣＴ和若干加法运算。与常规的行－列法相比，所需的乘法运算量减少了一半，也比其它的快速算法的乘法运算量要少，而加法运算量基本上是相同的。     

二维离散余弦变换的一种新的快速算法

介绍了二维离散余弦变换的一种新的快速算法，对于Ｎ×ＮＤＣＴ（Ｎ＝２ｍ），只需用Ｎ个一维ＤＣＴ和若干加法运算，与常规的行一列法相比，所需的乘法运算量减少了一半，也比其它快速算法的乘法运算量要少，而加法运算量基本上是相同的。     

小N点二维离散余弦变换的快速算法

本文提出了一种二维旋转因子的分解算法．并以此提出了一种小Ｎ点二维离散余弦变换（２Ｄ—ＤＣＴ）的快速算法,可比传统的２Ｄ—ＤＣＴ算法节约４２％的乘法,加法数几乎相同．     

基于FPGA的实时高速二维DCT／IDCT处理器

在Ｗ．Ｌｉ提出的循环斜卷积分布算法［１］的基础上，利用ＦＰＧＡ设计可用于高速数据传输设备的二维８×８ＤＣＴ／ＩＤＣＴ实时处理器。它可用一根信号线控制计算ＤＣＴ／ＩＤＣＴ，其输入、输出为１４位、内部数据线及内部参数均为１６位。     

一种快速计算DCT的递归算法及其硬件实现

给出了一种快速计算离散余弦变换的递归算法结构。该结构给出了用两个２＾Ｎ－１点ＤＣＴ去代替２＾ 蝶ＣＴ，在此基础上，提出了一种简单实用的用开关控制的ＤＣＴ／ＩＤＣＴ相结合的实现结构，在该 ，仅有正系数的乘法运算和基本的蝶形运算。     

多级复合布尔函数性能研究

本文研究了加法复合布尔函数和乘法复合布尔函数,在平衡性、k次项系数、K次扩散准则(PC)、相关免疫 性(CI)、Walsh谱、代数次数、小项分布等方面得到了一批新结果。     

《国外电子元器件》2001年总目录

电源及功率器件类ＭＩＣ２７７８和ＭＩＣ２５４５在ＵＳＢ双限流开关中的应用［１-６５］Ｍ２５７５系列开关稳压集成电路及其应用［１-６７］电子产品的瞬变和浪涌防护［２-１１］高压大电流达林顿晶体管阵列系列产品及其应用［２-１９］功率因数校正控制器ＭＳＣ６００２８的原理及应用［２-５９］ＡＮ８０ＬＸＸＲＭＳ系列低降落正输出电压调节器［２-６４］电压驱动型脉宽调制器ＴＬ４９４［２-６６］锂离子电池充电器［２-６９］大功率集成器件的新发展—ＩＧＣＴ［３-１０］集成充电控制器ＬＭ３６４７及其应用［３-３１］ＴＯＰＳｗ…     

本征方程[A][u]=λ[u]的矩阵摄动理论及其在电磁学中的应用

本文研究本征方程［Ａ］［ｕ］＝λ［ｕ］的矩阵摄动理论，进而给出了本征值λ和本征矢［ｕ］的１－３阶摄动解，并应用于微波谐振腔的具体实例。     

线性方程的列初等变换求解算法

引入了任意（ｍ，ｎ）－矩阵的准下三角阵、最简准下三角阵和准标准形新概念，得到了用系数矩阵的列初等变换求基础解系的几个定理，适用于任意线性方程的求解定理，进而给出了计算机化求解算法和实用程序。纠正了文［１］等“只用列初等变换或用行、列初等交换不能解线性方程组”的错误结论。     

Adaptive reconstruction technique for the lost information of the rectangular image area

The adaptive reconstruction for the lost information of the rectangular image area is very important for the robust transmission and restoration of the image. In this paper, a new reconstruction method based on the Discrete Cosine Transform (DCT) domain has been put forward. According to the low pass character of the human visual system and the energy distribution of the DCT coefficients on the rectangular boundary, the DCT coefficients of the rectangular image area are adaptively selected and recovered. After the Inverse Discrete Cosine Transform (IDCT), the lost information of the rectangular image area can be reconstructed. The experiments have demonstrated that the subjective and objective qualities of the reconstructed images are enhanced greatly than before.     

基于重组DCT系数子带能量直方图的图像检索

现在许多图像采用JPEG格式存储,检索这些图像通常要先解压缩,然后提取基于像素域的特征矢量进行图像检索。己有文献提出直接在DCT域进行图像检索的方法,这样可以降低检索的时间复杂度。本文提出对JPEG图像的DCT系数利用多分辨率小波变换的形式进行重组,对整个数据库中所有图像的DCT系数重组得到的若干子带,分别建立子带能量直方图,而后采用Morton顺序建立每幅图像的索引,并采用变形B树结构组织图像数据库用于图像检索。     

基于DCT系数小波重组的图像压缩算法

论文提出一种与小波变换结构近似的嵌入式编码—MSESPIHT。将图像8×8子块进行DCT变换后的系数按照小波变换结构重新组合,运用均值去除法降低低频段系数的冗余度。之后,运用基于分层树集合分割排序的编码算法对图像进行压缩编码。实验表明,采用MSESPIHT处理的图像,在相同压缩比的情况下,图像质量得到改善,当码率为1.00bpp时,EZW、MSEDCT、SPIHT、MSESPIHT、峰值信噪比分别为39.55dB、39.75dB、39.97dB、40.12dB。     

Image extraction in DCT domain

More and more digital images are being stored in compressed formats, among which the format using discrete cosine transform (DCT) coefficients is widely adopted (JPEG, MPEG, H.263 etc). To exploit those successful image processing techniques developed in the pixel domain, the authors propose a fast image extraction algorithm to allow images to be extracted directly from compressed DCT coefficients without full decompression. In the proposed technique the extracted images retain quality comparable with that of fully decoded images. However, the computing cost and the storage expense incurred by the proposed algorithm are very much lower than the costs of full decompression. The experiments also demonstrate that the proposed algorithm has tremendous potential in that all existing image processing techniques developed in the pixel domain can be directly applied to compressed images, without involving full decompression.     

A mixed transform approach for efficient compression of medical images

A novel technique is presented to compress medical data employing two or more mutually nonorthogonal transforms. Both lossy and lossless compression implementations are considered. The signal is first resolved into subsignals such that each subsignal is compactly represented in a particular transform domain. An efficient lossy representation of the signal is achieved by superimposing the dominant coefficients corresponding to each subsignal. The residual error, which is the difference between the original signal and the reconstructed signal is properly formulated. Adaptive algorithms in conjunction with an optimization strategy are developed to minimize this error. Both two-dimensional (2-D) and three-dimensional (3-D) approaches for the technique are developed. It is shown that for a given number of retained coefficients, the discrete cosine transform (DCT)-Walsh mixed transform representation yields a more compact representation than using DCT or Walsh alone. This lossy technique is further extended for the lossless case. The coefficients are quantized and the signal is reconstructed. The resulting reconstructed signal samples are rounded to the nearest integer and the modified residual error is computed. This error is transmitted employing a lossless technique such as the Huffman coding. It is shown that for a given number of retained coefficients, the mixed transforms again produces the smaller rms-modified residual error. The first-order entropy of the error is also smaller for the mixed-transforms technique than for the DCT, thus resulting in smaller length Huffman codes.     

Transform coded image reconstruction exploiting interblockcorrelation

Transmission of still images and video over lossy packet networks presents a reconstruction problem at the decoder. Specifically, in the case of block-based transform coded images, loss of one or more packets due to network congestion or transmission errors can result in errant or entirely lost blocks in the decoded image. This article proposes a computationally efficient technique for reconstruction of lost transform coefficients at the decoder that takes advantage of the correlation between transformed blocks of the image. Lost coefficients are linearly interpolated from the same coefficients in adjacent blocks subject to a squared edge error criterion, and the resulting reconstructed coefficients minimize blocking artifacts in the image while providing visually pleasing reconstructions. The required computational expense at the decoder per reconstructed block is less than 1.2 times a non-recursive DCT, and as such this technique is useful for low power, low complexity applications that require good visual performance.     

MPEG-2到MPEG-4视频转编码中的快速运动矢量重估算法

本文讨论了MPEG-2到MPEG-4视频转编码问题，提出了两种快速运动矢量重估算法，分别基于空域和时域。我们的算法利用已有运动信息和DCT变换的直流系数进行运动估计，可明显减少运算量，提高编码速度，并获得了与全搜索算法接近的图像质量，可满足网络视频传输的实时要求。     

Image vector quantizer based on a classification in the DCT domain

A classification algorithm in the discrete cosine transform (DCT) domain for the classified vector quantization (CVQ) technique is proposed. The classifier employs four DCT coefficients of 4×4 subblock as edge-oriented features. The classifier is designed using a cluster-seeking algorithm to ensure that the centroid of a set of vectors in a class always belong to that class. Since the classification is performed in the DCT domain, this approach can be easily extended to the DCT transform coding technique. Simulation results show that a good visual quality of the coded image at fixed rates in the 0.625-0.813 b/pixel (bpp) range is obtained with comparable complexity. The weighted MSE (WMSE) analysis in conjunction with the proposed classifier is discussed     

Locating edges and removing ringing artifacts in JPEG images by frequency-domain analysis.

We present a method of locating edges in JPEG-coded images which operates in frequency space on the DCT coefficients. Applied to the quantized DCT coefficients of a block containing a straight edge, the method yields an equation for the edge in a fraction of the operations needed to dequantize and transform the coefficents to pixel values. As a sample application of this method, we present a technique for alleviating ringing artifacts in JPEG-coded images.     

基于H.264的子带DCT快速算法

DCT快速算法是H.264编码的关键问题之一。该文根据H.264中44块残差系数的分布特征及DCT系数的能量分布特性,提出一种基于DCT系数子带划分的子带DCT快速算法。该算法在DCT和量化前预判出为零的DCT系数,节省了这些系数的DCT和量化计算开销,提高编码效率。该文提出了划分DCT系数子带的判断标准,预判出子带中量化后为零的DCT系数后,仅计算非零的DCT系数,相应地也减少量化(Q),反DCT(IDCT),反量化(IQ)的计算。实验结果表明,该文算法在保持图像质量和码率的同时,极大地节省了DCT, Q,IQ,IDCT的计算量,提高了H.264的编码效率。