New method explains color vision's nonlinearities and adaptability.
problem Understanding human color vision's nonlinear and adaptive aspects.
method Sequential Principal Curves Analysis (SPCA) with local metric.
result Color discrimination thresholds and illuminant discount emerge from realistic data.
Study reveals unique gender disparities in Bangladeshi TV advertisements and talk shows.
problem Gender disparity and skin color distribution in Bangladeshi TV content.
method Computer Vision, machine learning, head pose, gender detection, skin color estimation.
result Lighter skin tones are less prevalent than darker in Bangladeshi TV, contrary to popular perception.
Back-propagation learns camera sensor design for color images.
problem Designing efficient color camera sensors for deep learning.
method Jointly learns sensor design and image reconstruction networks.
result Significant accuracy improvements over traditional Bayer pattern.
(ABRIDGED) In previous work, two platforms have been developed for testing computer-vision algorithms for robotic planetary exploration (McGuire et al. 2004b,2005; Bartolo et al. 2007). The wearable-computer platform has been tested at geological and astrobiological field sites in Spain (Rivas Vaciamadrid and Riba de S…
This study automates blood cell classification using computer vision.
problem Automated detection and classification of white blood cells.
method Color-based segmentation, morphological processing, feature extraction, PCA, Unsupervised and Supervised learning algorithms, Deep Convolutional Neural Networks.
result Identification of robust algorithms for automated blood cell classification.
Deep neural networks ensemble detect retinal blood vessels in fundus images.
problem Detecting fine retinal blood vessels for disease diagnosis.
method Ensemble of deep convolutional neural networks trained on DRIVE database.
result Maximum average accuracy of 94.7% and AUC of 0.9283 in vessel detection.
The study models eye fixations using Markov chains and compares with color presence.
problem Modeling eye fixations in images with and without color information.
method Data-driven k-means clustering to identify states, Markov chain modeling, Bayes factors for model selection.
result Eye behavior differs when color information is removed.
STRING improves 2D and 3D position encodings for better performance.
problem Efficient and accurate position encoding for 2D and 3D applications.
method STRING extends Rotary Position Encodings with a unifying theoretical framework, maintaining translation invariance and low computational cost.
result STRING shows substantial gains in open-vocabulary object detection and robotics.
Large language models predict human sensory judgments across multiple modalities.
problem Determining the extent of perceptual information in language.
method State-of-the-art large language models were used to predict sensory judgments across six psychophysical datasets.
result Large language models can predict human sensory judgments across multiple modalities with significant correlation to human data.
Proposes deep collective learning to learn inputs and weights together in neural networks.
problem The need to optimize inputs alongside weights in deep neural networks.
method Introduces deep collective learning to learn inputs and weights jointly, using lookup tables.
result Demonstrates advantages and promise of Lookup-VNets and deep collective learning.
Adversarial perturbations are more effective in Y-channel of YCbCr color space.
problem Vulnerability of deep models to adversarial perturbations in images.
method Proposed ResUpNet defense that removes perturbations only from the Y-channel of YCbCr color space.
result ResUpNet achieves the best balance between defense and maintaining original image accuracy.
Quantum interference improves clustering accuracy.
problem Improving clustering accuracy in Gaussian mixture models.
method Modeling classes as wave functions, then mixing them.
result Quantum method outperforms Gaussian mixture in all aspects.
New method estimates image appearance models for segmentation.
problem Estimating appearance models for image segmentation.
method Tensor factorization-based estimator for latent variable models.
result Automatic estimation of image regions and proportions.
Novel approach to contextual bandits using self-supervised learning.
problem Exploiting rich data representations in computer vision without explicit labels.
method Combining contextual bandit objective with self-supervision objective.
result Substantial gains in cumulative reward on computer vision datasets.
Improved multimodal variational models capture more complex joint distributions.
problem Limited expressiveness of multimodal variational models.
method Used normalizing flows to approximate and transform a simple parametric joint posterior into a more complex one.
result The model improves on state-of-the-art multimodal variational methods on various tasks.
CURL uses neural curves to enhance global image properties.
problem Global image enhancement using neural networks.
method CURL is a multi-colour space neural retouching block trained in HSV, CIELab, and RGB color spaces.
result CURL produces state-of-the-art image quality in RGB-to-RGB and RAW-to-RGB transformations.
Minimal coloring number found for Z-colorable links.
problem Finding the minimum number of colors needed for Z-colorings of Z-colorable links.
method Defined Z-coloring as a generalization of Fox coloring for links with zero determinants. Provided sufficient conditions for non-splittable Z-colorable links to have the least minimal coloring number.
result Sufficient conditions for non-splittable Z-colorable links to have the least minimal coloring number.
The paper explores minimal coloring numbers for Z-colorable links.
problem Finding the minimum number of colors needed for Z-colorings on minimal diagrams of Z-colorable links. method Investigates minimal diagrams and Z-colorings for Z-colorable links. result For any positive integer N, there exists a minimal diagram of a Z-colorable link with at least N colors in any Z-coloring. The paper shows links can be colored with fewer colors than previously thought.
problem Coloring links using the symmetric group of degree three.
method Analyzing the number of colors for link colorings by S3. result 2-bridge links with 5 colors can be colored with only 4 colors.
Study finds minimal coloring numbers for torus links using rack colorings.
problem Determining the minimal number of colors for torus link diagrams.
method Using rack colorings on link diagrams to classify minimal colorings.
result Complete classifications of Z-colorings by four colors. Study on knots using 17 colors, finding specific color assignments.
problem Understanding the minimum number of colors needed for Fox colorings of knots.
method Investigated 17-colorable knots and their diagrams.
result Found that exactly 6 out of 17 colors are used in diagrams of 17-colorable knots.
New patterns found in knot polynomials resembling Mandelbrot set structure.
problem Understanding zeroes of resultant polynomials in knot theory.
method Applying cabling method to colored HOMFLY polynomials and analyzing resultant zeroes.
result Zeroes of resultant polynomials exhibit smooth curves with few cusps, similar to Mandelbrot set.
Aicardi's invariant F(L) is extended to colored singular links using graphical calculus.
problem Constructing an invariant for colored classical and singular links.
method State-sum model using graphical calculus for oriented, colored, 4-valent planar graphs.
result Extends F(L) to colored singular links, showing it's stronger than HOMFLY-PT polynomial. This paper proves the minimal coloring number for a specific type of link is exactly 4.
problem Determining the minimal coloring number for a specific type of link.
method Investigated Z-colorable links and used their properties to prove the minimal coloring number is 4. result The minimal coloring number of any non-splittable Z-colorable link is exactly 4. The paper finds minimum Dehn colors for knots and defines useful graphs for coloring.
problem Finding the minimum number of colors for Dehn colorings of knots.
method Analyzes Dehn colorings for knots and defines R-palette graphs. result For Dehn p-colorable knots, the minimum number of colors is at least ⌊log2pfloor+2. Algorithm finds minimal colorings of tree structures.
problem Finding minimal unbounded factor complexity colorings of trees.
method Induction algorithm using colored balls.
result Characterization of Sturmian colorings.
The paper offers new ways to solve map coloring problems.
problem Coloring plane maps with four colors.
method Alternate formulations including a tautological expansion and an extended Penrose Bracket.
result Extended Penrose Bracket counts colorings of arbitrary cubic graphs.
This paper shows the minimal coloring number for certain Z-colorable links is four.
problem Determining the minimal number of colors for Z-colorings of links. method Analyzing diagrams of Z-colorable links and constructing specific diagrams to find the minimal coloring number. result The minimal coloring number for non-splittable Z-colorable links is four. We prove that any 11-colorable knot is presented by an 11-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially 11-colored diagrams of the knot. We also prove a similar result for any 11-colorable ribbon 2-knot.
This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are found among the integers modulo n. The choice of n depends upon the knot. Each typ…
The study characterizes torus links' coloring quivers using dihedral quandles.
problem Characterizing the structure of coloring quivers for torus links.
method Exhaustively determining all possible numbers of colorings and their interconnections.
result The quiver structure varies based on the number of colorings.
The paper discusses colorings and doubled colorings of virtual doodles.
problem Coloring virtual doodles using a new algebraic structure.
method Introduced a new algebra called a doodle switch and defined an invariant for virtual doodles.
result Introduced doubled colorings and defined an invariant for virtual doodles.
For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-trivial p-coloring with any number of colors, from the minimum to the maximum number of colors. Furthermore, for any rational link, we prove …
The paper defines a new homotopy type for colored links and proves stabilization behavior.
problem Understanding the behavior of Khovanov homotopy types for colored links.
method Definition of a Khovanov homotopy type for colored links and quantum spin networks, and derivation of its properties.
result Stabilization of the homotopy types for n-colored B-adequate links as nightarrow∞. Paper describes a state sum formula for a graph coloring polynomial.
problem Counting n-face colorings of ribbon graphs for various n. method Combines topological quantum field theory and diagrammatic tensors.
result Describes a state sum formula for the total face color polynomial.
The paper discusses knot colorings and their invariants using Goeritz matrices.
problem Distinguishing knots using coloring methods.
method Elementary approach to equivalence between coloring and Goeritz matrices.
result Computing knot determinant and nullity of pretzel knots.
For any link and for any modulus m we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtaine…
Introduced coloring-allowed invariants of planar knotoids with the coloring number.
problem Construction of polynomial invariants of knotoids with signs of crossings.
method Defined coloring-allowed invariants of planar knotoids with the coloring number.
result Discussed the 4-phases functions of coloring-allowed invariants.
Study of quandle coloring quivers with dihedral quandles.
problem Link invariants and their enhancements using quandles.
method Introduced shadow quandle coloring quivers and cocycle quivers, studied equivalence with quandle coloring numbers and shadow quandle cocycle invariants.
result Equivalence of quandle coloring quivers with quandle coloring numbers and shadow quandle cocycle quivers with shadow quandle cocycle invariants for specific dihedral quandles.
In this article we present the following new fact for prime p=11. For knots 6_2 and 7_2, mincol_{11} 6_2 = 5 = mincol_{11} 7_2, along with the following feature. There is a pair of diagrams, one for 6_2 and the other one for 7_2, each of them admitting only non-trivial 11-colorings using 5 colors, but neither of them a…
New TQFT homologies help color graphs, potentially solving the four color theorem.
problem Graph coloring problem, especially the four color theorem.
method Topological quantum field theory (TQFT) to define homology theories.
result TQFT homologies can generate 4-face colorings of bridgeless planar graphs, offering a constructive approach to the four color theorem.
Link colorings linked to Goeritz matrix.
problem Understanding link colorings and their relation to the Goeritz matrix.
method Exploring the relationship between link colorings and the Goeritz matrix.
result Established a connection between link colorings and the Goeritz matrix.
The ability to characterize the color content of natural imagery is an important application of image processing. The pixel by pixel coloring of images may be viewed naturally as points in color space, and the inherent structure and distribution of these points affords a quantization, through clustering, of the color i…
Paper finds periodic patterns in colored Jones polynomial values.
problem Understanding periodicity in colored Jones polynomial values.
method Investigated polynomial values at specific roots of unity and -1.
result Periodic patterns in polynomial values at certain substitutions.
In this article we show that if a knot diagram admits a non-trivial coloring modulo 13 then there is an equivalent diagram which can be colored with 5 colors. Leaning on known results, this implies that the minimum number of colors modulo 13 is 5.
Study shows colored Jones invariants limit to link volumes.
problem Volume conjecture for colored Jones invariants.
method Deformation of hyperbolic structure for link complements.
result Limits of colored Jones invariants related to link volumes.
The paper finds 3-colorings of 2-sphere triangulations.
problem Coloring edges of triangulations of a 2-sphere in three colors.
method Enumerating triangulations and finding colorings by adding vertices.
result Other triangulations with less than 8 vertices have one unique coloring.
Gradient descent with error feedback performs better than vanilla when features are rare.
problem Improving communication complexity in distributed optimization with rare features.
method Gradient descent with greedy sparsification and error feedback for rare features.
result Communication complexity improves as features become more rare, potentially better than vanilla GD.