Search results for "InGaN"
showing 10 items of 1214 documents
Object tracking in medical imaging using a 2D active mesh system
2003
International audience; Abstract: This article proposes a technique for tracking moving organs in medical imaging. It can be split into two stages. We first initialize a 2D-triangular mesh on the first image of the sequence. We distinguish different objects of interest by grouping together the triangles that make them up. Afterwards, we deform this mesh on the successive images in order to track each identified object. The tracking stage uses optical flow by adding a node relaxation step to avoid mesh deteriorations. The mesh deformations analysis provides access to motion information along the sequence. This technique is applied to a cine-MRI sequences of the heart and allows the analysis …
Depth Map Generation by Image Classification
2004
This paper presents a novel and fully automatic technique to estimate depth information from a single input image. The proposed method is based on a new image classification technique able to classify digital images (also in Bayer pattern format) as indoor, outdoor with geometric elements or outdoor without geometric elements. Using the information collected in the classification step a suitable depth map is estimated. The proposed technique is fully unsupervised and is able to generate depth map from a single view of the scene, requiring low computational resources.
An Enhanced Detector of Blurred and Noisy Edges
2007
Detecting edges in digital images is a tricky operation in image processing since images may contain areas with different degrees of noise, blurring and sharpness. Such operation represents an important step of the whole process of similarity shape analysis and retrieval.
Coding Binary Trees by Words over an Alphabet with Four Letters
1992
Abstract We propose a new encoding scheme to represent binary trees with n leaves by words of length n over an alphabet with four letters. We give a characterization of these codewords.
A simple algorithm for generating neuronal dendritic trees
1990
Abstract A simple, efficient algorithm is presented for generating the codewords of all neuronal dendritic trees with a given number of terminal nodes. Furthermore, a procedure is developed for deciding if different codewords correspond to topologically equivalent trees.
Efficient CNF Encoding of Boolean Cardinality Constraints
2003
In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical applications. The proposed encoding is efficient with respect to unit propagation, which is implemented in almost all complete CNF satisfiability solvers. We prove the practical efficiency of this encoding on some problems arising in discrete tomography that involve many cardinality constraints. This encoding is also used together with a trivial variable elimination in order to re-encode parity learning benchmarks so that a simple Davis and Putnam procedure can solve them.
Data Compression Using Wavelet and Local Cosine Transforms
2015
The chapter describes an algorithm that compresses two-dimensional data arrays, which are piece-wise smooth in one direction and have oscillating events in the other direction. Seismic, hyper-spectral and fingerprints data, for example, have such a mixed structure. The transform part of the compression process is an algorithm that combines wavelet and local cosine transform (LCT). The quantization and the entropy coding parts of the compression are taken from the SPIHT codec. To efficiently apply the SPIHT codec to a mixed coefficients array, reordering of the LCT coefficients takes place. On the data arrays, which have the mixed structure, this algorithm outperforms other algorithms that a…
NIR and Visible Image Fusion for Improving Face Recognition at Long Distance
2014
Face recognition performance achieves high accuracy in close proximity. However, great challenges still exist in recognizing human face at long distance. In fact, the rapidly increasing need for long range surveillance requires a passage from close-up distances to long distances which affects strongly the human face image quality and causes degradation in recognition accuracy. To address this problem, we propose in this paper, a multispectral pixel level fusion approach to improve the performance of automatic face recognition at long distance. The main objective of the proposed approach is to formulate a method to enhance the face image quality as well as the face recognition rate. First, v…
Locally Supported Wavelets on the Sphere
1998
We construct explicitly wavelets on the sphere that provide a locally supported and stable basis for the Sobolev spaces H2,0 ⩽ s < 1. We get at hand at fast wavelet transform with almost optimal complexity. This basis can be easily implemented in numerical schemes. We apply the wavelet transform to singularity detection and data compression. This contribution summarizes the results of [1].
Fractional wavelet transform
1997
The wavelet transform, which has had a growing importance in signal and image processing, has been generalized by association with both the wavelet transform and the fractional Fourier transform. Possible implementations of the new transformation are in image compression, image transmission, transient signal processing, etc. Computer simulations demonstrate the abilities of the novel transform. Optical implementation of this transform is briefly discussed.