CORC

在结果中检索

CORC

浏览/检索结果: 共9条，第1-9条 帮助

已选(0)清除 条数/页：   排序方式：
High-speed interrogation system of multi-encoding weak FBGs based on FDML wavelength swept laser 期刊论文
Optics and Laser Technology, 2018, 卷号: 107, 页码: 54-58
作者:  Liu, Quan;  Wang, Yiming;  Li, Zhengying*;  Shen, Peng;  Hou, Yarong
收藏  |  浏览/下载：40/0  |  提交时间：2019/12/04
Image compression algorithm of high-speed SPIHT for aerial applications (EI CONFERENCE) 会议论文
2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011, May 27, 2011 - May 29, 2011, Xi'an, China
Zhang N.; Jin L. X.; Tao H. J.; Zhang K.
收藏  |  浏览/下载：37/0  |  提交时间：2013/03/25
SPIHT and NLS (Not List SPIHT) are efficient compression algorithms  but the algorithms application is limited by the shortcomings of the poor error resistance and slow compression speed in the aviation and other areas requiring high-speed compression. In this paper  the error resilience and the compression speed are improved. The remote sensing images are decomposed by Le Gall5/3 wavelet  and wavelet coefficients are indexed  scanned and allocated by the means of family blocks. The bit-plane importance is predicted by bitwise OR  so the N bit-planes can be encoded at the same time. Compared with the SPIHT algorithm  this modified algorithm is easy implemented by hardware  and the compression speed is improved. The PSNR of reconstructed images encoded by high-speed SPIHT is slightly lower than SPIHT at rate 1bpp  but the speed is 4.5-6 times faster than SPIHT encoding process. The algorithm meets the high speed and reliability requirements of aerial applications. 2011 IEEE.  
RS-485 bus-based high-speed serial remote data transmissions 期刊论文
2010, 2010
Li Cheng; Wang Peng; Ding Tianhuai; Chen Ken; Geng Lizhong
收藏  |  浏览/下载：5/0
An improved fast parallel SPIHT algorithm and its FPGA implementation (EI CONFERENCE) 会议论文
2010 2nd International Conference on Future Computer and Communication, ICFCC 2010, May 21, 2010 - May 24, 2010, Wuhan, China
Wu Y.-H.; Jin L.-X.; Tao H.-J.
收藏  |  浏览/下载：17/0  |  提交时间：2013/03/25
In view of the current stringent need to the real-time compression algorithm of the high-speed and high-resolution image  such as remote sensing or medical image and so on  in this paper  No List SPIHT (NLS) algorithm has been improved  and a fast parallel SPIHT algorithm is proposed  which is suitable to implement with FPGA. It can deal with all bit-planes simultaneously  and process in the speed of 4pixels/period  so the encoding time is only relative to the image resolution. The experimental results show that  the processing capacity can achieve 200MPixels/s  when the input clock is 50MHz  the system of this paper need 2.29ms to complete lossless compression of a 512x512x8bit image  and only requires 1.31ms in the optimal state. The improved algorithm keeps the high SNR unchanged  increases the speed greatly and reduces the size of the needed storage space. It can implement lossless or lossy compression  and the compression ratio can be controlled. It could be widely used in the field of the high-speed and high-resolution image compression. 2010 IEEE.  
An image matching algorithm based on sub-block coding (EI CONFERENCE) 会议论文
2nd International Workshop on Computer Science and Engineering, WCSE 2009, October 28, 2009 - October 30, 2009, Qingdao, China
Feng Y.; Li S.; Dai M.
收藏  |  浏览/下载：21/0  |  提交时间：2013/03/25
In order to improve the speed of matching algorithm and simplify the processing of existing sub-block coding matching  a new template matching method combined local gray value encoding matching and phase correlation is proposed. Matching process is divided into rough matching and fine matching. Rough matching divides the image into certain size blocks called R-block  sums the gray value of each R-block pixel  encodes the R-block according to the gray value distribution of R-block with the adjacent R-block  and matches by step between the template and each search sub-image. Then  fine matching results are obtained using phase correlation according to initial match parameters. The time complexity of the proposed method is (M2) .The new algorithm is faster than traditional algorithm by two orders of magnitude  and the speed has improved twice compared with existing sub-block coding method. Experiments demonstrate that the new algorithm is robust to the linear transformation of pixel grey value and image noise  and it also has the stability of small-angle rotation. 2009 IEEE.  
Real-time video compressing under DSP/BIOS (EI CONFERENCE) 会议论文
MIPPR 2009 - Medical Imaging, Parallel Processing of Images, and Optimization Techniques: 6th International Symposium on Multispectral Image Processing and Pattern Recognition, October 30, 2009 - November 1, 2009, Yichang, China
Chen Q.-P.; Li G.-J.
收藏  |  浏览/下载：18/0  |  提交时间：2013/03/25
This paper presents real-time MPEG-4 Simple Profile video compressing based on the DSP processor. The programming framework of video compressing is constructed using TMS320C6416 Microprocessor  the architecture level optimizations are used to improve software pipeline. The system used DSP/BIOS to realize multi-thread scheduling. The whole system realizes high speed transition of a great deal of data. Experimental results show the encoder can realize real-time encoding of 768*576  TDS510 simulator and PC. It uses embedded real-time operating system DSP/BIOS and the API functions to build periodic function  25 frame/s video images. 2009 Copyright SPIE - The International Society for Optical Engineering.  tasks and interruptions etcs. Realize real-time video compressing. To the questions of data transferring among the system. Based on the architecture of the C64x DSP  utilized double buffer switched and EDMA data transfer controller to transit data from external memory to internal  and realize data transition and processing at the same time  
A new fast mode decision algorithm of 4x4 block intra prediction for H.264/AVC 会议论文
Beijing, China, October 18, 2009 - October 20, 2009
作者:  Zhengjian, Ding;  Changfan, Liu
收藏  |  浏览/下载：0/0  |  提交时间：2020/11/15
High speed, low memory image coding using zero blocks of wavelet coefficients (EI CONFERENCE) 会议论文
4th International Conference on Image and Graphics, ICIG 2007, August 22, 2007 - August 24, 2007, Chengdu, China
Yang W.-G.; Zhang T.; Zhang J.-D.
收藏  |  浏览/下载：22/0  |  提交时间：2013/03/25
We propose a new high speed  low memory SPECK image coder based on the form of block-unit states  called LBUS-SPECK  which uses the form of block-unit states and the form of block exponents to substitute LIS and LSP of SPECK. A form of block-unit states is introduced to store the significance flag of coefficients and the value of the block-unit exponents. A form of block exponents is introduced to store the block exponents which are used to represent the max coefficient in a decomposed block. A new block depth-finding strategy is developed for searching insignificant sets at sorting stage. Experimental results show that the obtained PSNR values for the decoded images are very close to those of SPECK algorithm and the memory consumption is reduced by 9 times  the encoding timing is saved about 15%. Comparing with SPECK algorithm  this algorithm not only has better performance of the decoded images  but also is easy to implement  especially  it provides an efficient way for hardware implementation of wavelet embedded block coding. 2007 IEEE.  
Compression of remote sensing image based on Listless Zerotree Coding and DPCM (EI CONFERENCE) 会议论文
ICO20: Remote Sensing and Infrared Devices and Systems, August 21, 2005 - August 26, 2005, Changchun, China
Chen S.-L.; Huang L.-Q.
收藏  |  浏览/下载：22/0  |  提交时间：2013/03/25
The data quantity of remote sensing image is very large. Furthermore  the lowest frequency subband contains the main energy of original image and reflects the coarse of original image after remote sensing image is transformed by wavelet  so it is very important to the reconstructed image. Therefore a hybrid image compression method based on Listless Zerotree Coding (LZC) and DPCM is presented  namely  the lowest frequency subband is compressed by DPCM and others are compressed by LZC. LZC is a kind of zerotree coding algorithm for hardware implementation  which is based on SPIHT and substitutes two significant bit maps for three lists in SPIHT algorithm. Thereby LZC significantly reduces the memory requirement and complexity during encoding and decoding procedure. But LZC doesn't recognize the significance of grandchild sets  so the PSNR values of LZC are lower than SPIHT's and the compression speed drops. It is improved by adding a significant bit map that recognizes the significance of grandchild sets. A comparison reveals that the PSNR results of the hybrid compression method are 2 dB higher than those of LZC  and the compression speed is also improved.  

©版权所有 ©2017 CSpace - Powered by CSpace