In this work, we employ the well-known Hamilton-Jacobi to Schrödinger connection to present a unified framework for computing boththe Euclidean distance function and its gradient density in two dimensions. Previ...
详细信息
ISBN:
(纸本)1595930361
In this work, we employ the well-known Hamilton-Jacobi to Schrödinger connection to present a unified framework for computing boththe Euclidean distance function and its gradient density in two dimensions. Previous work in this direction considered two different formalisms for independently computing these quantities. While the two formalisms are very closely related, their lack of integration is theoretically troubling and practically cumbersome. We introduce a novel Schrödinger wave function for representing the Euclidean distance transform from a discrete set of points. An approximate distance transform is computed from the magnitude of the wave function while the gradient density is estimated from the Fourier transform of the phase of the wave function. In addition to its simplicity and efficient O(N logN) computation, we prove that the wave function-based density estimator increasingly, closely approximates the distance transform gradient density (as a free parameter approaches zero) withthe added benefit of not requiring the true distance function. Copyright 2014 ACM.
In all imageprocessing applications, it is important to extract the appropriate information from an image. But often the captured image is not clear enough to give the required information due to the imaging environm...
详细信息
ISBN:
(纸本)9781479915880
In all imageprocessing applications, it is important to extract the appropriate information from an image. But often the captured image is not clear enough to give the required information due to the imaging environment. thus, it is essential to enhance the clarity of the image by some post-processing techniques. image deblurring is one of such techniques to remove the blurry effect of the captured image. this paper looks into this problem in a different way, where the deblurring of an image is addressed by solving image super-resolution problem. the blurred image is first down-sampled and then it is fed to the super-resolution framework to produce the deblurred high resolution image. In addition, the proposed approach states the requirement of edge preservation in the problem. the experimental results are comparable withthe existing image deblurring algorithms.
Scan time reduction in MRI can be achieved by partial k-space reconstruction. Truncation of the k-space results in generation of artifacts in the reconstructed image. A subspace projection algorithm is developed for a...
详细信息
ISBN:
(纸本)9781479915880
Scan time reduction in MRI can be achieved by partial k-space reconstruction. Truncation of the k-space results in generation of artifacts in the reconstructed image. A subspace projection algorithm is developed for artifact-free reconstruction of sparse MRI. the algorithm is applied to a frequency weighted k-space, which fits into a signal-space model for sparse MR images. the application is illustrated using Magnetic Resonance Angiogram (MRA).
this paper presents an implementation of an OCR system for the Meetei Mayek script. the script has been newly reintroduced and there is a growing set of documents currently available in this script. Our system accepts...
详细信息
ISBN:
(纸本)9781479915880
this paper presents an implementation of an OCR system for the Meetei Mayek script. the script has been newly reintroduced and there is a growing set of documents currently available in this script. Our system accepts an image of the textual portion of a page and outputs the text in the Unicode format. It incorporates preprocessing, segmentation and classification stages. However, no post-processing is done to the output. the system achieves an accuracy of about 96% on a moderate database.
One of the foremost requisite for human perception and computervision task is to get an image with all objects in focus. the image fusion process, as one of the solutions, allows getting a clear fused image from seve...
详细信息
ISBN:
(纸本)9781479915880
One of the foremost requisite for human perception and computervision task is to get an image with all objects in focus. the image fusion process, as one of the solutions, allows getting a clear fused image from several images acquired with different focus levels of a scene. In this paper, a novel framework for multi-focus image fusion is proposed, which is computationally simple since it realizes only in the spatial domain. the proposed framework is based on the fractal dimensions of the images into the fusion process. the extensive experiments on different multifocus image sets demonstrate that it is consistently superior to the conventional image fusion methods in terms of visual and quantitative evaluations.
In this paper, we present a fast and efficient algorithm for regularization and resampling of triangular meshes generated by 3D reconstruction methods such as stereoscopy, laser scanning etc. We also present a scheme ...
详细信息
ISBN:
(纸本)9781479915880
In this paper, we present a fast and efficient algorithm for regularization and resampling of triangular meshes generated by 3D reconstruction methods such as stereoscopy, laser scanning etc. We also present a scheme for efficient parallel implementation of the proposed algorithm and the time gain with increasing number of processor cores.
Visual attention is an indispensable component of complex vision tasks. When looking at a complex scene, our ocular perception is confronted with a large amount of data that needs to be broken down for processing by o...
详细信息
ISBN:
(纸本)9781479915880
Visual attention is an indispensable component of complex vision tasks. When looking at a complex scene, our ocular perception is confronted with a large amount of data that needs to be broken down for processing by our psychovisual system. Selective visual attention provides a mechanism for serializing the visual data, allowing for sequential processing of the content of the scene. A Bottom-Up computational model is described that simulates the psycho-visual model of saliency based on features of intensity and color. the method gives sequential priorities to objects which other computational models cannot account for. the results demonstrate a fast execution time, full resolution maps and high detection accuracy. the model is applicable on both natural and artificial images.
A perceptual video hashing function maps the perceptual content of a video into a fixed-length binary string called the perceptual hash. Perceptual hashing is a promising solution to the content-identification and the...
详细信息
ISBN:
(纸本)9781479915880
A perceptual video hashing function maps the perceptual content of a video into a fixed-length binary string called the perceptual hash. Perceptual hashing is a promising solution to the content-identification and the content-authentication problems. the projections of image and video data onto a subspace have been exploited in the literature to get a compact hash function. We propose a new perceptual video hashing algorithm based on the Achlioptas's random projections. Simulation results show that the proposed perceptual hash function is robust to common signal and imageprocessing attacks.
Approximate Nearest-Neighbour Field has been an area of interest in recent research for a wide variety of topics in graphics and multimedia community. Medical imageprocessing is a relatively unaffected field by these...
详细信息
ISBN:
(纸本)9781479915880
Approximate Nearest-Neighbour Field has been an area of interest in recent research for a wide variety of topics in graphics and multimedia community. Medical imageprocessing is a relatively unaffected field by these developments in ANNF computations, brought about by various extremely efficient algorithms like PatchMatch. In this paper, we use Generalized PatchMatch for Optic Disk detection, in retinal images, and show that by making use of efficient ANNF computations we are able to generate results with 98% accuracy with an average time of 0.5 sec. this is significantly faster than conventional Optic Disk detection methods, which average at 95-97% accuracy with 3-5 sec average computation time.
暂无评论