In this paper, we present a very simple color space transform HVSCT inspired by an actual analog transform performed by the human visual system. We evaluate the applicability of the transform to lossy image compressio...
详细信息
ISBN:
(纸本)9783319582740
In this paper, we present a very simple color space transform HVSCT inspired by an actual analog transform performed by the human visual system. We evaluate the applicability of the transform to lossy image compression by comparing it, in the cases of JPEG 2000 and JPEG-XR coding, to the ICT/YCbCr and YCoCg transforms for 3 sets of test images. The presented transform is competitive, especially for high-quality or near-lossless compression. In general, while the HVSCT transform results in PSNR close to YCoCg and better than the most commonly used YCbCr transform, at the highest bitrates it is in many cases the best among the tested transforms. The HVSCT applicability reaches beyond the compressed image storage;as its components are closer to the components transmitted to the human brain via the optic nerve than the components of traditional transforms, it may be effective for algorithms aimed at mimicking the effects of processing done by the human visual system, e.g., for image recognition, retrieval, or image analysis for data mining.
This paper presents an algorithm for similar image retrieval which is based on the Bag-of-Words model. In Computer Vision the classic BoW algorithm is mainly used in image classification. Its operation is based on pro...
详细信息
ISBN:
(纸本)9783319676425;9783319676418
This paper presents an algorithm for similar image retrieval which is based on the Bag-of-Words model. In Computer Vision the classic BoW algorithm is mainly used in image classification. Its operation is based on processing of one image, creating a visual words dictionary, and specifying the class to which a query image belongs. In the presented modification of the BoW algorithm two different image feature have been chosen, namely a visual words' occurrence frequency histogram and a color histogram. As a result, using multi-criteria comparison, which so far has not been used in the BoW algorithms, a set of images similar to a query image is obtained, which is located on the Pareto-optimal non-dominated solutions front.
SAR image registration is a precursor for several remote sensing applications, which need precise spatial transformation between the real time moving image and fixed off-line image. In such applications, the processin...
详细信息
SAR image registration is a precursor for several remote sensing applications, which need precise spatial transformation between the real time moving image and fixed off-line image. In such applications, the processing time in finding whether the moving images can be registered with fixed image constitute an overhead. Hence we have approached the problem by trying to predict if the given SAR images can be registered or not even without registering them. The proposed image registration approach incorporates a classifier into the standard pipeline of feature based image registration. The attributes for the classifier model are derived from fusing the spatial parameters of the feature detector to the descriptor vector in bag of visual words framework. (C) 2017 The Authors. Published by Elsevier B.V.
An efficient and fully automated algorithm for the alignment of serially acquired 2D slices forming a 3D volume is presented. The methodology includes four stages: pre-processing using a median filter, obtaining a thr...
详细信息
An efficient and fully automated algorithm for the alignment of serially acquired 2D slices forming a 3D volume is presented. The methodology includes four stages: pre-processing using a median filter, obtaining a threshold value via a Laplacian weighted histogram, skeletonization and image alignment. The introduction of the skeletonization in this approach ensures that the images are being aligned with respect to the bones and large organs. The image alignment algorithm relies on the Enhanced Correlation Coefficient (ECC) alignment algorithm. The presented approach is evaluated on the Medical image Computing and Computer Assisted Intervention (MICCAI) 2007 grand challenge datasets and the evaluation metric used is mean squared difference (MSD). The proposed approach proved to perform well and achieved an improvement in the MS D by an average of 32.85%.
Denoising is one of the fundamental pre-processing tasks in imageprocessing that improves the quality of the information in the image. processing of hyperspectral images requires high computational power and time. In...
详细信息
Denoising is one of the fundamental pre-processing tasks in imageprocessing that improves the quality of the information in the image. processing of hyperspectral images requires high computational power and time. In this paper, a denoising technique based on least square weighted regularization in the spectral domain is proposed. The proposed technique is experimented on standard hyperspectral datasets and also, the performance of the proposed least square denoising in spectral domain is compared with least square weighted regularization in the spatial domain and total variation based denoising method. The obtained results in terms of computational time, Signal-to-Noise Ratio calculations and visual interpretation depicts that the proposed technique performs comparably better than the existing methods such as least square and total variation based hyperspectral image denoising. (C) 2017 The Authors. Published by Elsevier B.V.
A point of interest is the characteristic of an image which can be robustly detected due to its well-defined position. The points of interest should be easily computable and are invariant to transformations in the ima...
详细信息
ISBN:
(纸本)9781509044429
A point of interest is the characteristic of an image which can be robustly detected due to its well-defined position. The points of interest should be easily computable and are invariant to transformations in the image domain. This paper presents a novel interest point detector based on a graph centrality measure defined over the Laplacian energy of the local image network. The proposed method considers the local circular neighborhood of each pixel and associates this with an undirected graph or network. Euclidean distance is employed to connect pixels to form graph edges. The Laplacian energy of the graph will drop when a vertex is removed from it. This relative reduction indicates the significance of that vertex in the network. Graph vertices having higher values of Laplacian centrality are identified as central most nodes. This measure of pixel significance indicates the presence of interest points. The effectiveness and robustness of the proposed approach in detecting local points of high entropy values are demonstrated by the experiments conducted on standard datasets. The visual assessment of the identified interest points correlates with the coverage value calculated. Moreover, the proposed method shows stable results in the presence of geometric transformations such as rotation, viewpoint changes, and zooms. These results provide substantial evidence of the proposed interest point detector's utility in imageprocessing applications such as image registration, object recognition, and image matching, etc.
As the results of computer algorithms methods are often visual, image quality assessment is one of its central problems. To provide a convincing proof that a new method is better than the state-of-theart the image qua...
详细信息
ISBN:
(纸本)9783319472744;9783319472737
As the results of computer algorithms methods are often visual, image quality assessment is one of its central problems. To provide a convincing proof that a new method is better than the state-of-theart the image quality assessment should be employed. Therefore image based projects are often accompanied by user studies, in which a group of observers rank or rate results of several algorithms. Unfortunately the problem posed by subjective experiments is their time-consuming and expensive nature. This paper is intended to present how to make the subjective experiments less expensive and therefore more usable.
We present a new stylization method to generate Random-needle Embroidery stitches which is a graceful Chinese embroidery art formed by intersecting stitches. First, we model the intersecting stitch and initialize stit...
详细信息
ISBN:
(纸本)9783030007645;9783030007638
We present a new stylization method to generate Random-needle Embroidery stitches which is a graceful Chinese embroidery art formed by intersecting stitches. First, we model the intersecting stitch and initialize stitches positions and directions for regions. The Markov chain model is used to select similar intersecting stitches for filling each region to avoid artifacts in local area. Then a hierarchical iterative stitches generation process is used to keep the characteristic of multi-layering of stitches. Finally, top layer stitches in each iteration of the generation process are slightly moved according to bottom stitches by a Lloyd's method based approach to make stitches maintain the characteristic of uniform distribution. Experiments show that our result stitches can avoid artifacts in local area and maintain the uniformity and multi-layering at the same time. Comparing with the state-of-the-art methods, our result stitches have a richer visual effect.
We propose a novel image stitching method using multiple homographies. The method can stitch images having different parallaxes, such as an image that contains distant buildings and close trees. Such images might not ...
详细信息
ISBN:
(纸本)9781538606124
We propose a novel image stitching method using multiple homographies. The method can stitch images having different parallaxes, such as an image that contains distant buildings and close trees. Such images might not be stitched with fine quality by single global homography. Therefore, we select a background homography by analyzing the inliers of the homographies estimated by RANSAC (random sample consensus) for leave-one-out segmented regions, and the left segmented region of the background homography is designated as an object region. Then, the object homography is estimated by the object region. Using these multiple homographies, image stitching and multi-band blending are performed. With this method, images having different parallaxes are stitched with higher visual quality than with other methods using single homography and multiple homographies.
Artificial neural networks (ANNs) have been applied in many areas successfully because of their ability to learn, ease of implementation and fast real-Time operation. In this research, there are proposed two algorithm...
详细信息
暂无评论