Loading...
Search for:
color
0.007 seconds
Total 276 records
Thin Film Thickness Measurement Using Colors of Interference Fringes
, M.Sc. Thesis Sharif University of Technology ; Amjadi, Ahmad (Supervisor)
Abstract
There are several methods for measuring thin film thickness, however, for the analysis of liquid film motors [1] we need a method which is capable of measuring the thickness using a single image of the film. In this work, we use the colors that appear on thin films, such as soup bubbles, which is a result of light interference to calculate the thickness of the layer
Separating Colored Points
, M.Sc. Thesis Sharif University of Technology ; Zarei, Alireza (Supervisor)
Abstract
Separating colored points is one of the important problems in computational geometry. In separating colored points problems a set of colored points in Euclidean space are given that each color designates a set of certain data.Different problems can be defined in the colored points subject. Among them,separating colored points is studied in this thesis. It is supposed that two sets of blue and red points are given. It is desired to find the minimum number of rectangles that separate the blue points from the red points. It is demonstrated hat if P ̸= NP then there is no polynomial time algorithm for solving this problem. Then, a constant factor approximation algorithm is introduced and applied...
K-Strong Conflict Free Coloring of Regions with Respect to a Family of Points
, M.Sc. Thesis Sharif University of Technology ; Abam, Mohammad Ali (Supervisor)
Abstract
The conflict-free coloring is one of the computational geometry problems that has received attention in the last two decades. The root of this problem comes from the frequency allocation problem to telecommunications antennas, where we have several telecommunication antennas in two-dimensional space aiming to assign to each of them a frequency so that every point on the plane, which is at least inside one of the antenna ranges, stays in a range with a frequency different from the other antennas containing point.One of the generalizations of this problem is the k-strong case, where we have n regions (equivalent to the circular region of the antennas) that we want to color so that for each...
Dominating coloring number of claw-free graphs
, Article Electronic Notes in Discrete Mathematics ; Vol. 45, issue , January , 2014 , pp. 91-97 ; ISSN: 15710653 ; Akbari, S ; Hossein Ghorban, S ; Qajar, S ; Sharif University of Technology
Abstract
Let G be a graph. It is well-known that G contains a proper vertex-coloring with χ(G) colors with the property that at least one color class of the coloring is a dominating set in G. Among all such proper vertex-coloring of the vertices of G, a coloring with the maximum number of color classes that are dominating sets in G is called a dominating-χ-coloring of G. The number of color classes that are dominating sets in a dominating-χ-coloring of G is defined to be the dominating-χ-color number of G and is denoted by dχ(G). In this paper, we prove that if G is a claw-free graph with minimum degree at least two, then dχ(G)≥2
Direct dyes removal using modified magnetic ferrite nanoparticle
, Article Journal of Environmental Health Science and Engineering ; Vol. 12, Issue. 1 , 28 May , 2014 ; ISSN: 2052336X ; Abdi, J ; Bastani, D ; Sharif University of Technology
Abstract
The magnetic adsorbent nanoparticle was modified using cationic surface active agent. Zinc ferrite nanoparticle and cetyl trimethylammonium bromide were used as an adsorbent and a surface active agent, respectively. Dye removal ability of the surface modified nanoparticle as an adsorbent was investigated. Direct Green 6(DG6), Direct Red 31 (DR31) and Direct Red 23 (DR23) were used. The characteristics of the adsorbent were studied using Fourier transform infrared (FTIR), scanning electron microscopy (SEM) and X-ray diffraction (XRD). The effect of adsorbent dosage, initial dye concentration and salt was evaluated. In ternary system, dye removal of the adsorbent at 90, 120, 150 and 200 mg/L...
Mapping dispersion fluctuations along optical fibers using brillouin probing and a fast analytic calculation
, Article CLEO: Science and Innovations, CLEO_SI 2013, San Jose, CA ; 2013 ; 9781557529725 (ISBN) ; Vedadi, A ; Denisov, A ; Soto, M. A ; Mehrany, K ; Brès, C. S ; Thévenaz, L ; Sharif University of Technology
2013
Abstract
We propose a new system which can generate digital holograms using natural color information. The proposed system can generate about 10 digital holographic video frames per a second using about 6K light sources
Silver Block Intersection Graphs of Steiner 2-Designs
, Article Graphs and Combinatorics ; Volume 29, Issue 4 , 2013 , Pages 735-746 ; 09110119 (ISSN) ; Besharati, N ; Mahmoodian, E. S ; Mortezaeefar, M ; Sharif University of Technology
2013
Abstract
For a block design D, a series of block intersection graphs G i, or i-BIG(D), i = 0,..., k is defined in which the vertices are the blocks of D, with two vertices adjacent if and only if the corresponding blocks intersect in exactly i elements. A silver graph G is defined with respect to a maximum independent set of G, called an α-set. Let G be an r-regular graph and c be a proper (r + 1)-coloring of G. A vertex x in G is said to be rainbow with respect to c if every color appears in the closed neighborhood N[x] = N(x) ∪ {x}. Given an α-set I of G, a coloring c is said to be silver with respect to I if every x ∈ I is rainbow with respect to c. We say G is silver if it admits a silver...
Spanning colored points with intervals
, Article CCCG 2013 - 25th Canadian Conference on Computational Geometry ; 2013 , Pages 265-270 ; Mohades, A ; Abam, M. A ; Kazemi, M. R ; Sharif University of Technology
Canadian Conference on Computational Geometry
2013
Abstract
We study a variant of the problem of spanning colored objects where the goal is to span colored objects with two similar regions. We dedicate our attention in this paper to the case where objects are points lying on the real line and regions are intervals. Precisely, the goal is to compute two intervals together spanning all colors. As the main ingredient of our algorithm, we first introduce a kinetic data structure to keep track of minimal intervals spanning all colors. Then we present a novel algorithm using the proposed KDS to compute a pair of intervals which together span all the colors with the property that the largest one is as small as possible. The algorithm runs in O(n2 log n)...
Liquid color recognition by using an optical reflection system
, Article Journal of Applied Sciences ; Volume 12, Issue 18 , 2012 , Pages 1917-1924 ; 18125654 (ISSN) ; Golnabi, H ; Sharif University of Technology
ANSInet
2012
Abstract
Operation of an optomechanical system for color reflection study is reported. The reported system consists of a double-fiber optical design and an electro-mechanical scanning system. In the double-fiber arrangement one fiber transmits the source light to the target surface and the second one sends the reflected light off the sample target to a photodetector. By scanning the double-fiber probe in one-direction reflection properties of different color liquid samples are investigated in this study. A cubic cell made of glass material is used as the liquid container and reflection signals are compared for different filled color liquids. The maximum reflection signals are: for the yellow color...
Codebook appearance representation for vehicle handover across disjoint-view multicameras
, Article Scientia Iranica ; Volume 18, Issue 6 , 2011 , Pages 1450-1459 ; 10263098 (ISSN) ; Kasaei, S ; Sharif University of Technology
Abstract
Object handover as continually tracking an object across disjoint-view cameras is a necessary part of video-based monitoring systems. While having nonoverlapping cameras is a requirement for monitoring a wide area, there is no common 3D location that can be used to detect multiple views of the same object, in contrast with overlapping cameras. Appearance features play an important role for object handover in such camera networks. This paper focuses on modeling appearance features of moving vehicles by a new major color representation called codebook representation. Toward this end, in each frame, the k-means algorithm is used to cluster major colors of an object. In the subsequent frames, a...
Comparison of the corrosion resistance of alkaline- and acid-anodized titanium
, Article Materials Performance ; Volume 54, Issue 1 , 2015 , Pages 51-55 ; 00941492 (ISSN) ; Ghahramani, S ; Afshar, A ; Malekinejad, P ; Sharif University of Technology
National Assoc. of Corrosion Engineers International
2015
Abstract
The process of self-color anodizing of titanium is done in acidic and alkaline solutions, and anodic films of different colors are formed. Results of this work show that the corrosion rate of titanium decreased after the application of an anodizing layer
New Classes of Set-theoretic Complete Intersection Monomial Ideals
, Article Communications in Algebra ; Volume 43, Issue 9 , Jun , 2015 , Pages 3920-3924 ; 00927872 (ISSN) ; Seyed Fakhari, S. A ; Yassemi, S ; Sharif University of Technology
Taylor and Francis Inc
2015
Abstract
Let Δ be a simplicial complex and χ be an s-coloring of Δ. Biermann and Van Tuyl have introduced the simplicial complex Δχ . As a corollary of Theorems 5 and 7 in their 2013 article, we obtain that the Stanley–Reisner ring of Δχ over a field is Cohen–Macaulay. In this note, we generalize this corollary by proving that the Stanley–Reisner ideal of Δχ over a field is set-theoretic complete intersection. This also generalizes a result of Macchia
Full characterization of a spin liquid phase: From topological entropy to robustness and braid statistics
, Article Journal of Physics A: Mathematical and Theoretical ; Volume 50, Issue 14 , 2017 ; 17518113 (ISSN) ; Langari, A ; Sharif University of Technology
Institute of Physics Publishing
2017
Abstract
We use the topological entanglement entropy (TEE) as an efficient tool to fully characterize the Abelian phase of a Z2 ×Z2 spin liquid emerging as the ground state of topological color code (TCC), which is a class of stabilizer states on the honeycomb lattice. We provide the fusion rules of the quasiparticle (QP) excitations of the model by introducing single- or two-body operators on physical spins for each fusion process which justify the corresponding fusion outcome. Besides this, we extract the TEE from Renyi entanglement entropy (EE) of the TCC, analytically and numerically by finite size exact diagonalization on the disk shape regions with contractible boundaries. We obtain that the EE...
Context-aware colorization of gray-scale images utilizing a cycle-consistent generative adversarial network architecture
, Article Neurocomputing ; Volume 407 , 2020 , Pages 94-104 ; Behroozi, H ; Sharif University of Technology
Elsevier B.V
2020
Abstract
Converting gray-scale images to colorful ones is one of the challenging tasks in the Computer Vision area, and various approaches based on neural network architectures have been proposed to generate colorful images. However, most of the suggested colorization frameworks use a single model for colorization regardless of the diversity of colors in images of various datasets. We claim that since such a structure is responsible for generating all types of images, it results in producing either faint-colored images or some artifacts in the images. We addressed this issue by proposing parallel colorization models, each of which is customized for generating images with similar contexts or color...
Object modeling for multicamera correspondence using fuzzy region color adjacency graphs
, Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 637-644 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) ; Kasaei, S ; Sharif University of Technology
2008
Abstract
In this paper, a novel moving object modeling suitable for multicamera correspondence is introduced. Taking into consideration the color and motion features of foreground objects in each independent video stream, our method segments the existing moving objects and constructs a graph-based structure to maintain the relational information of each segment. Using such graph structures reduces our correspondence problem to a subgraph optimal isomorphism problem. The proposed method is robust against various resolutions and orientations of objects at each view. Our system uses the fuzzy logic to employ a human-like color perception in its decision making stage in order to handle color inconstancy...
Multicolored trees in complete graphs
, Article Journal of Graph Theory ; Volume 54, Issue 3 , 2007 , Pages 221-232 ; 03649024 (ISSN) ; Alipour, A ; Sharif University of Technology
Wiley-Liss Inc
2007
Abstract
A multicolored tree is a tree whose edges have different colors. Brualdi and Hollingsworth [5] proved in any proper edge coloring of the complete graph K2n(n > 2) with 2n -1 colors, there are two edge-disjoint multicolored spanning trees. In this paper we generalize this result showing that if (a1,..., ak) is a color distribution for the complete graph Kn, n ≥ 5, such that 2 ≤ a1 ≤ a2 ≤ ⋯ ≤ ak ≤ (n + 1)/2, then there exist two edge-disjoint multicolored spanning trees. Moreover, we prove that for any edge coloring of the complete graph Kn with the above distribution if T is a non-star multicolored spanning tree of Kn, then there exists a multicolored spanning tree T′ of Kn such that T and T′...
A novel improvement technique for high-level test synthesis
, Article Proceedings of the 2003 IEEE International Symposium on Circuits and Systems, Bangkok, 25 May 2003 through 28 May 2003 ; Volume 5 , 2003 , Pages V609-V612 ; 02714310 (ISSN) ; Esmaeilzadeh, H ; Jahangir, A. H ; Sharif University of Technology
2003
Abstract
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iteration, and significant improved fault coverage. In this paper, we present a novel register allocation method, which is based on weighted graph coloring algorithm, targeting testability improvement for digital circuits. The topics covered in this paper include an overview of HLS and testability parameters, our testability model and experimental results
Object detection in changing environment of middle size RoboCup and some applications
, Article Proceedings of the 2002 IEEE International Symposium on Intelligent Control, Vancouver, 27 October 2002 through 30 October 2002 ; 2002 , Pages 807-810 ; Sadjad, S. B ; Sharif University of Technology
2002
Abstract
In this paper, we introduce several novel ideas on robot vision, its implementation on RoboCup and some of its applications. We discuss about a new color model which components are taken from different color models, a fast object detection method using the idea of searching on a few jump points in the perspective view of robot front view CCD camera, a reliable object shape estimation and a fast method to detect a few edge points on field borders for line estimation. Our practical experiments convinced us that in dynamically changing environment such as RoboCup, fast and almost correct solutions to the vision problems are good enough for detecting objects, finding their distance and angle...
A new dynamic cellular learning automata-based skin detector
, Article Multimedia Systems ; Volume 15, Issue 5 , 2009 , Pages 309-323 ; 09424962 (ISSN) ; Fotouhi, M ; Kasaei, S ; Sharif University of Technology
2009
Abstract
Skin detection is a difficult and primary task in many image processing applications. Because of the diversity of various image processing tasks, there exists no optimum method that can perform properly for all applications. In this paper, we have proposed a novel skin detection algorithm that combines color and texture information of skin with cellular learning automata to detect skin-like regions in color images. Skin color regions are first detected, by using a committee structure, from among several explicit boundary skin models. Detected skin-color regions are then fed to a texture analyzer which extracts texture features via their color statistical properties and maps them to a skin...
Online Conflict-free Coloring Of Intervals
, M.Sc. Thesis Sharif University of Technology ; Abam, Mohammad Ali (Supervisor)
Abstract
In this thesis, we consider the problem of online conflict-free coloring for regions. First, we analyze online variant of the conflict-free coloring of intervals on the line, where each newly inserted interval must be assigned a color upon insertion such that the coloring remains conflict-free, i.e. for every point p in the union of the current intervals, there must be an interval I with a unique color among all intervals covering p. we present deterministic algorithm for achieving this goal which uses O(log^3n) color. Next, we consider the online conflict-free coloring of nearly-equal axis-parallel rectangles in the plane and present a deterministic algorithms which uses O(log^12n)...