نتایج جستجو برای: local directional pattern

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

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2008
Dali Ma Keith Amonlirdviman Robin L Raffard Alessandro Abate Claire J Tomlin Jeffrey D Axelrod

Some epithelial cells display asymmetry along an axis orthogonal to the apical-basal axis, referred to as planar cell polarity (PCP). A Frizzled-mediated feedback loop coordinates PCP between neighboring cells, and the cadherin Fat transduces a global directional cue that orients PCP with respect to the tissue axes. The feedback loop can propagate polarity across clones of cells that lack the g...

2015
C. Yesubai Rubavathi R. Ravi

Abstract—This paper presents the local mesh co-occurrence patterns (LMCoP) using HSV color space for image retrieval system. HSV color space is used in this method to utilize color, intensity and brightness of images. Local mesh patterns are applied to define the local information of image and gray level co-occurrence is used to obtain the co-occurrence of LMeP pixels. Local mesh co-occurrence ...

Journal: :journal of ai and data mining 2014
mohammad shahidol islam

many researchers adopt local binary pattern for pattern analysis. however, the long histogram created by local binary pattern is not suitable for large-scale facial database. this paper presents a simple facial pattern descriptor for facial expression recognition. local pattern is computed based on local gradient flow from one side to another side through the center pixel in a 3x3 pixels region...

The dogleg severity is one of the most important parameters in directional drilling. Improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. Selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...

Many researchers adopt Local Binary Pattern for pattern analysis. However, the long histogram created by Local Binary Pattern is not suitable for large-scale facial database. This paper presents a simple facial pattern descriptor for facial expression recognition. Local pattern is computed based on local gradient flow from one side to another side through the center pixel in a 3x3 pixels region...

2017
Chi-Kien Tran Chin-Dar Tseng Pei-Ju Chao Chin-Shiuh Shieh Liyun Chang Tsair-Fwu Lee

In the last two decades, an increasing number of illumination pretreatment methods and local feature descriptors have been proposed to address the issue of face recognition under different illumination conditions. Although these have achieved impressive results, the problem of how to maximize the reduction of the effect of variable lighting on captured images remains open. We assume that face i...

Journal: :Perception & psychophysics 2006
David F Nichols Howard S Hock Gregor Schöner

A two-level dynamical model of motion pattern formation is developed in which local motion/ nonmotion perceptual decisions are based on inhibitory competition between area V1 detectors responsive to motion-specifying versus motion-independent stimulus information, and pattern-level perceptual decisions are based on inhibitory competition between area MT motion detectors with orthogonal directio...

2012
Dong-Ju Kim Sang-Heon Lee Myoung-Kyu Sohn Byungmin Kim Hyunduk Kim

This paper proposes a novel image preprocessing technique based on binary patterns for illumination invariant face recognition. The face recognition system comprised of a centralized gradient pattern image and facial features based on image covariance. The centralized gradient pattern image is obtained by AND operation of a modified local binary pattern image and a modified local directional pa...

2004
Mark A. Abramson

Abstract: Previous analyses of pattern search algorithms for unconstrained and linearly constrained minimization have focused on proving convergence of a subsequence of iterates to a limit point satisfying either directional or first-order necessary conditions for optimality, depending on the smoothness of the objective function in a neighborhood of the limit point. Even though pattern search m...

Journal: :SIAM Journal on Optimization 2005
Mark A. Abramson

Previous analyses of pattern search algorithms for unconstrained and linearly constrained minimization have focused on proving convergence of a subsequence of iterates to a limit point satisfying either directional or first-order necessary conditions for optimality, depending on the smoothness of the objective function in a neighborhood of the limit point. Even though pattern search methods req...

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

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