Set Of Colors Research Articles

We can guide search by a set of colors, but are reluctant to do it.

For some real-world color searches, the target colors are not precisely known, and any item within a range of color values should be attended. Thus, a target representation that captures multiple similar colors would be advantageous. If such a multicolor search is possible, then search for two targets (e.g., Stroud, Menneer, Cave, and Donnelly, Journal of Experimental Psychology: Human Perception and Performance, 38(1): 113-122, 2012) might be guided by a target representation that included the target colors as well as the continuum of colors that fall between the targets within a contiguous region in color space. Results from Stroud, Menneer, Cave, and Donnelly, Journal of Experimental Psychology: Human Perception and Performance, 38(1): 113-122, (2012) suggest otherwise, however. The current set of experiments show that guidance for a set of colors that are all from a single region of color space can be reasonably effective if targets are depicted as specific discrete colors. Specifically, Experiments 1-3 demonstrate that a search can be guided by four and even eight colors given the appropriate conditions. However, Experiment 5 gives evidence that guidance is sometimes sensitive to how informative the target preview is to search. Experiments 6 and 7 show that a stimulus showing a continuous range of target colors is not translated into a search target representation. Thus, search can be guided by multiple discrete colors that are from a single region in color space, but this approach was not adopted in a search for two targets with intervening distractor colors.

Gallai-Ramsey Numbers for Monochromatic Triangles or 4-Cycles

Gallai-Ramsey numbers often consider edge-colorings of complete graphs in which there are no rainbow triangles. Within such colored complete graphs, the goal is to look for specified monochromatic subgraphs. We consider an “off diagonal” case of this concept by looking for either a monochromatic $$K_{3}$$ in one of some set of colors or a monochromatic $$C_{4}$$ in one of some other set of colors.

Feature binding in short-term memory and long-term learning.

In everyday experience, we encounter visual feature combinations. Some combinations are learned to support object recognition, and some are arbitrary and rapidly changing, so are retained briefly to complete ongoing tasks before being updated or forgotten. However, the boundary conditions between temporary retention of fleeting feature combinations and learning of feature bindings are unclear. Logie, Brockmole, and Vandenbroucke demonstrated that 60 repetitions of the same feature bindings for change detection resulted in no learning, but clear learning occurred with cued recall of the feature names. We extended those studies in two new experiments with the same array of colour-shape-location combinations repeated for 120 trials. In Experiment 1, change detection was well above chance from Trial 1, but improved only after 40 to 60 trials for participants who subsequently reported becoming aware of the repetition, and after 100 to 120 trials for participants reporting no awareness. Performance improved rapidly in Experiment 2 when participants reconstructed the array by selecting individual features from sets of colours, shapes, and locations. All participants subsequently reported becoming aware of the repetition. We conclude that change detection involves a visual cache memory that functions from the first trial, and retains feature bindings only for the duration of a trial. In addition, a weak residual episodic memory trace accumulates slowly across repetitions, eventually resulting in learning. Reconstructing feature combinations generates a much stronger episodic memory trace from trial to trial, and so learning is faster with performance supported both by the limited capacity visual cache and learning of the array.

Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number

AbstractAn adjacent vertex distinguishing edge coloring of a graph G without isolated edges is its proper edge coloring such that no pair of adjacent vertices meets the same set of colors in G. We show that such coloring can be chosen from any set of lists associated to the edges of G as long as the size of every list is at least , where Δ is the maximum degree of G and C is a constant. The proof is probabilistic. The same is true in the environment of total colorings.

Extending edge‐colorings of complete hypergraphs into regular colorings

AbstractLet be the collection of all ‐subsets of an ‐set . Given a coloring (partition) of a set , we are interested in finding conditions under which this coloring is extendible to a coloring of so that the number of times each element of appears in each color class (all sets of the same color) is the same number . The case was studied by Sylvester in the 18th century and remained open until the 1970s. The case is extensively studied in the literature and is closely related to completing partial symmetric Latin squares. For , we settle the cases , and completely. Moreover, we make partial progress toward solving the case where . These results can be seen as extensions of the famous Baranyai’s theorem, and make progress toward settling a 40‐year‐old problem posed by Cameron.

Binocular Tone Mapping with Improved Overall Contrast and Local Details

AbstractTone mapping is a commonly used technique that maps the set of colors in high‐dynamic‐range (HDR) images to another set of colors in low‐dynamic‐range (LDR) images, to fit the need for print‐outs, LCD monitors and projectors. Unfortunately, during the compression of dynamic range, the overall contrast and local details generally cannot be preserved simultaneously. Recently, with the increased use of stereoscopic devices, the notion of binocular tone mapping has been proposed in the existing research study. However, the existing research lacks the binocular perception study and is unable to generate the optimal binocular pair that presents the most visual content. In this paper, we propose a novel perception‐based binocular tone mapping method, that can generate an optimal binocular image pair (generating left and right images simultaneously) from an HDR image that presents the most visual content by designing a binocular perception metric. Our method outperforms the existing method in terms of both visual and time performance.

A Comparative Study of Machine Learning Classification for Color-based Safety Vest Detection on Construction-Site Images

Detecting the safety vests is an important foundation for various applications in safety management and productivity measurement. The fluorescent yellow-green color and fluorescent orange-red color of safety vests are generally considered as the most distinctive colors which represent workers in construction-site images. The objective of this study is to provide an evaluation of the safety vest detection using color information in construction-site images. The data sets of two colors of safety vests and the background were generated and used in this study. A comparative analysis of combinations of five color spaces (RGB, nRGB, HSV, Lab, and YCbCr) and six classifiers (ANN, C4.5, KNN, LR, NB, and SVM) was conducted. The performance of each combination was assessed in terms of the precision, recall, and F-measure. Moreover, an evaluation of the effects of color space conversion and the absence of luminance components on the detection performance was conducted. The comparison results showed that C4.5 classifier combined with YCbCr and SVM classifier combined with Lab, respectively, outperformed other combinations on each data set of safety vest colors. Furthermore, RGB color space transformation into non-RGB color spaces enhanced the classification performance. The evaluation also showed that the removal of luminance components did not help to improve the performance.

Assessment of Google Glass for Photographic Documentation in Veterinary Forensic Pathology: Usability Study.

BackgroundGoogle Glass is a head-mounted device designed in the shape of a pair of eyeglasses equipped with a 5.0-megapixel integrated camera and capable of taking pictures with simple voice commands.ObjectiveThe objective of our study was to determine whether Google Glass is fit for veterinary forensic pathology purposes.MethodsA total of 44 forensic necropsies of 2 different species (22 dogs and 22 cats) were performed by 2 pathologists; each pathologist conducted 11 necropsies of each species and, for each photographic acquisition, the images were taken with a Google Glass device and a Nikon D3200 digital single-lens reflex (DSLR) camera. The pictures were collected, divided into 3 groups (based on the external appearance of the animal, organs, and anatomical details), and evaluated by 5 forensic pathologists using a 5-point score system. The parameters assessed were overall color settings, region of interest, sharpness, and brightness. To evaluate the difference in mean duration between necropsies conduced with Google Glass and DSLR camera and to assess the battery consumption of the devices, an additional number of 16 necropsies were performed by the 2 pathologists. In these cases, Google Glass was used for photographic reports in 8 cases (4 dogs and 4 cats) and a Nikon D3200 reflex camera in the other 8 cases. Statistical evaluations were performed to assess the differences in ratings between the quality of the images taken with both devices.ResultsThe images taken with Google Glass received significantly lower ratings than those acquired with reflex camera for all 4 assessed parameters (P<.001). In particular, for the pictures of Groups A and B taken with Google Glass, the sum of frequency of ratings 5 (very good) and 4 (good) was between 50% and 77% for all 4 assessed parameters. The lowest ratings were observed for the pictures of Group C, with a sum of frequency of ratings 5 and 4 of 21.1% (342/1602) for region of interest, 26% (421/1602) for sharpness, 35.5% (575/1602) for overall color settings, and 61.4% (995/1602) for brightness. Furthermore, we found a significant reduction in the mean execution time for necropsy conduced with the Google Glass with respect to the reflex group (P<.001). However, Google Glass drained the battery very quickly.ConclusionsThese findings suggest that Google Glass is usable in veterinary forensic pathology. In particular, the image quality of Groups A and B seemed adequate for forensic photographic documentation purposes, although the quality was lower than that with the reflex camera. However, in this step of development, the high frequency of poor ratings observed for the pictures of Group C suggest that the device is not suitable for taking pictures of small anatomical details or close-ups of the injuries.

Measuring the time course of selection during visual search.

In visual search tasks, observers can guide their attention towards items in the visual field that share features with the target item. In this series of studies, we examined the time course of guidance toward a subset of items that have the same color as the target item. Landolt Cs were placed on 16 colored disks. Fifteen distractor Cs had gaps facing up or down while one target C had a gap facing left or right. Observers searched for the target C and reported which side contained the gap as quickly as possible. In the absence of other information, observers must search at random through the Cs. However, during the trial, the disks changed colors. Twelve disks were now of one color and four disks were of another color. Observers knew that the target C would always be in the smaller color set. The experimental question was how quickly observers could guide their attention to the smaller color set. Results indicate that observers could not make instantaneous use of color information to guide the search, even when they knew which two colors would be appearing on every trial. In each study, it took participants 200-300 ms to fully utilize the color information once presented. Control studies replicated the finding with more saturated colors and with colored C stimuli (rather than Cs on colored disks). We conclude that segregation of a display by color for the purposes of guidance takes 200-300 ms to fully develop.

On twin edge colorings of the direct product of paths

Let be a proper k-edge coloring of a simple connected graph of order at the latest 3, where the set of colors is. If a proper edge coloring of a graph that induces vertex coloring is a proper vertex coloring, then is called a twin edge k-coloring of a graph. the twin chromatic number of a graph is the least value k of colors of a graph, and denote it by. In this paper, we obtains the twin chromatic number of infinite paths and finite paths.

Examining generalization performance in a conditional discrimination task for learners with moderate-to-severe intellectual and developmental disabilities: Using a generalization gradient

ABSTRACTThis study examined how differences between teaching stimuli in a conditional discrimination impacted discrimination/generalization outcomes among learners with intellectual and developmental disabilities (IDD). In Study 1, three color sets were identified among 30 typically developing adults. Five young children with moderate-to-severe IDD participated in Study 2 employing an adapted alternating treatment single-case experimental design. Participants’ performance within each color set was baselined. Subsequently each participant received three intervention conditions (i.e., two conditional discrimination and a simple discrimination) in an alternated manner. Generalization testing was implemented when mastery criterion was reached on an intervention condition. Results showed that simple discrimination was acquired most quickly. Simple discrimination was not less effective than two conditional discriminations in enhancing generalization performance subsequent to intervention. The minimal-difference conditional discrimination was relatively more effective in enhancing generalization performance at least within one stimulus class than the maximal-difference one (and simple discrimination). Limitations and implications are discussed.

Planar graphs with $$\Delta =9$$Δ=9 are neighbor-distinguishing totally 12-colorable

The neighbor-distinguishing total coloring of a graph G is a proper total coloring of G using k colors such that any two adjacent vertices have different sets of colors. It was known that every planar graph G with $$\Delta \ge 10$$ is neighbor-distinguishing totally $$(\Delta +3)$$-colorable. In this paper, we extend this result to the case $$\Delta =9$$. Namely, we prove that every planar graph G with $$\Delta =9$$ is neighbor-distinguishing totally 12-colorable.

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with [formula omitted

The neighbor-distinguishing total chromatic number χa′′(G) of a graph G is the smallest integer k such that G can be totally colored using k colors with a condition that any two adjacent vertices have different sets of colors. In this paper, we give a sufficient and necessary condition for a planar graph G with maximum degree 13 to have χa′′(G)=14 or χa′′(G)=15. Precisely, we show that if G is a planar graph of maximum degree 13, then 14≤χa′′(G)≤15; and χa′′(G)=15 if and only if G contains two adjacent 13-vertices.

Is Your Color My Color? Dividing the Labor of the Stroop Task Between Co-actors.

Performing a task with other actors involves two opposing forces, division of labor between co-acting individuals and integration of divided parts of the task into a shared mental representation (co-representation). Previous studies have focused primarily on the integration of task representations and limited attention has paid to the division of labor. The present study devised a test of the integration and the division in a joint task setting. A joint version of the Stroop task was developed, in which pairs of actors were assigned different sets of target colors. If the actors integrate their co-actor’s task, the colors assigned to their co-actor should be represented as if they were the actor’s own target colors; the Stroop effect should be as large when distractor color words denote their co-actor’s target colors as when these words denote the actor’s own target colors. If the actors divide the labor of the Stroop task, the colors assigned to their partner should be represented as non-target colors; the Stroop effect should be smaller when the distractor color words denote the co-actor’s target colors than when these words denote the actor’s own target colors. The results of response time did not provide clear support for either position, while those of response accuracy supported the division of labor. Possible cognitive mechanisms that support the division of labor and the integration of task representation are discussed.

Compressed dynamic mesh sequence for progressive streaming

AbstractDynamic mesh sequence (DMS) is a simple and accurate representation for precisely recording a 3D animation sequence. Despite its simplicity, this representation is typically large in data size, making storage and transmission expensive. This paper presents a novel framework that allows effective DMS compression and progressive streaming by eliminating spatial and temporal redundancy. To explore temporal redundancy, we propose a temporal frame‐clustering algorithm to organize DMS frames by their motion trajectory changes, eliminating intracluster redundancy by principal component analysis dimensionality reduction. To eliminate spatial redundancy, we propose an algorithm to transform the coordinates of mesh vertex trajectory into a decorrelated trajectory space, generating a new spatially nonredundant trajectory representation. We finally apply a spectral graph wavelet transform with color set partitioning embedded block encoding to turn the resultant DMS into a multiresolution representation to support progressive streaming. Experiment results show that our method outperforms several existing methods in terms of storage requirement and reconstruction quality.

STAR: A Segmentation-Based Approximation of Point-Based Sampling Milano Retinex for Color Image Enhancement.

Milano Retinex is a family of spatial color algorithms inspired by Retinex and mainly devoted to the image enhancement. In the so-called point-based sampling Milano Retinex algorithms, this task is accomplished by processing the color of each image pixel based on a set of colors sampled in its surround. This paper presents STAR, a segmentation based approximation of the point-based sampling Milano Retinex approaches: it replaces the pixel-wise image sampling by a novel, computationally efficient procedure that detects once for all the color and spatial information relevant to image enhancement from clusters of pixels output by a segmentation. The experiments reported here show that STAR performs similarly to previous point-based sampling Milano Retinex approaches and that STAR enhancement improves the accuracy of the well-known algorithm scale-invariant feature transform on the description and matching of photographs captured under difficult light conditions.

A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem

Graph colouring problem is a well-known NP-class optimization problem, studied due to a lot of applications in various real-world problems. Some of these applications are: register allocation, image processing and communication networks. There are various techniques suggested by the researchers to solve the problem which is either exact or approximate in nature. In this paper, a new greedy technique, based on degrees of vertices in the graph is presented to solve the graph colouring problem in an improved manner. The technique involves the use of adjacency matrix along with another matrix generated for the set of possible colours for each vertex in the graph. The generated colour matrix is used to assign the colours among the vertices in the graph based on decreasing degrees of the vertices. Several DIMACS colouring instances solved using the suggested approach in the article and compared with some contemporary techniques for the performance and proves compatible and having better execution time with compared technique. The obtained colouing results are mostly optimal colour values corresponding to the examined colouring instances of the graph.

Must See Advisor for Kyoto

This article describes a multimedia interactive map developed as sample for the municipality of Kyoto, based on a single HTML page using AJAX, with a client-side control mechanism using jQuery components. The application supports better connections between resources and the places they refer to: the user could select a Point of Interest (PoI) through its multimedia contents using their previews (in a gallery or in a tile window) or their names reported in a list. PoIs—visualized on the map with multi-shape markers using a set of unambiguous colors—could be filtered through their categories and types, accessibility status and time line, thus improving the system usability.

Maximum colorful independent sets in vertex-colored graphs

In this paper we study the problem of finding a maximum colorful independent set in vertex-colored graphs. Specifically, given a graph with colored vertices, we wish to find an independent set containing the maximum number of colors. Here we aim to give a dichotomy overview on the complexity of this problem. We first show that the problem is NP-hard even for some cases where the maximum independent set problem is easy, such as cographs and P5-free graphs. Next, we provide polynomial-time algorithms for cluster graphs and trees.

Neighbor-locating coloring: graph operations and extremal cardinalities

A k–coloring of a graph G=(V,E) is a k-partition Π={S1,…,Sk} of V into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices u, v belonging to the same color Si, the set of colors of the neighborhood of u is different from the set of colors of the neighborhood of v. The neighbor-locating chromatic number, χNL(G), is the minimum cardinality of a neighbor-locating coloring of G.In this paper, we examine the neighbor-locating chromatic number for various graph operations: the join, the disjoint union and Cartesian product. We also characterize all connected graphs of order n≥3 with neighbor-locating chromatic number equal either to n or to n−1 and determine the neighbor-locating chromatic number of split graphs.