- Vol: 11 Issue: 1
- Vol: 11 Issue: 2
- Vol: 11 Issue: 3
- Vol: 11 Issue: 4
- Vol: 11 Issue: 5
- Vol: 11 Issue: 6
- Vol: 11 Issue: 7
- Vol: 11 Issue: 8
- Vol: 11 Issue: 9
- Vol: 11 Issue: 10
- Vol: 11 Issue: 11
- Vol: 11 Issue: 12
- Vol: 10 Issue: 1
- Vol: 10 Issue: 2
- Vol: 10 Issue: 3
- Vol: 10 Issue: 4
- Vol: 10 Issue: 5
- Vol: 10 Issue: 6
- Vol: 10 Issue: 7
- Vol: 10 Issue: 8
- Vol: 10 Issue: 9
- Vol: 10 Issue: 10
- Vol: 10 Issue: 11
- Vol: 10 Issue: 12
- Vol: 9 Issue: 1
- Vol: 9 Issue: 2
- Vol: 9 Issue: 3
- Vol: 9 Issue: 4
- Vol: 9 Issue: 5
- Vol: 9 Issue: 6
- Vol: 9 Issue: 7
- Vol: 9 Issue: 8
- Vol: 9 Issue: 9
- Vol: 9 Issue: 10
- Vol: 9 Issue: 11
- Vol: 9 Issue: 12
- Vol: 8 Issue: 1
- Vol: 8 Issue: 2
- Vol: 8 Issue: 3
- Vol: 8 Issue: 4
- Vol: 8 Issue: 5
- Vol: 8 Issue: 6
- Vol: 8 Issue: 7
- Vol: 8 Issue: 8
- Vol: 8 Issue: 9
- Vol: 8 Issue: 10
- Vol: 8 Issue: 11
- Vol: 8 Issue: 12
- Vol: 7 Issue: 1
- Vol: 7 Issue: 2
- Vol: 7 Issue: 3
- Vol: 7 Issue: 4
- Vol: 7 Issue: 5
- Vol: 7 Issue: 6
- Vol: 7 Issue: 7
- Vol: 7 Issue: 8
- Vol: 7 Issue: 9
- Vol: 6 Issue: 1
- Vol: 6 Issue: 2
- Vol: 6 Issue: 3
- Vol: 6 Issue: 4
- Vol: 6 Issue: 5
- Vol: 6 Issue: 6
- Vol: 6 Issue: 7
- Vol: 6 Issue: 8
- Vol: 6 Issue: 9
- Vol: 11 Issue: 1
- Vol: 11 Issue: 2
- Vol: 11 Issue: 3
- Vol: 11 Issue: 4
- Vol: 11 Issue: 5
- Vol: 11 Issue: 6
- Vol: 11 Issue: 7
- Vol: 11 Issue: 8
- Vol: 11 Issue: 9
- Vol: 11 Issue: 10
- Vol: 11 Issue: 11
- Vol: 11 Issue: 12
- Vol: 10 Issue: 1
- Vol: 10 Issue: 2
- Vol: 10 Issue: 3
- Vol: 10 Issue: 4
- Vol: 10 Issue: 5
- Vol: 10 Issue: 6
- Vol: 10 Issue: 7
- Vol: 10 Issue: 8
- Vol: 10 Issue: 9
- Vol: 10 Issue: 10
- Vol: 10 Issue: 11
- Vol: 10 Issue: 12
- Vol: 9 Issue: 1
- Vol: 9 Issue: 2
- Vol: 9 Issue: 3
- Vol: 9 Issue: 4
- Vol: 9 Issue: 5
- Vol: 9 Issue: 6
- Vol: 9 Issue: 7
- Vol: 9 Issue: 8
- Vol: 9 Issue: 9
- Vol: 9 Issue: 10
- Vol: 9 Issue: 11
- Vol: 9 Issue: 12
- Vol: 8 Issue: 1
- Vol: 8 Issue: 2
- Vol: 8 Issue: 3
- Vol: 8 Issue: 4
- Vol: 8 Issue: 5
- Vol: 8 Issue: 6
- Vol: 8 Issue: 7
- Vol: 8 Issue: 8
- Vol: 8 Issue: 9
- Vol: 8 Issue: 10
- Vol: 8 Issue: 11
- Vol: 8 Issue: 12
- Vol: 7 Issue: 1
- Vol: 7 Issue: 2
- Vol: 7 Issue: 3
- Vol: 7 Issue: 4
- Vol: 7 Issue: 5
- Vol: 7 Issue: 6
- Vol: 7 Issue: 7
- Vol: 7 Issue: 8
- Vol: 7 Issue: 9
- Vol: 6 Issue: 1
- Vol: 6 Issue: 2
- Vol: 6 Issue: 3
- Vol: 6 Issue: 4
- Vol: 6 Issue: 5
- Vol: 6 Issue: 6
- Vol: 6 Issue: 7
- Vol: 6 Issue: 8
- Vol: 6 Issue: 9
Volume 2 Issue 4 • August 2008
Filter Results
Previous Titles
- ( 1994 - 2006 ) IEE Proceedings - Vision, Image and Signal Processing
- ( 1989 - 1993 ) IEE Proceedings I - Communications, Speech and Vision
- ( 1980 - 1988 ) Communications, Radar and Signal Processing, IEE Proceedings F
-
Near-computation-free image encoding scheme based on adaptive decimation
Publication Year: 2008, Page(s):175 - 184
Cited by: Papers (2) | Patents (1)Adaptive decimation (AD) is a technique that aims at compressing images with a very small amount of computations and memory requirement. For images that contain moderate amounts of textural content, the method exhibits satisfactory performance and in general provides good visual quality and acceptable coding fidelity at low bit-rate of around 0.2 bpp. Although the complexity of the method is relat... View full abstract»
-
Fast intra-prediction with near pixel correlation approach for H.264/AVC system
Publication Year: 2008, Page(s):185 - 193
Cited by: Papers (2)A fast intra-prediction algorithm to determine the coding mode for 4 x 4 blocks is presented. The near pixel-correlation integration approach is proposed to compute the parameter for each mode along the predictive direction. The parameters that can be easily estimated with the simple computation are useful to represent the feature of block mode. On the basis of the fast algorithm, only three to fo... View full abstract»
-
Compression of multi-polarimetric SAR intensity images based on 3D-matrix transform
Publication Year: 2008, Page(s):194 - 202
Cited by: Papers (3)The algorithms for multi-polarimetric synthetic aperture radar (SAR) intensity image compression are investigated. First, the multi-polarimetric SAR intensity images (HH, HV and VV) are considered as a 3D-matrix unit, and then a 3D-matrix transform is adopted to remove the redundancies, which includes ID discrete cosine transform (DCT) in the polarimetric channels and 2D discrete wavelet transform... View full abstract»
-
Wavelet-based image denoising with the normal inverse Gaussian prior and linear MMSE estimator
Publication Year: 2008, Page(s):203 - 217
Cited by: Papers (7)A new spatially adaptive wavelet-based method is introduced for reducing noise in images corrupted by additive white Gaussian noise. It is shown that a symmetric normal inverse Gaussian distribution is highly suitable for modelling the wavelet coefficients. In order to estimate the parameters of the distribution, a maximum- likelihood-based technique is proposed, wherein the Gauss-Hermite quadratu... View full abstract»
-
Fractal indexing with the joint statistical properties and its application in texture image retrieval
Publication Year: 2008, Page(s):218 - 230
Cited by: Papers (4) | Patents (1)Fractal image coding is a block-based scheme that exploits the self-similarity hiding within an image. Fractal parameters generated by the block-based scheme are quantitative measurements of self-similarity, and therefore they can be used to construct image signatures. By combining fractal parameters and collage error, a set of new statistical fractal signatures, such as histogram of collage error... View full abstract»
-
Complexity analysis of morphological area openings and closings with set union
Publication Year: 2008, Page(s):231 - 238
Cited by: Papers (1)Area openings and closings are basic connected morphological operators that remove connected components which fail an area criterion. They are widely used in image filtering (e.g. for noise reduction) and segmentation and can be implemented efficiently using union-find-based algorithms. The authors show that the computational complexity of morphological area openings/closings based on disjoint set... View full abstract»
Aims & Scope
The range of topics covered by IET Image Processing includes areas related to the generation, processing and communication of visual information.
Meet Our Editors
Publisher
IET Research Journals
iet_ipr@theiet.org