scan line

(redirected from Scanlines)
Also found in: Dictionary.

scan line

[′skan ‚līn]
(electronics)
A horizontal row of pixels on a video screen that are examined or refreshed in succession in one sweep across the screen during the scanning process.

scan line

The line produced on a recording medium frame by a single sweep of a scanner.

scan line

(hardware)
A horizontal line of pixels generated by a single horizontal sweep of the beam from a monitor's electron gun. The number of scanlines that make up a frame is the vertical resolution.

scan line

A horizontal line (a row) in a video frame. Camcorders sense image frames a line at a time, and display systems create images a line at a time. The scan lines are the vertical resolution of the system; for example, an NTSC TV signal uses 525 lines, 480 of which contain image data ("active" scan lines) and 45 are the vertical blanking interval (VBI) in between the frames. Following are the active scan lines of various video formats. See scan rate and horizontal scan frequency.

Analog              ActiveFormats             Scan Lines

  VHS                 240
  8mm                 240
  Sony U-matic 3/4"   250
  Sony U-matic SP     330
  S-VHS               400
  Hi8                 400
  Laserdisc           425
  NTSC                480 out of 525
  PAL/SECAM           580 out of 625


  Digital             ActiveFormats             Scan Lines

  DVD                 480
  DV                  480
  SDTV Digital TV     480
  EDTV Digital TV     480
  HDTV Digital TV     720 & 1080
References in periodicals archive ?
The global minimum for independent scanlines can be found in polynomial time by using dynamic programming.
Dynamic programming (DP) is used for matching epipolar scanlines and then the solutions are improved iteratively using edges [30].
In horizontal grid type the smoothness constraints are imposed only within the horizontal scanlines. In [35] the optimization of the energy function for each scanline is done separately by using DP.
In case of stereo, the problem is to find the best path of matching between two scanlines, that is, to find the disparity field with minimum cost.
In DP algorithm individual scanlines are matched well but there is no intrascanline consistency.
The relative ordering of pixels on a scanline must be the same between the two views in this constraint, which may not be the case for thin foreground objects containing images.
It minimizes the global cost for each scanline of image to determine the optimal path, that is, least costly disparity values for each pixel.
The energy function E(d) denotes the total cost of a sequence of matching pixels in a scanline. According to (8), E(d) consists of a data and smoothness term:
It is also speedy compared to correlation and requires lesser scanline buffers than correlation window.
In order to find the minimum cost path, the least cost path for every pixel in a scanline is computed starting from the origin, left to right and top to bottom.