Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2021, IRJET
…
4 pages
1 file
Colors have a power of lift our mood, thoughts and emotions. Color Palette is used by designers and artist to make their website or drawing beautiful and attractive to clients. Our project is about color palette Generation using various Machine learning algorithms such as K-means clustering and Median cut algorithm. They are unsupervised machine learning algorithm and there is no labelled data for these types of clustering. In computer graphics, there is a table called color lookup table also known as CLUT. CLUT is a table in which colors are selected using an index number, hence by referencing that number we can describe the actual color without using much memory. Our project will also be using less memory by using CLUT. A color palette in digital world is much more useful and a full range of colors can be displayed on a user interface and a screen. User-interface designers have a challenging task of selecting colors in their interface which will successfully communicate the brands name and meaning. Hence, we can help designers to generate colors from an existing image using different algorithms.
2021
A fast and simple colour classification algorithm was developed based on k-means++ algorithm for quick colour analysis of complex images. The algorithm processes Gaussian blurred CIELAB version of the original image to segment the scene in clusters of six colours with the highest representation in the image. It identifies the colours with the help of the ISCC-NBS colour terminology and locates them on the scene. The accuracy of our algorithm was evaluated with a psycho-visual experiment. The results show a dominant colour classification coherent with human visual perception. The algorithm is efficient for quick analysis of complex colour images to retrieve automatically the colour composition. It can be applied directly in various domains for example: lamp testing for colour distortion, image retrieval, artwork analysis etc.
Colors in an image provides tremendous amount of information. Using this color information images can be segmented, analyzed, labeled and indexed. In content based image retrieval system, color is one of the basic primitive features used. In Prevalent Color Extraction and indexing, the most extensive color on an image is identified and it is used for indexing. For implementation, Asteroideae flower family image dataset is used. It consist of more than 16,000 species, among them nearly 100 species are considered and indexed by dominating colors. To extract the most appealable color from the user defined images, the overall color of an image has to be quantized. Spatially, quantizing the color of an image to extract the prevalent color is the major objective of this paper. A combination of K-Mean and Expectation Minimization clustering algorithm called hidden-value learned K-mean clustering quantization algorithm is used to avoid the over clustering behavior of K-Mean algorithm. The experimental result shows the marginal differences between these algorithms.
IRJET, 2020
in this article aims to discover the color which has more impact in a painting via opencv library with python programming language. To be able to find dominant color I'll use k means clustering as opposed to try and find histogram and other clustering methods in the data mining techniques for every pixel. I'll use numpy and sklearn libraries for clustering. In this article, the focus will be on improving and implementing k means algorithm 2-3 times faster than usual k means clustering algorithm besides finding the dominant color in the input images.
The growth of digital image and video archives is increasing the need for tools that effectively filter and efficiently search through large amounts of visual data. Towards this goal we suggested new method to automatically extract the color for the image to form a class of meta-data that is easily indexed. The algorithm of indexing the color based on the binary image to extract color regions from image. To achieve this goal the image segmented to many parts after converting color image to binary
2014
This paper presents a statistics-based interactive evolutionary computation (IEC) method for color scheme search. Color schemes are utilized in an enormous range of items such as websites, clothing, advertising media, and housewares. However, people who do not have sufficient skill or knowledge of colors need to devote considerable time and effort to a creating color scheme. Currently, artists' color schemes are freely available from websites. However, obtaining an appropriate color scheme from a large data set is difficult for novice users. To overcome this problem, we rely on a statistics-based interactive genetic algorithm (IGA). Use of this IGA is expected to reduce computing costs compared with conventional IEC approaches and to take overall color scheme impressions into account. These contributions enable to realization of the kansei-based color search system in real time. In addition, we introduce four similarity search (SS) functions (hue, saturation, brightness, and col...
The Visual Computer, 2011
In this paper, we tackle the problem of associating combinations of colors to abstract concepts (e.g. capricious, classic, cool, delicate, etc.). Since such concepts are difficult to represent using single colors, we consider combinations of colors or color palettes. We leverage two novel databases for color palettes and we learn categorization models using low and high level descriptors. We show that Bag of Colors and Fisher Vectors are the most rewarding descriptors for palettes categorization and retrieval.
The present article describes a color classifcation method that purtitions a color image into a set of uniform color regions. The input image data are Jirst mapped from device coordinates into the CIE L*a*b* color space, un approximately uniform perceptual color space. Colors used to represent u nuturai color itnuge are clussijied by means of cluster detection in the uniform color space. The basic process of color classifcation is bused on histogram analysis to detect color clusters sequentially. The principal components o j a color distribution are extracted f o r effective discrimination ojclusters. We present an algorithm jor sequential detection of color clusters in the uniform color space, and the related algorithms f o r region processing and color computation. The performance of the method is discussed in an experiment using three kinds of natural color images. 0
Image segmentation is a crucial digital image processing step that decisively affects the outcome of any higher-level operation such as pattern recognition and image understanding. It can be defined as a procedure that subdivides (partitions) an image into its constituent regions or objects. All the pixels in the same region are similar with respect to some characteristic or computed property, such as color, intensity, or texture. Adjacent regions are significantly different with respect to the same characteristic(s). Color in a digital image often contains valuable information about the scene or object being imaged, which can be lost during the routine color-to-grayscale image conversion. This fact together with a rapid increase in the power of personal computers caused color image segmentation algorithms to be readily available on modern PCs. Numerous approaches have been developed during the last decades that enable efficient segmentation of images based on color. Sometimes conversion from RGB into a suitable color space, such as Lab, YIQ, YCbCr is necessary before the segmentation step can be accomplished. The presentation will after a brief overview of color image segmentation schemes focus on two typical algorithms that will be explained through a machine learning viewpoint. K-nearest neighbor classification is an example of a supervised learning algorithm where the aim is to learn a mapping from the input to an output whose correct values are provided by a supervisor. In unsupervised learning, on the other hand, there is no such supervisor and we only have input data and the aim is to find the regularities in the input. K-means clustering algorithm belongs to this class of machine learning methods. Efficiency of the two algorithms will be discussed using several synthetic, computer generated color images as well as photographs.
Color Research & Application, 2004
Colour is an important visual cue for computer vision applications. However, up to the present, the automatic assignment of names to image regions has not been widely used due to the nonexistence of a general computational model for colour categorization. In this paper we present a model for colour naming based on fuzzy set theory, in which each of the 11 basic colour terms defined by Berlin and Kay 1 is modelled as a fuzzy set with a characteristic function which assigns a membership value to the category to any colour sample. The model is based on combining two well known functions, a sigmoid and a gaussian, to define a membership function for colour categories. It is denoted here as the sigmoid-gaussian function and it fulfils a set of properties which makes it adequate to this purpose. The characteristic functions for each colour category have been fitted to data obtained from a psycho-physical experiment and the model has been tested on the Munsell colour array to show its validity. The results obtained indicate that our approach can be very useful as a first step to expand the use of colour naming information in computer vision applications. This is a preprint of an article published in COLOR research and application, 29(5): 342-353, 2004. http://www3.interscience.wiley.com/journal/35037/home In computer vision, colour is a very important visual cue for image understanding and it has been used to perform very different tasks such as object recognition, 17 image segmentation, 18 image indexing 19 or tracking. 20 However, the automatic assignment of names to image regions has not been widely dealt up to now, although it could be very useful for some automatic visual tasks such as image annotation, image indexing, object recognition, or robotics. Up to the present, Lammens 21 has been the only one in proposing a parametrical model for colour naming in different colour spaces. In this model, each colour category is modelled by a variant of the gaussian function which is fitted on the Munsell colour space considering the boundaries and focuses for each category defined by Berlin and Kay for American English. The model obtains interesting results, but it has not been extensively tested.
2014
A continuacion presentare un caso clinico que considero permite pensar la relacion entre el consumo como rasgo de identificacion que ubica al sujeto en un grupo de pertenencia, el uso de ese rasgo identificatorio en las mujeres, y su articulacion con las dificultades en el amor y la sexualidad. Palabras clave Mujeres, Amor, Adiccion, Sexualidad, Identificacion ABSTRACT WOMEN, LOVE, AND ADDICTION I will present a case that suggests the relationship between addiction as an identification that gives a place of belonging in a group, the use of such identification in women, and its articulation with the difficulties of love and sexuality. Key words Women, Love, Addiction, Sexuality, Identification
Geografia, 2007
Lapis Lazuli -An International Literary Journal (LLILJ) , 2022
Journal of Electromagnetic Analysis and Applications, 2009
Τρόποι του φιλοσοφείν: Τιμητικός τόμος για τον Στέλιο Βιρβιδάκη, 2024
Analise de orações relativas no Modelo Tradicional , 2020
Conservative Judaism, 2012
Geografia Ensino & Pesquisa, 2023
International Journal of Surgery Case Reports, 2014
Pan African Medical Journal, 2017
2020
Ensaio Pesquisa em Educação em Ciências (Belo Horizonte), 2011
Revista de la Asociación Médica de Bahía Blanca, 2006
WHO South-East Asia journal of public health