Search results for " pattern"
showing 10 items of 2245 documents
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
Local operators to detect regions of interest
1997
The performance of a visual system is strongly influenced by the information processing that is done in the early vision phase. The need exists to limit the computation on areas of interest to reduce the total amount of data and their redundancy. This paper describes a new method to drive the attention during the analysis of complex scenes. Two new local operators, based on the computation of local moments and symmetries, are combined to drive the selection. Experimental results on real data are also reported. © 1997 Elsevier Science B.V.
Generic attribute deviation metric for assessing mesh simplification algorithm quality
2002
International audience; This paper describes an efficient method to compare two triangular meshes. Meshes considered here contain geometric features as well as other surface attributes such as material colors, texture, temperature, radiation, etc. Two deviation measurements are presented to assess the differences between two meshes. The first measurement, called geometric deviation, returns geometric differences. The second measurement , called attribute deviation, returns attribute differences regardless of the attribute type. In this paper we present an application of this method to the Mesh Simplification Algorithm (MSA) quality assessment according to the appearance attributes. This ass…
Seam Puckering Objective Evaluation Method for Sewing Process
2015
The paper presents an automated method for the assessment and classification of puckering defects detected during the preproduction control stage of the sewing machine or product inspection. In this respect, we have presented the possible causes and remedies of the wrinkle nonconformities. Subjective factors related to the control environment and operators during the seams evaluation can be reduced using an automated system whose operation is based on image processing. Our implementation involves spectral image analysis using Fourier transform and an unsupervised neural network, the Kohonen Map, employed to classify material specimens, the input images, into five discrete degrees of quality…
Attentional vs computational complexity measures in observing paintings
2009
Because of the great heterogeneity of subjects and styles, esthetic perception delineates a special and elusive field of research in vision, which represents an interesting challenge for cognitive science tools. With specific regard to the role of visual complexity, in this paper we present an experiment aimed to measure this dimension in a heterogeneous set of paintings. We compared perceived time complexity measures - based on a temporal estimation paradigm - with physical and statistical properties of the paintings, obtaining a strong correlation between psychological and computational results.
A Variational Approach for Denoising Hyperspectral Images Corrupted by Poisson Distributed Noise
2014
Poisson distributed noise, such as photon noise is an important noise source in multi- and hyperspectral images. We propose a variational based denoising approach, that accounts the vectorial structure of a spectral image cube, as well as the poisson distributed noise. For this aim, we extend an approach for monochromatic images, by a regularisation term, that is spectrally and spatially adaptive and preserves edges. In order to take the high computational complexity into account, we derive a Split Bregman optimisation for the proposed model. The results show the advantages of the proposed approach compared to a marginal approach on synthetic and real data.
A Battery-Free Smart Sensor Powered with RF Energy
2018
The development of Internet of Things (IoT) infrastructure and applications is stimulating advanced and innovative ideas and solutions, some of which are pushing the limits of state-of-the-art technology. The increasing demand for Wireless Sensor Network (WSN) that must be capable of collecting and sharing data wirelessly while often positioned in places hard to reach and service, motivates engineers to look for innovative energy harvesting and wireless power transfer solutions to implement battery-free sensor nodes. Due to the pervasiveness of RF (Radio Frequency) energy, RF harvesting that can reach out-of-sight places could be a key technology to wirelessly power IoT sensor devices, whic…
SDN@home: A Method for Controlling Future Wireless Home Networks
2016
Recent advances in wireless networking technologies are leading toward the proliferation of novel home network applications. However, the landscape of emerging scenarios is fragmented due to their varying technological requirements and the heterogeneity of current wireless technologies. We argue that the development of flexible software-defined wireless architectures, including such efforts as the wireless MAC processor, coupled with SDN concepts, will enable the support of both emerging and future home applications. In this article, we first identify problems with managing current home networks composed of separate network segments governed by different technologies. Second, we point out t…
Spectral clustering to model deformations for fast multimodal prostate registration
2012
International audience; This paper proposes a method to learn deformation parameters off-line for fast multimodal registration of ultrasound and magnetic resonance prostate images during ultrasound guided needle biopsy. The method is based on a learning phase where deformation models are built from the deformation parameters of a splinebased non-linear diffeomorphism between training ultrasound and magnetic resonance prostate images using spectral clustering. Deformation models comprising of the eigen-modes of each cluster in a Gaussian space are applied on a test magnetic resonance image to register with the test ultrasound prostate image. The deformation model with the least registration …
SVM approximation for real-time image segmentation by using an improved hyperrectangles-based method
2003
A real-time implementation of an approximation of the support vector machine (SVM) decision rule is proposed. This method is based on an improvement of a supervised classification method using hyperrectangles, which is useful for real-time image segmentation. The final decision combines the accuracy of the SVM learning algorithm and the speed of a hyperrectangles-based method. We review the principles of the classification methods and we evaluate the hardware implementation cost of each method. We present the combination algorithm, which consists of rejecting ambiguities in the learning set using SVM decision, before using the learning step of the hyperrectangles-based method. We present re…