Image Restoration Based on Quadtree Data Structures
نویسندگان
چکیده
منابع مشابه
Image Restoration Based on Quadtree Data Structures
This paper investigates the problem of image restoration when the image is corrupted by Pepper-and-salt noise and proposes a new restoration algorithm based on quadtree data structures. The crucial parts of the algorithm are picking noise and fuzzy estimation, so that unlike some other usual denoising methods, it avoids blurring and averaging edges and non-noise pixels. This paper describes, an...
متن کاملData Structures for Quadtree
A number of data structures for representing images by quadtrees without pointers are discussed. The image is treated as a collection of leaf nodes. Each leaf node is represented by use of a locational code corresponding to a sequence of directional codes that locate the leaf along a path from the root of the tree. Somewhat related is the concept of a forest which is a representation that consi...
متن کاملImage restoration based on multiscale relationships of image structures
Aerial photographs sometimes suffer from artifacts caused by vignetting effects and changing topographic sun–canopy–sensor geometry. In this paper, we present an empirical image restoration method that is based on multiscale relationships of image structures. The fine-scale image structures depict tree crowns in a deciduous forest and serve as units in the restoration process. The color image i...
متن کاملImage Restoration by Variable Splitting based on Total Variant Regularizer
The aim of image restoration is to obtain a higher quality desired image from a degraded image. In this strategy, an image inpainting method fills the degraded or lost area of the image by appropriate information. This is performed in such a way so that the obtained image is undistinguishable for a casual person who is unfamiliar with the original image. In this paper, different images are degr...
متن کاملImage Compression based on Quadtree and Polynomial
In this paper, an efficient image compression scheme is introduced, it is based on partitioning the image into blocks of variable sizes according to its locally changing image characteristics and then using the polynomial approximation to decompose image signal with less compressed information required compared to traditional predictive coding techniques, finally Huffman coding utilized to impr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Signal Processing, Image Processing and Pattern Recognition
سال: 2015
ISSN: 2005-4254
DOI: 10.14257/ijsip.2015.8.8.17