Skip to main content
Post Closed as "Not suitable for this site" by LSpice, Yemon Choi, M.G., Sam Hopkins, abx
Full article reference
Source Link
David Roberts
  • 35.5k
  • 11
  • 124
  • 349

I am reading Jimenez, Echevarria, Sousa, and Gutierrez - SMAA: Enhanced Subpixel Morphological Antialiasing

where I have encountered these three equations

\begin{gather*} e_l=\lvert L-L_l\rvert>T \\ c_\text{max} = \max(c_t, c_r,c_l,c_r,c_{2l}) \\ e_{l'}=e_l \land c_l > 0.5 c_\text{max}. \end{gather*}

Because $e_l$ is a number being either 0 or 1, and $c_l$ is always going to be a fraction number, I am wondering what is the AND result of these two? Would it be either 1 or 0 or it is going to be the value of $c_l$ when $e_l$ is 1?

I am reading Jimenez, Echevarria, Sousa, and Gutierrez - SMAA: Enhanced Subpixel Morphological Antialiasing where I have encountered these three equations

\begin{gather*} e_l=\lvert L-L_l\rvert>T \\ c_\text{max} = \max(c_t, c_r,c_l,c_r,c_{2l}) \\ e_{l'}=e_l \land c_l > 0.5 c_\text{max}. \end{gather*}

Because $e_l$ is a number being either 0 or 1, and $c_l$ is always going to be a fraction number, I am wondering what is the AND result of these two? Would it be either 1 or 0 or it is going to be the value of $c_l$ when $e_l$ is 1?

I am reading

where I have encountered these three equations

\begin{gather*} e_l=\lvert L-L_l\rvert>T \\ c_\text{max} = \max(c_t, c_r,c_l,c_r,c_{2l}) \\ e_{l'}=e_l \land c_l > 0.5 c_\text{max}. \end{gather*}

Because $e_l$ is a number being either 0 or 1, and $c_l$ is always going to be a fraction number, I am wondering what is the AND result of these two? Would it be either 1 or 0 or it is going to be the value of $c_l$ when $e_l$ is 1?

TeX and name of paper
Source Link
LSpice
  • 12.9k
  • 4
  • 45
  • 69

Can you do boolean and of "1"1 and a number less than 1?

I am reading this paperJimenez, Echevarria, Sousa, and Gutierrez - SMAA: Enhanced Subpixel Morphological Antialiasing where I have encountered these three equations

$e_l=|L-L_l|>T$

$c_{max} = max(c_t, c_r,c_l,c_r,c_{2l})$

$e_{l'}=e_l \land c_l > 0.5 * c_{max}$\begin{gather*} e_l=\lvert L-L_l\rvert>T \\ c_\text{max} = \max(c_t, c_r,c_l,c_r,c_{2l}) \\ e_{l'}=e_l \land c_l > 0.5 c_\text{max}. \end{gather*}

Because $e_l$ is a number being either 0 or 1, and $c_l$ is always going to be a fraction number, I am wondering what is the AND result of these two? Would it be either 1 or 0 or it is going to be the value of $c_l$ when $e_l$ is 1?

Can you do boolean and of "1" and a number less than 1?

I am reading this paper where I have encountered these three equations

$e_l=|L-L_l|>T$

$c_{max} = max(c_t, c_r,c_l,c_r,c_{2l})$

$e_{l'}=e_l \land c_l > 0.5 * c_{max}$

Because $e_l$ is a number being either 0 or 1, and $c_l$ is always going to be a fraction number, I am wondering what is the AND result of these two? Would it be either 1 or 0 or it is going to be the value of $c_l$ when $e_l$ is 1?

Can you do boolean and of 1 and a number less than 1?

I am reading Jimenez, Echevarria, Sousa, and Gutierrez - SMAA: Enhanced Subpixel Morphological Antialiasing where I have encountered these three equations

\begin{gather*} e_l=\lvert L-L_l\rvert>T \\ c_\text{max} = \max(c_t, c_r,c_l,c_r,c_{2l}) \\ e_{l'}=e_l \land c_l > 0.5 c_\text{max}. \end{gather*}

Because $e_l$ is a number being either 0 or 1, and $c_l$ is always going to be a fraction number, I am wondering what is the AND result of these two? Would it be either 1 or 0 or it is going to be the value of $c_l$ when $e_l$ is 1?

Source Link

Can you do boolean and of "1" and a number less than 1?

I am reading this paper where I have encountered these three equations

$e_l=|L-L_l|>T$

$c_{max} = max(c_t, c_r,c_l,c_r,c_{2l})$

$e_{l'}=e_l \land c_l > 0.5 * c_{max}$

Because $e_l$ is a number being either 0 or 1, and $c_l$ is always going to be a fraction number, I am wondering what is the AND result of these two? Would it be either 1 or 0 or it is going to be the value of $c_l$ when $e_l$ is 1?