We present a novel image transform called Scale Manipulation (SMT). The transform can be used for object pose estimation and registration of affine transformed images in the presence of non homogenous illumination cha...
详细信息
ISBN:
(纸本)9781424444632
We present a novel image transform called Scale Manipulation (SMT). The transform can be used for object pose estimation and registration of affine transformed images in the presence of non homogenous illumination changes. The transform calculates affine invariant features of objects in a global manner and avoids using any sort of edge detection. The computational load of the method is relatively low since it is linear in the data size. In this paper we introduce the transform and demonstrate its applications for pose estimation in the presence of non uniform varying illumination.
We present a method of transformingloca I iniagedescriptors into a compact form of bit-sequences whose similarity is determined by Hamming distance. Following the locality-Sensitive Hashing approach, the descriptors a...
详细信息
ISBN:
(纸本)9781424444632
We present a method of transformingloca I iniagedescriptors into a compact form of bit-sequences whose similarity is determined by Hamming distance. Following the locality-Sensitive Hashing approach, the descriptors are projected on a set ofrandoin directions that are learned from a set of non-matching data. The learned random projections result in high-entropy binary codes (H E 2) that outperform codes based on standard random projections in niatch/non-match classification and nearest neighbor search. Despite of data compression and granularity of Hamming space, HE--descriptor outperforms the original descriptor in the classification task. In nearest neighbor search task, the performance of the H E2 -descriptor is asymptotic to the performance of the original descriptor. As a supporting result, we obtain another descriptor, HE 2+1, and demonstrate that the performance of the original descriptor can be improved by adding a few bits derived from the descriptor itself.
This paper describes our systems participating in the NEWS 2009 Machine Transliteration Shared Task. Two runs were submitted for the English-Chinese track. The system for the standard run is based on graphemic approxi...
详细信息
As one of the best image denoising methods, the non-local Means(NL-Means)algorithm[5] proposed by Buades et al. generates state-of-the-art performance. However, due to the high computational complexity, it is difficul...
详细信息
The proceedings contain 43 papers. The topics discussed include: texture preservation in de-noising UAV surveillance video through multi-frame sampling;fast geodesic distance approximation using mesh decimation and fr...
ISBN:
(纸本)9780819474957
The proceedings contain 43 papers. The topics discussed include: texture preservation in de-noising UAV surveillance video through multi-frame sampling;fast geodesic distance approximation using mesh decimation and front propagation;image object removal in redundant wavelet transform domain;nonlinear mapping of the luminance in dual-layer high dynamic range displays;color enhancement in a high dynamic range environment;active contours that grow and compete driven by local region descriptors;a fast intensity based non-rigid 2D-3D-registration using statistical shape models with application in radiotherapy;a Kernel representation for exponential splines with global tension;compression of multispectral fluorescence microscopic images based on a modified set partitioning in hierarchal trees;robust measurement of the blocking artefact;and image pixel guided tours: a software platform for non-destructive X-ray imaging.
This paper addresses the problem of efficient SIFT-based image description and searches in large databases within the framework of local querying. A descriptor called the bag-of-features has been introduced previously...
详细信息
This paper addresses the problem of efficient SIFT-based image description and searches in large databases within the framework of local querying. A descriptor called the bag-of-features has been introduced previously which first vector quantizes SIFT descriptors and then aggregates the set of resulting codeword indices (so-called visual words) into a histogram of occurrence of the different visual words in the image. The aim is to make the image search complexity tractable by transforming the set of localimage descriptor vectors into a single sparse vector as sparsity particularly permits efficient inner product calculations. However, aggregating local descriptors into a single histogram decreases the discerning power of the system when performing local queries. In this paper, we propose a new approach that aims to enjoy the complexity benefits of sparsity while at the same time retaining the local quality of the input descriptor vectors. This is accomplished by searching for a sparse approximation of the input SIFT descriptors. The sparse approximation yields a sparse vector per local SIFT descriptor, and helps preserving local description properties by using each sparse-transformed descriptor independently in a voting system to retrieve indexed images. Our system is shown experimentally to perform better than histogram based systems under query locality, albeit at an increased complexity.
In supervised and unsupervised image classification, it is known that contextual classification methods based on Markov random fields (MRFs) improve the performance of non-contextual classifiers. In this paper, we con...
详细信息
In supervised and unsupervised image classification, it is known that contextual classification methods based on Markov random fields (MRFs) improve the performance of non-contextual classifiers. In this paper, we consider the unsupervised unmixing problem based on MRFs. The exact solutions maximizing local conditional densities are derived, and they show excellent performance for unximing of data sets. Furthermore a new stochastic model based on conditional random fields is proposed for unmixing of hyperspectral data. The approximation formula of its normalizing factor is also derived.
We present a method of transforming localimage descriptors into a compact form of bit-sequences whose similarity is determined by Hamming distance. Following the locality-sensitive hashing approach, the descriptors a...
详细信息
We present a method of transforming localimage descriptors into a compact form of bit-sequences whose similarity is determined by Hamming distance. Following the locality-sensitive hashing approach, the descriptors are projected on a set of random directions that are learned from a set of non-matching data. The learned random projections result in high-entropy binary codes (HE 2 ) that outperform codes based on standard random projections in match/non-match classification and nearest neighbor search. Despite of data compression and granularity of Hamming space, HE 2 -descriptor outperforms the original descriptor in the classification task. In nearest neighbor search task, the performance of the HE 2 -descriptor is asymptotic to the performance of the original descriptor. As a supporting result, we obtain another descriptor, HE 2 + 1, and demonstrate that the performance of the original descriptor can be improved by adding a few bits derived from the descriptor itself.
We present a novel image transform called scale manipulation (SMT). The transform can be used for object pose estimation and registration of affine transformed images in the presence of non homogenous illumination cha...
详细信息
We present a novel image transform called scale manipulation (SMT). The transform can be used for object pose estimation and registration of affine transformed images in the presence of non homogenous illumination changes. The transform calculates affine invariant features of objects in a global manner and avoids using any sort of edge detection. The computational load of the method is relatively low since it is linear in the data size. In this paper we introduce the transform and demonstrate its applications for pose estimation in the presence of non uniform varying illumination.
Two main challenges lie in tracking the partially occluded targets in a high-similarity background: 1) similar intensities increase the difficulty of discriminating targets from the background, and 2) occlusion (illum...
详细信息
Two main challenges lie in tracking the partially occluded targets in a high-similarity background: 1) similar intensities increase the difficulty of discriminating targets from the background, and 2) occlusion (illumination and shape) decreases the relativity of targets to templates. In this paper, a novel eigenspace-based hybrid particle filter tracking method combined with online non-local appearance model is proposed to track the objects under highly similar environment with occlusions. By on-line training of the templates through non-local methods to generate the active appearance model, it is more likely find the maximum-likelihood distribution correctly. The projective transformation is utilized to cover all of the possible motion factors between the templates. The extended and unscented Kalman filters are switched to update the particles according to the linearity of the motion parameters. The experiment results show the effectiveness of our algorithm while dealing with occluded target in a high-similarity background.
暂无评论