نتایج جستجو برای: morphological decomposition

تعداد نتایج: 224885  

Journal: :Journal of cognitive neuroscience 2010
Olla Solomyak Alec Marantz

We employ a single-trial correlational MEG analysis technique to investigate early processing in the visual recognition of morphologically complex words. Three classes of affixed words were presented in a lexical decision task: free stems (e.g., taxable), bound roots (e.g., tolerable), and unique root words (e.g., vulnerable, the root of which does not appear elsewhere). Analysis was focused on...

Journal: :Quarterly journal of experimental psychology 2009
Samantha F McCormick Marc Brysbaert Kathleen Rastle

On the basis of data from masked priming experiments, it has been argued that an automatic process of decomposition is applied to all morphologically structured stimuli, irrespective of their lexical characteristics (Rastle, Davis, & New, 2004). So far, this claim has been tested only with respect to low-frequency primes and nonword primes. This is a limitation because some models of morphologi...

2000
Ilse Ravyse Hichem Sahli Jan Cornelis Marcel J. T. Reinders

Automatic recovery of eye gestures from image sequences is one of the important topics for face recognition and model-based coding of videophone sequences. Usually complicated models of the eye and its motion are used. In this contribution an eye gesture parameter estimation is described. A previously published automatic eye detection/tracking algorithm, based on template matching, is used for ...

2013
G. Rama Mohan Babu A. Srikrishna Ph.D N. Venkateswara Rao

The ability of object recognition system is to recognize a large number of objects constrained by a variety of factors such as the selection of a feature extraction method, quality of the images, and the classification models. This paper presents an approach to the recognition of complex shape objects using shape representation features. The shape representation features are the disk components...

Journal: :Journal of cognitive neuroscience 2007
Brian T. Gold Kathleen Rastle

Considerable behavioral research has demonstrated that the visual word recognition system is sensitive to morphological structure. It has typically been assumed that analysis of morphologically complex words occurs only when the meaning of these words can be derived from the meanings of their constituents (e.g., hunter = hunt + er). However, results from recent behavioral research using the mas...

2007
Fanny Meunier

In the present study, we looked at cross-modal priming effects produced by auditory presentation of morphologically complex pseudowords in order to investigate semantic integration during the processing of French morphologically complex items. In Experiment 1, we used as primes pseudowords consisting of a non-interpretable combination of roots and suffixes, such as sportation, formed by the nou...

2017
Matthieu Labeau Alexandre Allauzen

Most of neural language models use different kinds of embeddings for word prediction. While word embeddings can be associated to each word in the vocabulary or derived from characters as well as factored morphological decomposition, these word representations are mainly used to parametrize the input, i.e. the context of prediction. This work investigates the effect of using subword units (chara...

2001
Kostas Haris Serafim N. Efstratiadis Nicos Maglaveras

In this paper, we propose an image segmentation method based on morphological decomposition and graph-based region merging using contour dynamics. The input image is initially decomposed into a set of primitive homogeneous regions through the morphological watershed transform applied to the image intensity gradient magnitude. This decomposition is represented by a Region Adjacency Graph (RAG) t...

1996
Metin Nafi Gürcan Ömer Nezih Gerek A. Enis Çetin

Linear filter banks with critical subsampling and perfect reconstruction (PR) property have received much interest and found numerous applications in signal and image processing. Recently, nonlinear filter bank structures with PR and critical subsampling have been proposed and used in image coding. In this paper, it is shown that PR nonlinear subband decomposition can be performed using the Gal...

1992
Tapas Kanungo Robert M. Haralick

We deene a restricted domains, a class of discrete, 2D, convex shapes. We prove that there is a set of thirteen restricted domains fK 1 ; K 2 ; : : :; K 13 g such that any given restricted domain, K; is expressible as K = K 0 (k1 K 1) (k2 K 2) (k13 K 13) where (ki K i) represents the k i-fold dilation of K i and K 0 is a translation. We show that this entails a linear transformation from a thir...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید