The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] color(289hit)

1-20hit(289hit)

  • Color Correction Method Considering Hue Information for Dichromats Open Access

    Shi BAO  Xiaoyan SONG  Xufei ZHUANG  Min LU  Gao LE  

     
    PAPER-Image

      Pubricized:
    2024/04/22
      Vol:
    E107-A No:9
      Page(s):
    1496-1508

    Images with rich color information are an important source of information that people obtain from the objective world. Occasionally, it is difficult for people with red-green color vision deficiencies to obtain color information from color images. We propose a method of color correction for dichromats based on the physiological characteristics of dichromats, considering hue information. First, the hue loss of color pairs under normal color vision was defined, an objective function was constructed on its basis, and the resultant image was obtained by minimizing it. Finally, the effectiveness of the proposed method is verified through comparison tests. Red-green color vision deficient people fail to distinguish between partial red and green colors. When the red and green connecting lines are parallel to the a* axis of CIE L*a*b*, red and green perception defectives cannot distinguish the color pair, but can distinguish the color pair parallel to the b* axis. Therefore, when two colors are parallel to the a* axis, their color correction yields good results. When color correction is performed on a color, the hue loss between the two colors under normal color vision is supplemented with b* so that red-green color vision-deficient individuals can distinguish the color difference between the color pairs. The magnitude of the correction is greatest when the connecting lines of the color pairs are parallel to the a* axis, and no color correction is applied when the connecting lines are parallel to the b* axis. The objective evaluation results show that the method achieves a higher score, indicating that the proposed method can maintain the naturalness of the image while reducing confusing colors.

  • VH-YOLOv5s: Detecting the Skin Color of Plectropomus leopardus in Aquaculture Using Mobile Phones Open Access

    Beibei LI  Xun RAN  Yiran LIU  Wensheng LI  Qingling DUAN  

     
    PAPER-Artificial Intelligence, Data Mining

      Pubricized:
    2024/03/04
      Vol:
    E107-D No:7
      Page(s):
    835-844

    Fish skin color detection plays a critical role in aquaculture. However, challenges arise from image color cast and the limited dataset, impacting the accuracy of the skin color detection process. To address these issues, we proposed a novel fish skin color detection method, termed VH-YOLOv5s. Specifically, we constructed a dataset for fish skin color detection to tackle the limitation posed by the scarcity of available datasets. Additionally, we proposed a Variance Gray World Algorithm (VGWA) to correct the image color cast. Moreover, the designed Hybrid Spatial Pyramid Pooling (HSPP) module effectively performs multi-scale feature fusion, thereby enhancing the feature representation capability. Extensive experiments have demonstrated that VH-YOLOv5s achieves excellent detection results on the Plectropomus leopardus skin color dataset, with a precision of 91.7%, recall of 90.1%, mAP@0.5 of 95.2%, and mAP@0.5:0.95 of 57.5%. When compared to other models such as Centernet, AutoAssign, and YOLOX-s, VH-YOLOv5s exhibits superior detection performance, surpassing them by 2.5%, 1.8%, and 1.7%, respectively. Furthermore, our model can be deployed directly on mobile phones, making it highly suitable for practical applications.

  • Effect of Perceptually Uniform Color Space and Diversity of Chromaticity Components on Digital Signage and Image Sensor-Based Visible Light Communication Open Access

    Kazuya SHIMEI  Kentaro KOBAYASHI  Wataru CHUJO  

     
    PAPER-Communication Theory and Signals

      Pubricized:
    2023/08/07
      Vol:
    E107-A No:4
      Page(s):
    638-653

    We study a visible light communication (VLC) system that modulates data signals by changing the color components of image contents on a digital signage display, captures them with an image sensor, and demodulates them using image processing. This system requires that the modulated data signals should not be perceived by the human eye. Previous studies have proposed modulation methods with a chromaticity component that is difficult for the human eye to perceive, and we have also proposed a modulation method with perceptually uniform color space based on human perception characteristics. However, which chromaticity component performs better depends on the image contents, and the evaluation only for some specific image contents was not sufficient. In this paper, we evaluate the communication and visual quality of the modulation methods with chromaticity components for various standard images to clarify the superiority of the method with perceptually uniform color space. In addition, we propose a novel modulation and demodulation method using diversity combining to eliminate the dependency of performance on the image contents. Experimental results show that the proposed method can improve the communication and visual quality for almost all the standard images.

  • Invisible Digital Image by Thin-Film Interference of Niobium Oxide Using Its Periodic Repeatability Open Access

    Shuichi MAEDA  Akihiro FUKAMI  Kaiki YAMAZAKI  

     
    INVITED PAPER

      Pubricized:
    2023/08/22
      Vol:
    E107-C No:2
      Page(s):
    42-46

    There are several benefits of the information that is invisible to the human eye. “Invisible” here means that it can be visualized or quantified when using instruments. For example, it can improve security without compromising product design. We have succeeded in making an invisible digital image on a metal substrate using periodic repeatability by thin-film interference of niobium oxides. Although this digital information is invisible in the visible light wavelength range of 400-800nm, but detectable in the infrared light that of 800-1150nm. This technology has a potential to be applied to anti-counterfeiting and traceability.

  • Ising-Machine-Based Solver for Constrained Graph Coloring Problems

    Soma KAWAKAMI  Yosuke MUKASA  Siya BAO  Dema BA  Junya ARAI  Satoshi YAGI  Junji TERAMOTO  Nozomu TOGAWA  

     
    PAPER

      Pubricized:
    2023/09/12
      Vol:
    E107-A No:1
      Page(s):
    38-51

    Ising machines can find optimum or quasi-optimum solutions of combinatorial optimization problems efficiently and effectively. The graph coloring problem, which is one of the difficult combinatorial optimization problems, is to assign a color to each vertex of a graph such that no two vertices connected by an edge have the same color. Although methods to map the graph coloring problem onto the Ising model or quadratic unconstrained binary optimization (QUBO) model are proposed, none of them considers minimizing the number of colors. In addition, there is no Ising-machine-based method considering additional constraints in order to apply to practical problems. In this paper, we propose a mapping method of the graph coloring problem including minimizing the number of colors and additional constraints to the QUBO model. As well as the constraint terms for the graph coloring problem, we firstly propose an objective function term that can minimize the number of colors so that the number of used spins cannot increase exponentially. Secondly, we propose two additional constraint terms: One is that specific vertices have to be colored with specified colors; The other is that specific colors cannot be used more than the number of times given in advance. We theoretically prove that, if the energy of the proposed QUBO mapping is minimized, all the constraints are satisfied and the objective function is minimized. The result of the experiment using an Ising machine showed that the proposed method reduces the number of used colors by up to 75.1% on average compared to the existing baseline method when additional constraints are not considered. Considering the additional constraints, the proposed method can effectively find feasible solutions satisfying all the constraints.

  • Associating Colors with Mental States for Computer-Aided Drawing Therapy

    Satoshi MAEDA  Tadahiko KIMOTO  

     
    PAPER-Artificial Intelligence, Data Mining

      Pubricized:
    2023/09/14
      Vol:
    E106-D No:12
      Page(s):
    2057-2068

    The aim of a computer-aided drawing therapy system in this work is to associate drawings which a client makes with the client's mental state in quantitative terms. A case study is conducted on experimental data which contain both pastel drawings and mental state scores obtained from the same client in a psychotherapy program. To perform such association through colors, we translate a drawing to a color feature by measuring its representative colors as primary color rates. A primary color rate of a color is defined from a psychological primary color in a way such that it shows a rate of emotional properties of the psychological primary color which is supposed to affect the color. To obtain several informative colors as representative ones of a drawing, we define two kinds of color: approximate colors extracted by color reduction, and area-averaged colors calculated from the approximate colors. A color analysis method for extracting representative colors from each drawing in a drawing sequence under the same conditions is presented. To estimate how closely a color feature is associated with a concurrent mental state, we propose a method of utilizing machine-learning classification. A practical way of building a classification model through training and validation on a very small dataset is presented. The classification accuracy reached by the model is considered as the degree of association of the color feature with the mental state scores given in the dataset. Experiments were carried out on given clinical data. Several kinds of color feature were compared in terms of the association with the same mental state. As a result, we found out a good color feature with the highest degree of association. Also, primary color rates proved more effective in representing colors in psychological terms than RGB components. The experimentals provide evidence that colors can be associated quantitatively with states of human mind.

  • Fusion-Based Edge and Color Recovery Using Weighted Near-Infrared Image and Color Transmission Maps for Robust Haze Removal

    Onhi KATO  Akira KUBOTA  

     
    PAPER

      Pubricized:
    2023/05/23
      Vol:
    E106-D No:10
      Page(s):
    1661-1672

    Various haze removal methods based on the atmospheric scattering model have been presented in recent years. Most methods have targeted strong haze images where light is scattered equally in all color channels. This paper presents a haze removal method using near-infrared (NIR) images for relatively weak haze images. In order to recover the lost edges, the presented method first extracts edges from an appropriately weighted NIR image and fuses it with the color image. By introducing a wavelength-dependent scattering model, our method then estimates the transmission map for each color channel and recovers the color more naturally from the edge-recovered image. Finally, the edge-recovered and the color-recovered images are blended. In this blending process, the regions with high lightness, such as sky and clouds, where unnatural color shifts are likely to occur, are effectively estimated, and the optimal weighting map is obtained. Our qualitative and quantitative evaluations using 59 pairs of color and NIR images demonstrated that our method can recover edges and colors more naturally in weak haze images than conventional methods.

  • Device Dependent Information Hiding for Images

    Hiroshi ITO  Tadashi KASEZAWA  

     
    PAPER-Information Network

      Pubricized:
    2022/11/08
      Vol:
    E106-D No:2
      Page(s):
    195-203

    A new method for hiding information in digital images is proposed. Our method differs from existing techniques in that the information is hidden in a mixture of colors carefully tuned on a specific device according to the device's signal-to-luminance (gamma) characteristics. Because these reproduction characteristics differ in general from device to device and even from model to model, the hidden information appears when the cover image is viewed on a different device, and hence the hiding property is device-dependent. To realize this, we modulated a cover image using two identically-looking checkerboard patterns and switched them locally depending on the hidden information. Reproducing these two patterns equally on a different device is difficult. A possible application of our method would be secure printing where an image is allowed to be viewed only on a screen but a warning message appears when it is printed.

  • New VVC Chroma Prediction Modes Based on Coloring with Inter-Channel Correlation

    Zhi LIU  Jia CAO  Xiaohan GUAN  Mengmeng ZHANG  

     
    LETTER-Image Processing and Video Processing

      Pubricized:
    2022/06/27
      Vol:
    E105-D No:10
      Page(s):
    1821-1824

    Inter-channel correlation is one of the redundancy which need to be eliminated in video coding. In the latest video coding standard H.266/VVC, the DM (Direct Mode) and CCLM (Cross-component Linear Model) modes have been introduced to reduce the similarity between luminance and chroma. However, inter-channel correlation is still observed. In this paper, a new inter-channel prediction algorithm is proposed, which utilizes coloring principle to predict chroma pixels. From the coloring perspective, for most natural content video frames, the three components Y, U and V always demonstrate similar coloring pattern. Therefore, the U and V components can be predicted using the coloring pattern of the Y component. In the proposed algorithm, correlation coefficients are obtained in a lightweight way to describe the coloring relationship between current pixel and reference pixel in Y component, and used to predict chroma pixels. The optimal position for the reference samples is also designed. Base on the selected position of the reference samples, two new chroma prediction modes are defined. Experiment results show that, compared with VTM 12.1, the proposed algorithm has an average of -0.92% and -0.96% BD-rate improvement for U and V components, for All Intra (AI) configurations. At the same time, the increased encoding time and decoding time can be ignored.

  • Estimation of Multiple Illuminant Colors Using Color Line Features

    Quan XIU HO  Takao JINNO  Yusuke UCHIMI  Shigeru KURIYAMA  

     
    PAPER-Image Recognition, Computer Vision

      Pubricized:
    2022/06/23
      Vol:
    E105-D No:10
      Page(s):
    1751-1758

    The colors of objects in natural images are affected by the color of lighting, and accurately estimating an illuminant's color is indispensable in analyzing scenes lit by colored lightings. Recent lighting environments enhance colorfulness due to the spread of light-emitting diode (LED) lightings whose colors are flexibly controlled in a full visible spectrum. However, existing color estimations mainly focus on the single illuminant of normal color ranges. The estimation of multiple illuminants of unusual color settings, such as blue or red of high chroma, has not been studied yet. Therefore, new color estimations should be developed for multiple illuminants of various colors. In this article, we propose a color estimation for LED lightings using Color Line features, which regards the color distribution as a straight line in a local area. This local estimate is suitable for estimating various colors of multiple illuminants. The features are sampled at many small regions in an image and aggregated to estimate a few global colors using supervised learning with a convolutional neural network. We demonstrate the higher accuracy of our method over existing ones for such colorful lighting environments by producing the image dataset lit by multiple LED lightings in a full-color range.

  • Speeding-Up Construction Algorithms for the Graph Coloring Problem

    Kazuho KANAHARA  Kengo KATAYAMA  Etsuji TOMITA  

     
    PAPER-Numerical Analysis and Optimization, Algorithms and Data Structures, Graphs and Networks

      Pubricized:
    2022/03/18
      Vol:
    E105-A No:9
      Page(s):
    1241-1251

    The Graph Coloring Problem (GCP) is a fundamental combinatorial optimization problem that has many practical applications. Degree of SATURation (DSATUR) and Recursive Largest First (RLF) are well known as typical solution construction algorithms for GCP. It is necessary to update the vertex degree in the subgraph induced by uncolored vertices when selecting vertices to be colored in both DSATUR and RLF. There is an issue that the higher the edge density of a given graph, the longer the processing time. The purposes of this paper are to propose a degree updating method called Adaptive Degree Updating (ADU for short) that improves the issue, and to evaluate the effectiveness of ADU for DSATUR and RLF on DIMACS benchmark graphs as well as random graphs having a wide range of sizes and densities. Experimental results show that the construction algorithms with ADU are faster than the conventional algorithms for many graphs and that the ADU method yields significant speed-ups relative to the conventional algorithms, especially in the case of large graphs with higher edge density.

  • A Method for Generating Color Palettes with Deep Neural Networks Considering Human Perception

    Beiying LIU  Kaoru ARAKAWA  

     
    PAPER-Image, Vision, Neural Networks and Bioengineering

      Pubricized:
    2021/09/30
      Vol:
    E105-A No:4
      Page(s):
    639-646

    A method to generate color palettes from images is proposed. Here, deep neural networks (DNN) are utilized in order to consider human perception. Two aspects of human perception are considered; one is attention to image, and the other is human preference for colors. This method first extracts N regions with dominant color categories from the image considering human attention. Here, N is the number of colors in a color palette. Then, the representative color is obtained from each region considering the human preference for color. Two deep neural-net systems are adopted here, one is for estimating the image area which attracts human attention, and the other is for estimating human preferable colors from image regions to obtain representative colors. The former is trained with target images obtained by an eye tracker, and the latter is trained with dataset of color selection by human. Objective and subjective evaluation is performed to show high performance of the proposed system compared with conventional methods.

  • Adaptive Binarization for Vehicle State Images Based on Contrast Preserving Decolorization and Major Cluster Estimation

    Ye TIAN  Mei HAN  

     
    PAPER-Image Processing and Video Processing

      Pubricized:
    2021/12/07
      Vol:
    E105-D No:3
      Page(s):
    679-688

    A new adaptive binarization method is proposed for the vehicle state images obtained from the intelligent operation and maintenance system of rail transit. The method can check the corresponding vehicle status information in the intelligent operation and maintenance system of rail transit more quickly and effectively, track and monitor the vehicle operation status in real time, and improve the emergency response ability of the system. The advantages of the proposed method mainly include two points. For decolorization, we use the method of contrast preserving decolorization[1] obtain the appropriate ratio of R, G, and B for the grayscale of the RGB image which can retain the color information of the vehicle state images background to the maximum, and maintain the contrast between the foreground and the background. In terms of threshold selection, the mean value and standard deviation of gray value corresponding to multi-color background of vehicle state images are obtained by using major cluster estimation[2], and the adaptive threshold is determined by the 2 sigma principle for binarization, which can extract text, identifier and other target information effectively. The experimental results show that, regarding the vehicle state images with rich background color information, this method is better than the traditional binarization methods, such as the global threshold Otsu algorithm[3] and the local threshold Sauvola algorithm[4],[5] based on threshold, Mean-Shift algorithm[6], K-Means algorithm[7] and Fuzzy C Means[8] algorithm based on statistical learning. As an image preprocessing scheme for intelligent rail transit data verification, the method can improve the accuracy of text and identifier recognition effectively by verifying the optical character recognition through a data set containing images of different vehicle statuses.

  • Bicolored Path Embedding Problems Inspired by Protein Folding Models

    Tianfeng FENG  Ryuhei UEHARA  Giovanni VIGLIETTA  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2021/12/07
      Vol:
    E105-D No:3
      Page(s):
    623-633

    In this paper, we introduce a path embedding problem inspired by the well-known hydrophobic-polar (HP) model of protein folding. A graph is said bicolored if each vertex is assigned a label in the set {red, blue}. For a given bicolored path P and a given bicolored graph G, our problem asks whether we can embed P into G in such a way as to match the colors of the vertices. In our model, G represents a protein's “blueprint,” and P is an amino acid sequence that has to be folded to form (part of) G. We first show that the bicolored path embedding problem is NP-complete even if G is a rectangular grid (a typical scenario in protein folding models) and P and G have the same number of vertices. By contrast, we prove that the problem becomes tractable if the height of the rectangular grid G is constant, even if the length of P is independent of G. Our proof is constructive: we give a polynomial-time algorithm that computes an embedding (or reports that no embedding exists), which implies that the problem is in XP when parameterized according to the height of G. Additionally, we show that the problem of embedding P into a rectangular grid G in such a way as to maximize the number of red-red contacts is NP-hard. (This problem is directly inspired by the HP model of protein folding; it was previously known to be NP-hard if G is not given, and P can be embedded in any way on a grid.) Finally, we show that, given a bicolored graph G, the problem of constructing a path P that embeds in G maximizing red-red contacts is Poly-APX-hard.

  • Nonuniformity Measurement of Image Resolution under Effect of Color Speckle for Raster-Scan RGB Laser Mobile Projector

    Junichi KINOSHITA  Akira TAKAMORI  Kazuhisa YAMAMOTO  Kazuo KURODA  Koji SUZUKI  Keisuke HIEDA  

     
    PAPER

      Pubricized:
    2021/08/17
      Vol:
    E105-C No:2
      Page(s):
    86-94

    Image resolution under the effect of color speckle was successfully measured for a raster-scan mobile projector, using the modified contrast modulation method. This method was based on the eye-diagram analysis for distinguishing the binary image signals, black-and-white line pairs. The image resolution and the related metrics, illuminance, chromaticity, and speckle contrast were measured at the nine regions on the full-frame area projected on a standard diffusive reflectance screen. The nonuniformity data over the nine regions were discussed and analyzed.

  • Near Hue-Preserving Reversible Contrast and Saturation Enhancement Using Histogram Shifting

    Rio KUROKAWA  Kazuki YAMATO  Madoka HASEGAWA  

     
    PAPER

      Pubricized:
    2021/10/05
      Vol:
    E105-D No:1
      Page(s):
    54-64

    In recent years, several reversible contrast-enhancement methods for color images using digital watermarking have been proposed. These methods can restore an original image from a contrast-enhanced image, in which the information required to recover the original image is embedded with other payloads. In these methods, the hue component after enhancement is similar to that of the original image. However, the saturation of the image after enhancement is significantly lower than that of the original image, and the obtained image exhibits a pale color tone. Herein, we propose a method for enhancing the contrast and saturation of color images and nearly preserving the hue component in a reversible manner. Our method integrates red, green, and blue histograms and preserves the median value of the integrated components. Consequently, the contrast and saturation improved, whereas the subjective image quality improved. In addition, we confirmed that the hue component of the enhanced image is similar to that of the original image. We also confirmed that the original image was perfectly restored from the enhanced image. Our method can contribute to the field of digital photography as a legal evidence. The required storage space for color images and issues pertaining to evidence management can be reduced considering our method enables the creation of color images before and after the enhancement of one image.

  • Weighted PCA-LDA Based Color Quantization Method Suppressing Saturation Decrease

    Seiichi KOJIMA  Momoka HARADA  Yoshiaki UEDA  Noriaki SUETAKE  

     
    LETTER-Image

      Pubricized:
    2021/06/02
      Vol:
    E104-A No:12
      Page(s):
    1728-1732

    In this letter, we propose a new color quantization method suppressing saturation decrease. In the proposed method, saturation-based weight and intensity-based weight are used so that vivid colors are selected as the representative colors preferentially. Experiments show that the proposed method tends to select vivid colors even if they occupy only a small area in the image.

  • Lossless Coding of HDR Color Images in a Floating Point Format Using Block-Adaptive Inter-Color Prediction

    Yuya KAMATAKI  Yusuke KAMEDA  Yasuyo KITA  Ichiro MATSUDA  Susumu ITOH  

     
    LETTER

      Pubricized:
    2021/05/17
      Vol:
    E104-D No:10
      Page(s):
    1572-1575

    This paper proposes a lossless coding method for HDR color images stored in a floating point format called Radiance RGBE. In this method, three mantissa and a common exponent parts, each of which is represented in 8-bit depth, are encoded using the block-adaptive prediction technique with some modifications considering the data structure.

  • Color Conversion Formula with Saturation Correction from HSI Color Space to RGB Color Space

    Minako KAMIYAMA  Akira TAGUCHI  

     
    LETTER-Image

      Pubricized:
    2021/01/18
      Vol:
    E104-A No:7
      Page(s):
    1000-1005

    In color image processing, preservation of hue is required. Therefore, perceptual color models such as HSI and HSV have been used. Hue-Saturation-Intensity (HSI) is a public color model, and many color applications have been made based on this model. However, the transformation from the conventional HSI (C-HSI) color space to the RGB color space after processing intensity/saturation in the C-HSI color space often generates the gamut problem, because the shape of C-HSI color space is a triangular pyramid which includes the RGB color space. When the output of intensity/saturation processing result is located in the outside of the common region of RGB color space and C-HSI color space, it is necessary to move to the RGB color space. The effective way of hue and intensity preserving saturation correction algorithm is proposed. According to the proposed saturation correction algorithm, the corrected saturation value is same as the processing result in the ideal HSI color space whose gamut same as the RGB gamut.

  • Single Image Haze Removal Using Iterative Ambient Light Estimation with Region Segmentation

    Yuji ARAKI  Kentaro MITA  Koichi ICHIGE  

     
    PAPER-Image

      Pubricized:
    2020/08/06
      Vol:
    E104-A No:2
      Page(s):
    550-562

    We propose an iterative single-image haze-removal method that first divides images with haze into regions in which haze-removal processing is difficult and then estimates the ambient light. The existing method has a problem wherein it often overestimates the amount of haze in regions where there is a large distance between the location the photograph was taken and the subject of the photograph; this problem prevents the ambient light from being estimated accurately. In particular, it is often difficult to accurately estimate the ambient light of images containing white and sky regions. Processing those regions in the same way as other regions has detrimental results, such as darkness or unnecessary color change. The proposed method divides such regions in advance into multiple small regions, and then, the ambient light is estimated from the small regions in which haze removal is easy to process. We evaluated the proposed method through some simulations, and found that the method achieves better haze reduction accuracy even than the state-of-the art methods based on deep learning.

1-20hit(289hit)