Show the dynamic range and colour depth, Computer Engineering

Assignment Help:

Q. Show the Dynamic Range and Colour Depth?

Dynamic Range is the number of colours a colour scan or number of grays a monochrome scanner can distinguish. The dynamic range is typically given as bit-depth or colour depth.  This is merely the number of bits to distinguish the colours. Most scanners can do 256(8-bit), 1024(10-bit) or 4096(12-bit) for every primary colour. This adds up to and is advertised as 24-bit, 30-bit and 36-bit colour scanners. Essentiallyhowever to utilise Colour Depth, the image under scanning should be properly focused upon and properly illuminated by scanner. 

Subsequently the minimum colour range useful for human vision is 24-bits more bits can seem useful.  Thoughextra bits of scanning give you firm control for filtering image colour to your needs.


Related Discussions:- Show the dynamic range and colour depth

What are the simplest way to restrict the users, What are the simplest way ...

What are the simplest way to restrict the users The simplest way to restrict the users to peek inside the internals of the Web site is to use firewalls, where the information c

A variable number of input arguments, Write a function that will get a vari...

Write a function that will get a variable number of input arguments: the length and width of a rectangle, and possibly also the height of a box that has this rectangle as its base.

What is a table attribute, What is a Table attribute? The table's attr...

What is a Table attribute? The table's attributes verifies who is responsible for maintaining a table and which types of access are permitted for the table.  The most signific

Super ASCII string checker, In the Byteland country a string "s" is said to...

In the Byteland country a string "s" is said to super ascii string if and only if count of each charecter in the string is equal to its ascci value in the byteland country ascii co

What is reducibility, What is reducibility?  The primary method of prov...

What is reducibility?  The primary method of proving some problems are computationally unsolvable.       It is known as reducibility. Reducibility always includes two problems

Why are binary, Q. Why are binary, octal and hexadecimal used for computer ...

Q. Why are binary, octal and hexadecimal used for computer applications? Q. Perform the following: (189.3) 10 = (?) 2

Embedded software, Embedded Software Intelligent products have becom...

Embedded Software Intelligent products have become commonplace for all consumer and industrial market. Embedded software stays in read only memory and is utilised to control

Transportation model, advantages and disadvantages of northwest corner meth...

advantages and disadvantages of northwest corner method and least cost method

Explain about indexed addressing scheme, In this technique, operand field o...

In this technique, operand field of instruction includes an address and an index register thatcomprises an offset. This addressing scheme is normally used to address the consecutiv

EME, How can i made Carnot engine

How can i made Carnot engine

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd