نتایج جستجو برای: edge color signature

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

2012
T. N. Janakiraman P. V. S. S. R. Chandra Mouli

A color image edge detection algorithm is proposed in this paper using Pseudo-complement and matrix rotation operations. First, pseudo-complement method is applied on the image for each channel. Then, matrix operations are applied on the output image of the first stage. Dominant pixels are obtained by image differencing between the pseudo-complement image and the matrix operated image. Median f...

Journal: :Graphs and Combinatorics 2015
Tomás Bálint Július Czap

A facial parity edge coloring of a 2-edge-connected plane graph is such an edge coloring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same color, in addition, for each face f and each color c, either no edge or an odd number of edges incident with f is colored with c. It is known that any 2-edgeconnected plane graph has a facial parity edge c...

2017
Harpreet Kaur Vijay Dhir

A novel descriptor is designed and developed for extracting the features from large databases. The descriptor is known as LMeMECoP that is local mesh maximum edge co-occurrence patterns. Information of local maximum edge is collected between the possible neighbors for provided centre pixel that is the reference pixel. The maximum edge collection is in the form of mesh intended for reference pix...

2012
Basavaraj S. Anami Suvarna S Nandyal

In this paper, we propose a methodology for color and edge histogram based medicinal plants image retrieval. The medicinal plants are divided into herbs, shrubs and trees. The medicinal plants are used in ayurvedic medicines. Manual identification of medicinal plants requires a priori knowledge. Automatic recognition of medicinal plants is useful. We have considered medicinal plant species, suc...

1996
Graham D. Finlayson Subho S. Chatterjee Brian V. Funt

A fast color-based algorithm for recognizing colorful objects and colored textures is presented. Objects and textures are represented by just six numbers. Let r, g and b denote the 3 color bands of the image of an object (stretched out as vectors) then the color angular index comprises the 3 inter-band angles (one per pair of image vectors). The color edge angular index is calculated from the i...

1995
Eli Saber A. Murat Tekalp

We propose a new method for combined color image segmentation and edge linking. The image is rst segmented based on color information only. The segmentation map is modeled by a Gibbs random eld, to ensure formation of spatially contiguous regions. Next, spatial edge locations are determined using the magnitude of the gradient of the 3-channel image vector eld. Finally, regions in the segmentati...

Journal: :Consciousness and cognition 2016
Qiufang Fu Yong-Jin Liu Zoltan Dienes Jianhui Wu Wenfeng Chen Xiaolan Fu

A fundamental question in vision research is whether visual recognition is determined by edge-based information (e.g., edge, line, and conjunction) or surface-based information (e.g., color, brightness, and texture). To investigate this question, we manipulated the stimulus onset asynchrony (SOA) between the scene and the mask in a backward masking task of natural scene categorization. The beha...

Journal: :EURASIP J. Adv. Sig. Proc. 2010
Chang Won Kim Hyun Mook Oh Du Sic Yoo Moon Gi Kang

This paper proposes a novel way of combining color demosaicing and the auto white balance (AWB) method, which are important parts of image processing. Performance of the AWB is generally affected by demosaicing results because most AWB algorithms are performed posterior to color demosaicing. In this paper, in order to increase the performance and efficiency of the AWB algorithm, the color const...

Journal: :Journal of Graph Theory 2001
Zsolt Tuza Margit Voigt

A 2-assignment on a graph G = (V; E) is a collection of pairs L(v) of allowed colors speciied for all vertices v 2 V. The graph G (with at least one edge) is said to have oriented choice number 2 if it admits an orientation which satisses the following property : For every 2-assignment there exists a choice c(v) 2 L(v) for all v 2 V such that (i) if c(v) = c(w), then vw = 2 E, and (ii) for ever...

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

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