The number of arithmetic units used in the one-dimensional (1D) discrete wavelet transform (DWT) is the main consideration for reducing the area of VLSI implementation of 1D DWT, while the size of intermediate memory ...
详细信息
ISBN:
(纸本)0780390156
The number of arithmetic units used in the one-dimensional (1D) discrete wavelet transform (DWT) is the main consideration for reducing the area of VLSI implementation of 1D DWT, while the size of intermediate memory used for data buffering is another dominate factor of effecting hardware complexity of VLSI implementation for two-dimensional (2D) DWT. In this paper, we exploit the essential relationship between the size of temporal buffer (TB) required in the line-based architecture for 2D DWT (LBA2DDWT) and the number of registers used in the 1D DWT module, and present an improved method of mapping the registers used in the 1D DWT to the TB required in LBA2DDWT. Comparison results with the other design reported in previous literature demonstrate that, the proposed mapping method can reduce efficiently the size of memory required in LBA2DDWT.
An efficient generic architecture for two-dimensional discrete wavelet transform (2-D DWT) with line-based method is proposed with using lifting scheme, in which the parallelism of four subbands transform in lifting-b...
详细信息
ISBN:
(纸本)0780390059
An efficient generic architecture for two-dimensional discrete wavelet transform (2-D DWT) with line-based method is proposed with using lifting scheme, in which the parallelism of four subbands transform in lifting-based 2-D DWT is exploited. The proposed architecture is designed to generate 4 subbands coefficients concurrently per clock cycle that :an perform a 1-level decomposition of a N/spl times/N image in approximately N/sup 2//4 working clock cycles, which has faster throughput rate but requires less hardware cost compared 10 the designs reported in previous literature.
This paper proposes a novel fast architecture for two-dimensional discrete wavelet transform by using lifting scheme. The parallel and embedded decimation techniques are employed to optimize the architecture, which is...
详细信息
This paper proposes a novel fast architecture for a 2D discrete wavelet transform by using a lifting scheme, Parallel and embedded decimation techniques are employed to optimize the architecture, which is mainly compo...
详细信息
ISBN:
(纸本)078038511X
This paper proposes a novel fast architecture for a 2D discrete wavelet transform by using a lifting scheme, Parallel and embedded decimation techniques are employed to optimize the architecture, which is mainly composed of two horizontal filter modules and one vertical filter module, working in parallel and pipeline fashion with 100% hardware utilization. The architecture is designed to generate two outputs in one working clock cycle, with every two subbands coefficients alternately. The total time for computing J levels of decomposition for an N/spl times/N image is approximately 2N/sup 2/(1-4/sup -J/)/3 clock cycles. In comparison with the other devices reported in previous literature, the design has many advantages including lower hardware complexity and area and power efficiency. The design is also fast, regular and simple, as well as well suited for VLSI implementation.
Retinal image registration is commonly required in order to combine the complementary information in different retinal modalities images, which is very useful for clinic diagnoses and laser treatment. In the paper, an...
详细信息
ISBN:
(纸本)0780375084
Retinal image registration is commonly required in order to combine the complementary information in different retinal modalities images, which is very useful for clinic diagnoses and laser treatment. In the paper, an automatic scheme to register retinal images based on blood vessel feature point extraction is presented. Firstly, the crossover and branching points of the RF (red-free) retinal image and the FA (fluoroscein angiography) retinal image are extracted using a multi-direction exploratory method after the blood vessel visibility is enhanced. Considering the number of feature points extracted on different images are not equal and their location does not correspond between the retinal images, the scheme described in the paper combined the closest interval criterion between the corresponding feature points with a SVD algorithm to accurately register retinal images. Our method compared with previously known ways is an efficient and automatic scheme of retinal image registration. The experimental results indicate the registration of the fluoroscein angiography image with the corresponding red-free retinal image and a series of the fluoroscein angiography images can be also successful using our method.
Augmented reality is the merging of synthetic sensory information into a user's perception of a real environment. As one of the most important tasks in augmented scene modeling, terrain simplification research has...
详细信息
Augmented reality is the merging of synthetic sensory information into a user's perception of a real environment. As one of the most important tasks in augmented scene modeling, terrain simplification research has gained more and more attention. In this paper, we mainly focus on point selection problem in terrain simplification using triangulated irregular network. Based on the analysis and comparison of traditional importance measures for each input point, we put forward a new importance measure based on local entropy. The results demonstrate that the local entropy criterion has a better performance than any traditional methods. In addition, it can effectively conquer the 'short-sight' problem associated with the traditional methods.
Because of wide variation in gray levels and particle dimensions and the presence of many small gravel objects in the background, as well as corrupting the image by noise, it is difficult o segment gravel objects. In ...
详细信息
Because of wide variation in gray levels and particle dimensions and the presence of many small gravel objects in the background, as well as corrupting the image by noise, it is difficult o segment gravel objects. In this paper, we develop a partial entropy method and succeed to realize gravel objects segmentation. We give entropy principles and fur calculation methods. Moreover, we use minimum entropy error automaticly to select a threshold to segment image. We introduce the filter method using mathematical morphology. The segment experiments are performed by using different window dimensions for a group of gravel image and demonstrates that this method has high segmentation rate and low noise sensitivity.
暂无评论