[0001] This application claims the benefit of U.S. Provisional Application No.

61/729,985, filed November 26, 2012, the entire content of which is incorporated herein by reference.

TECHNICAL FIELD

[0002] This disclosure relates to video coding, and more particularly to techniques for loop filtering in video coding.

BACKGROUND

[0003] Digital video capabilities can be incorporated into a wide range of devices, including digital televisions, digital direct broadcast systems, wireless broadcast systems, personal digital assistants (PDAs), laptop or desktop computers, digital cameras, digital recording devices, digital media players, video gaming devices, video game consoles, cellular or satellite radio telephones, video teleconferencing devices, and the like. Digital video devices implement video compression techniques, such as those described in the standards defined by MPEG-2, MPEG-4, ITU-T H.263, ITU-T

H.264/MPEG-4, Part 10, Advanced Video Coding (AVC), the High Efficiency Video Coding (HEVC) standard presently under development, and extensions of such standards, to transmit, receive and store digital video information more efficiently.

[0004] Video compression techniques include spatial prediction and/or temporal prediction to reduce or remove redundancy inherent in video sequences. For block- based video coding, a video frame or slice may be partitioned into blocks. Each block can be further partitioned. Blocks in an intra-coded (I) frame or slice are encoded using spatial prediction with respect to reference samples in neighboring blocks in the same frame or slice. Blocks in an inter-coded (P or B) frame or slice may use spatial prediction with respect to reference samples in neighboring blocks in the same frame or slice or temporal prediction with respect to reference samples in other reference frames. Spatial or temporal prediction results in a predictive block for a block to be coded. Residual data represents pixel differences between the original block to be coded and the predictive block. [0005] An inter-coded block is encoded according to a motion vector that points to a block of reference samples forming the predictive block, and the residual data indicating the difference between the coded block and the predictive block. An intra-coded block is encoded according to an intra-coding mode and the residual data. For further compression, the residual data may be transformed from the pixel domain to a transform domain, resulting in residual transform coefficients, which then may be quantized. The quantized transform coefficients, initially arranged in a two-dimensional array, may be scanned in a particular order to produce a one-dimensional vector of transform coefficients for entropy coding.

SUMMARY

[0006] In general, this disclosure describes techniques for coding video data. In particular, this disclosure describes techniques for loop filtering for video coding. The techniques of this disclosure may apply to loop filtering and/or partial loop filtering across block boundaries. Loop filtering may include, for example, one or more of adaptive loop filtering (ALF), sample adaptive offset (SAO) filtering, and deblocking filtering.

[0007] In one example, the disclosure describes a method of video coding the method comprising coding a block of video data according to a scalable video coding process, and limiting the application of a loop filter to the block of video data based on characteristics of the scalable video coding process.

[0008] In another example, the disclosure describes an apparatus configured to code video data, the apparatus comprising a video coder configured to code a block of video data according to a scalable video coding process, and limit the application of a loop filter to the block of video data based on characteristics of the scalable video coding process.

[0009] In another example, the disclosure describes an apparatus configured to code video data, the apparatus comprising: means for coding a block of video data according to a scalable video coding process, and means for limiting the application of a loop filter to the block of video data based on characteristics of the scalable video coding process.

[0010] In another example, the disclosure describes a computer-readable storage medium storing instructions that, when executed, cause one or more processors of a device configured to code video data to code a block of video data according to a scalable video coding process, and limit the application of a loop filter to the block of video data based on characteristics of the scalable video coding process.

[0011] The details of one or more examples are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description and drawings, and from the claims.

BRIEF DESCRIPTION OF DRAWINGS

[0012] FIG. 1 is a block diagram illustrating an example video encoding and decoding system.

[0013] FIG. 2 is a conceptual diagram illustrating example edge offset classifications.

[0014] FIG. 3 is a conceptual diagram illustrating example band offset classifications.

[0015] FIG. 4 is a conceptual diagram showing region-based classification for an adaptive loop filter.

[0016] FIG. 5 is a conceptual diagram showing block-based classification for an adaptive loop filter.

[0017] FIG. 6 A is a conceptual diagram showing sample adaptive offset with padded pixels.

[0018] FIG. 6B is a conceptual diagram showing skipping a sample adaptive offset process.

[0019] FIG. 7 is conceptual diagram depicting a loop filter at block boundaries.

[0020] FIG. 8 is conceptual diagram depicting asymmetric partial filters at a horizontal boundary.

[0021] FIG. 9 is conceptual diagram depicting asymmetric partial filters at a vertical boundary.

[0022] FIG. 10 is conceptual diagram depicting symmetric partial filters at a horizontal boundary.

[0023] FIG. 11 is conceptual diagram depicting symmetric partial filters at a vertical boundary.

[0024] FIG. 12 is a block diagram illustrating an example video encoder.

[0025] FIG. 13 is a block diagram illustrating an example video decoder.

[0026] FIG. 14 is a flowchart illustrating an example encoding method of the disclosure. [0027] FIG. 15 is a flowchart illustrating an example decoding method of the disclosure.

DETAILED DESCRIPTION

[0028] In general, this disclosure describes techniques for coding video data. In particular, this disclosure describes techniques for loop filtering in a video coding process.

[0029] For video coders configured to perform constrained intra prediction, pixels from neighboring blocks coded in a non-intra mode (e.g., inter predicted) may not be reconstructed. As such, pixels from neighboring blocks may be unavailable for use in loop filters (e.g., deblocking, sample adaptive offset (SAO), adaptive loop filters (ALF)). In view of this feature of constrained intra prediction, this disclosure presents techniques for loop filtering, including techniques for partial loop filtering around boundaries of intra-predicted blocks. In some examples, the loop filtering techniques of this disclosure are applied to constrained intra-predicted blocks (i.e., blocks where some intra-prediction techniques are limited and/or constrained). The techniques of this disclosure may be applied to any loop filter, including deblocking, ALF, and SAO filters. In one example, this disclosure proposes techniques for coding a block of video data according to a scalable video coding process (e.g., scalable high efficiency video coding (SHEVC)). The techniques of this disclosure include limiting the application of a loop filter to the block of video data based on characteristics of the scalable video coding process.

[0030] FIG. 1 is a block diagram illustrating an example video encoding and decoding system 10 that may be configured to utilize techniques for loop filtering in a video coding process in accordance with examples of this disclosure. As shown in FIG. 1, the system 10 includes a source device 12 that transmits encoded video to a destination device 14 via a communication channel 16. Encoded video data may also be stored on a storage medium 34 or a file server 36 and may be accessed by the destination device 14 as desired. When stored to a storage medium or file server, video encoder 20 may provide coded video data to another device, such as a network interface, a compact disc (CD), Blu-ray or digital video disc (DVD) burner or stamping facility device, or other devices, for storing the coded video data to the storage medium. Likewise, a device separate from video decoder 30, such as a network interface, CD or DVD reader, or the like, may retrieve coded video data from a storage medium and provided the retrieved data to video decoder 30.

[0031] The source device 12 and the destination device 14 may comprise any of a wide variety of devices, including desktop computers, notebook (i.e., laptop) computers, tablet computers, set-top boxes, telephone handsets such as so-called smartphones, televisions, cameras, display devices, digital media players, video gaming consoles, or the like. In many cases, such devices may be equipped for wireless communication. Hence, the communication channel 16 may comprise a wireless channel, a wired channel, or a combination of wireless and wired channels suitable for transmission of encoded video data. Similarly, the file server 36 may be accessed by the destination device 14 through any standard data connection, including an Internet connection. This may include a wireless channel (e.g., a Wi-Fi connection), a wired connection (e.g., DSL, cable modem, etc.), or a combination of both that is suitable for accessing encoded video data stored on a file server.

[0032] Techniques for loop filtering in a video coding process, in accordance with examples of this disclosure, may be applied to video coding in support of any of a variety of multimedia applications, such as over-the-air television broadcasts, cable television transmissions, satellite television transmissions, streaming video

transmissions, e.g., via the Internet, encoding of digital video for storage on a data storage medium, decoding of digital video stored on a data storage medium, or other applications. In some examples, the system 10 may be configured to support one-way or two-way video transmission to support applications such as video streaming, video playback, video broadcasting, and/or video telephony.

[0033] In the example of FIG. 1, the source device 12 includes a video source 18, a video encoder 20, a modulator/demodulator 22 and a transmitter 24. In the source device 12, the video source 18 may include a source such as a video capture device, such as a video camera, a video archive containing previously captured video, a video feed interface to receive video from a video content provider, and/or a computer graphics system for generating computer graphics data as the source video, or a combination of such sources. As one example, if the video source 18 is a video camera, the source device 12 and the destination device 14 may form so-called camera phones or video phones. However, the techniques described in this disclosure may be applicable to video coding in general, and may be applied to wireless and/or wired applications, or application in which encoded video data is stored on a local disk. [0034] The captured, pre-captured, or computer-generated video may be encoded by the video encoder 20. The encoded video information may be modulated by the modem 22 according to a communication standard, such as a wireless communication protocol, and transmitted to the destination device 14 via the transmitter 24. The modem 22 may include various mixers, filters, amplifiers or other components designed for signal modulation. The transmitter 24 may include circuits designed for transmitting data, including amplifiers, filters, and one or more antennas.

[0035] The captured, pre-captured, or computer-generated video that is encoded by the video encoder 20 may also be stored onto a storage medium 34 or a file server 36 for later consumption. The storage medium 34 may include Blu-ray discs, DVDs, CD- ROMs, flash memory, or any other suitable digital storage media for storing encoded video. The encoded video stored on the storage medium 34 may then be accessed by the destination device 14 for decoding and playback.

[0036] The file server 36 may be any type of server capable of storing encoded video and transmitting that encoded video to the destination device 14. Example file servers include a web server (e.g., for a website), an FTP server, network attached storage (NAS) devices, a local disk drive, or any other type of device capable of storing encoded video data and transmitting it to a destination device. The transmission of encoded video data from the file server 36 may be a streaming transmission, a download transmission, or a combination of both. The file server 36 may be accessed by the destination device 14 through any standard data connection, including an Internet connection. This may include a wireless channel (e.g., a Wi-Fi connection), a wired connection (e.g., DSL, cable modem, Ethernet, USB, etc.), or a combination of both that is suitable for accessing encoded video data stored on a file server.

[0037] The destination device 14, in the example of FIG. 1, includes a receiver 26, a modem 28, a video decoder 30, and a display device 32. The receiver 26 of the destination device 14 receives information over the channel 16, and the modem 28 demodulates the information to produce a demodulated bitstream for the video decoder 30. The information communicated over the channel 16 may include a variety of syntax information generated by the video encoder 20 for use by the video decoder 30 in decoding video data. Such syntax may also be included with the encoded video data stored on the storage medium 34 or the file server 36. Each of the video encoder 20 and the video decoder 30 may form part of a respective encoder-decoder (CODEC) that is capable of encoding or decoding video data. [0038] The display device 32 may be integrated with, or external to, the destination device 14. In some examples, the destination device 14 may include an integrated display device and also be configured to interface with an external display device. In other examples, the destination device 14 may be a display device. In general, the display device 32 displays the decoded video data to a user, and may comprise any of a variety of display devices such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display device.

[0039] In the example of FIG. 1, the communication channel 16 may comprise any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines, or any combination of wireless and wired media. The communication channel 16 may form part of a packet-based network, such as a local area network, a wide-area network, or a global network such as the Internet. The communication channel 16 generally represents any suitable communication medium, or collection of different communication media, for transmitting video data from the source device 12 to the destination device 14, including any suitable combination of wired or wireless media. The communication channel 16 may include routers, switches, base stations, or any other equipment that may be useful to facilitate communication from the source device 12 to the destination device 14.

[0040] Although not shown in FIG. 1, in some aspects, the video encoder 20 and the video decoder 30 may each be integrated with an audio encoder and decoder, and may include appropriate MUX-DEMUX units, or other hardware and software, to handle encoding of both audio and video in a common data stream or separate data streams. If applicable, in some examples, MUX-DEMUX units may conform to the ITU H.223 multiplexer protocol, or other protocols such as the user datagram protocol (UDP).

[0041] The video encoder 20 and the video decoder 30 each may be implemented as any of a variety of suitable encoder circuitry, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware or any combinations thereof. When the techniques are implemented partially in software, a device may store instructions for the software in a suitable, non-transitory computer- readable medium and execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. Each of the video encoder 20 and the video decoder 30 may be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in a respective device. [0042] The video encoder 20 may implement any or all of the techniques of this disclosure for loop filtering in a video coding process. Likewise, the video decoder 30 may implement any or all of these techniques for loop filtering in a video coding process. A video coder, as described in this disclosure, may refer to a video encoder or a video decoder. Similarly, a video coding unit may refer to a video encoder or a video decoder. In this context, a video coding unit is physical hardware and differs from the CU data structure discussed above. Likewise, video coding may refer to video encoding or video decoding.

[0043] The video encoder 20 and the video decoder 30 may operate according to a video compression standard, such as the HEVC and/or SHEVC standards presently under development, and may conform to the HEVC Test Model (HM). Alternatively, the video encoder 20 and the video decoder 30 may operate according to other proprietary or industry standards, such as the ITU-T H.264 standard, alternatively referred to as MPEG-4, Part 10, Advanced Video Coding (AVC), or extensions of such standards. The techniques of this disclosure, however, are not limited to any particular coding standard. Other examples include MPEG-2 and ITU-T H.263.

[0044] There is a new video coding standard, namely High-Efficiency Video Coding (HEVC), being developed by the Joint Collaboration Team on Video Coding (JCT-VC) of ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Motion Picture Experts Group (MPEG). A recent draft of the HEVC standard, referred to as "HEVC Working Draft 9" or "WD9," is described in document JCTVC-K1003_v9, Brass et al, "High efficiency video coding (HEVC) text specification draft 9," Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 11th Meeting: Shanghai, CN, 10-19 October 2012, which, as of October 18, 2013, is downloadable from http ://phenix.int- eyry .fr/j ct/ doc_end_user/ documents/ 11 _Shanghai/wg 11 /JCTVC- 1003 -v9.zip . A more recent draft of HEVC is described in ITU-T H.265, SERIES H: AUDIOVISUAL AND MULTIMEDIA SYSTEMS, Infrastructure of Audiovisual Services— Coding of Moving Video, "High Efficiency Video Coding," April 2013 (hereinafter, "HEVC"). HEVC is incorporated by reference herein in its entirety. Various extensions to HEVC have been proposed. One such extension is the HEVC Range Extension, described in "High Efficiency Video Coding (HEVC) Range Extensions text specification: Draft 4," JCTVC-N1005_vl, April 2013 (hereinafter, "JCTVC-N1005"). A recent Working Draft (WD) of SHEVC, entitled "High efficiency video coding (HEVC) scalable extension draft 3," Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 14th Meeting: Vienna, AT, 25 July - 2 Aug. 2013, and referred to as SHEVC WD3 hereinafter, is available from

http://phenix.it-sudparis.eu/jct/doc_end_user/documents/1 4_Vienna/wgl l/JCTVC- N1008-v3.zip, which is incorporated be reference herein in its entirety.

[0045] Digital video devices implement video compression techniques to encode and decode digital video information more efficiently. Video compression may apply spatial (intra-frame) prediction and/or temporal (inter-frame) prediction techniques to reduce or remove redundancy inherent in video sequences.

[0046] For video coding according to the current working draft of HEVC, as one example, a video frame may be partitioned into coding units. A coding unit (CU) generally refers to an image region that serves as a basic unit to which various coding tools are applied for video compression. A CU usually has a luminance component, which may be denoted as Y, and two chroma components, which may be denoted as Cr and Cb. Depending on the video sampling format, the size of the Cr and Cb

components, in terms of number of samples, may be the same as or different from the size of the Y component. A CU is typically square, and may be considered to be similar to a so-called macroblock, e.g., under other video coding standards such as ITU-T H.264.

[0047] To achieve better coding efficiency, a coding unit may have variable sizes depending on video content. In addition, a coding unit may be split into smaller blocks for prediction or transform. In particular, each coding unit may be further partitioned into prediction units (PUs) and transform units (TUs). Prediction units may be considered to be similar to so-called partitions under other video coding standards, such as H.264. Transform units (TUs) refer to blocks of residual data to which a transform is applied to produce transform coefficients.

[0048] Coding according to some of the presently proposed aspects of the developing HEVC standard will be described in this application for purposes of illustration.

However, the techniques described in this disclosure may be useful for other video coding processes, such as those defined according to H.264 or other standard or proprietary video coding processes.

[0049] HEVC standardization efforts are based on a model of a video coding device referred to as the HEVC Test Model (HM). The HM presumes several capabilities of video coding devices over devices according to, e.g., ITU-T H.264/ AVC. For example, whereas H.264 provides nine intra-prediction encoding modes, HM provides as many as thirty- five intra-prediction encoding modes.

[0050] According to the HM, a CU may include one or more prediction units (PUs) and/or one or more transform units (TUs). Syntax data within a bitstream may define a largest coding unit (LCU), which is a largest CU in terms of the number of pixels. In general, a CU has a similar purpose to a macroblock of H.264, except that a CU does not have a size distinction. Thus, a CU may be split into sub-CUs. In general, references in this disclosure to a CU may refer to a largest coding unit of a picture or a sub-CU of an LCU. An LCU may be split into sub-CUs, and each sub-CU may be further split into sub-CUs. Syntax data for a bitstream may define a maximum number of times an LCU may be split, referred to as CU depth. Accordingly, a bitstream may also define a smallest coding unit (SCU). This disclosure also uses the term "block", "partition," or "portion" to refer to any of a CU, PU, or TU. In general, "portion" may refer to any sub-set of a video frame.

[0051] An LCU may be associated with a quadtree data structure. In general, a quadtree data structure includes one node per CU, where a root node corresponds to the LCU. If a CU is split into four sub-CUs, the node corresponding to the CU includes four leaf nodes, each of which corresponds to one of the sub-CUs. Each node of the quadtree data structure may provide syntax data for the corresponding CU. For example, a node in the quadtree may include a split flag, indicating whether the CU corresponding to the node is split into sub-CUs. Syntax elements for a CU may be defined recursively, and may depend on whether the CU is split into sub-CUs. If a CU is not split further, it is referred as a leaf-CU.

[0052] Moreover, TUs of leaf-CUs may also be associated with respective quadtree data structures. That is, a leaf-CU may include a quadtree indicating how the leaf-CU is partitioned into TUs. This disclosure refers to the quadtree indicating how an LCU is partitioned as a CU quadtree and the quadtree indicating how a leaf-CU is partitioned into TUs as a TU quadtree. The root node of a TU quadtree generally corresponds to a leaf-CU, while the root node of a CU quadtree generally corresponds to an LCU. TUs of the TU quadtree that are not split are referred to as leaf-TUs.

[0053] A leaf-CU may include one or more prediction units (PUs). In general, a PU represents all or a portion of the corresponding CU, and may include data for retrieving a reference sample for the PU. For example, when the PU is inter-mode encoded, the PU may include data defining a motion vector for the PU. The data defining the motion vector may describe, for example, a horizontal component of the motion vector, a vertical component of the motion vector, a resolution for the motion vector (e.g., one- quarter pixel precision or one-eighth pixel precision), a reference frame to which the motion vector points, and/or a reference list (e.g., list 0 or list 1) for the motion vector. Data for the leaf-CU defining the PU(s) may also describe, for example, partitioning of the CU into one or more PUs. Partitioning modes may differ depending on whether the CU is not predictively coded, intra-prediction mode encoded, or inter-prediction mode encoded. For intra coding, a PU may be treated the same as a leaf transform unit described below.

[0054] To code a block (e.g., a prediction unit (PU) of video data), a predictor for the block is first derived. The predictor can be derived either through intra (I) prediction (i.e. spatial prediction) or inter (P or B) prediction (i.e. temporal prediction). Hence, some prediction units may be intra-coded (I) using spatial prediction with respect to neighboring reference blocks in the same frame, and other prediction units may be inter- coded (P or B) with respect to reference blocks in other frames. The reference blocks used for prediction may include actual pixel values at so-called integer pixel positions as reference samples, or synthesized pixel values produced by interpolation at fractional pixel positions as reference samples.

[0055] Upon identification of a predictor, the difference between the original video data block and its predictor is calculated. This difference is also called the prediction residual, and refers to the pixel differences between the pixels of the block to be coded and corresponding reference samples (which may be integer-precision pixels or interpolated fractional-precision pixels, as mentioned above) of the reference block, i.e., predictor. To achieve better compression, the prediction residual (i.e., the array of pixel difference values) is generally transformed from the pixel (i.e., spatial) domain to a transform domain, e.g., using a discrete cosine transform (DCT), integer transform, Karhunen-Loeve (K-L) transform, or other transform. The transform domain may be, for example, a frequency domain.

[0056] Coding a PU using inter-prediction involves calculating a motion vector between a current block and a block in a reference frame. Motion vectors are calculated through a process called motion estimation (or motion search). A motion vector, for example, may indicate the displacement of a prediction unit in a current frame relative to a reference sample of a reference frame. A reference sample may be a block that is found to closely match the portion of the CU including the PU being coded in terms of pixel difference, which may be determined by sum of absolute difference (SAD), sum of squared difference (SSD), or other difference metrics. The reference sample may occur anywhere within a reference frame or reference slice. In some examples, the reference sample may be interpolated, in whole or in part, and occur at a fractional pixel position. Upon finding a portion of the reference frame that best matches the current portion, the encoder determines the current motion vector for the current portion as the difference in the location from the current portion to the matching portion in the reference frame (e.g., from the center of the current portion to the center of the matching portion).

[0057] In some examples, an encoder may signal the motion vector for each portion in the encoded video bitstream. The signaled motion vector is used by the decoder to perform motion compensation in order to decode the video data. However, signaling the original motion vector directly may result in less efficient coding, as a large number of bits are typically needed to convey the information.

[0058] Once motion estimation is performed to determine a motion vector for a current portion, the encoder compares the matching portion in the reference frame to the current portion. This comparison typically involves subtracting the portion (which is commonly referred to as a "reference sample") in the reference frame from the current portion and results in so-called residual data, as mentioned above. The residual data indicates pixel difference values between the current portion and the reference sample. The encoder then transforms this residual data from the spatial domain to a transform domain, such as the frequency domain. Usually, the encoder applies a discrete cosine transform (DCT) to the residual data to accomplish this transformation. The encoder performs this transformation in order to facilitate the compression of the residual data because the resulting transform coefficients represent different frequencies, wherein the majority of energy is usually concentrated on a few low frequency coefficients.

[0059] Typically, the resulting transform coefficients are grouped together in a manner that enables entropy coding, especially if the transform coefficients are first quantized (rounded). The encoder then performs statistical lossless (or so-called "entropy") encoding to further compress the run-length coded quantized transform coefficients. After performing lossless entropy coding, the encoder generates a bitstream that includes the encoded video data.

[0060] The video encoding process may also include a so-called "reconstruction loop" whereby encoded video blocks are decoded and stored in a reference frame buffer for use as reference frames for subsequently coded video blocks. The reference frame buffer also is referred to as the decoded picture buffer or DPB. The reconstructed video blocks are often filtered before storing in the reference frame buffer. Filtering is commonly used, for example, to reduce blockiness or other artifacts common to block- based video coding. Filter coefficients (sometimes called filter taps) may be defined or selected in order to promote desirable levels of video block filtering that can reduce blockiness and/or improve the video quality in other ways. A set of filter coefficients, for example, may define how filtering is applied along edges of video blocks or other locations within video blocks. Different filter coefficients may cause different levels of filtering with respect to different pixels of the video blocks. Filtering, for example, may smooth or sharpen differences in intensity of adjacent pixel values in order to help eliminate unwanted artifacts.

[0061] As one example, a deblocking filter may be used to improve the appearance (e.g., smooth the edges) between blocks of coded video data. Another example filter is a sample adaptive offset (SAO) filter that is used to add offset to reconstructed blocks of pixels to improve image quality and coding efficiency. Another type of filter that is used in the reconstruction loop in one proposal for HEVC is the adaptive loop filter (ALF). The ALF is typically performed after a deblocking filter. The ALF restores the fidelity of pixels degraded by the video coding compression process. The ALF attempts to minimize the mean squared error between the original pixel values in the source frame and those of the reconstructed frame. An ALF may also be applied at the output of a video decoder in the same fashion as was applied during the encoding process. Collectively, any filter used in the reconstruction loop may be referred to as a "loop filter." Loop filters may include one or more deblocking filters, SAO filters, and ALFs. In addition, other types of filters for use in the reconstruction loop are also possible.

[0062] The above-described HEVC techniques may also be used to code two or more "layers" in the emerging scalable extensions of HEVC (SHEVC). In SHEVC, a base layer and one or more enhancement layers may be coded in manner such that the base layer is independently coded from the one or more enhancement layers. Video coded in the base layer provides a first (or base) level of video resolution. Additional

enhancement layers may also be coded in manner that, when added to the output of the base layer, may produce a higher resolution video. SHEVC may be particularly applicable for situations where lower levels of bandwidth may be available for transmission of video. In some circumstances, only the base layer may be able to be transmitted. When additional bandwidth is available, one or more enhancement layers may also be transmitted. In this way, streaming video connectivity may be maintained by temporarily lowering the quality of the video.

[0063] In some proposals for HEVC, the deblocking (DB) and sample adaptive offset (SAO) filters are employed. In some proposals for SHEVC, DB and SAO are used in the base layer, while DB, SAO and adaptive loop filters (ALF) are considered for use in the enhancement layer. Furthermore, SAO and ALF are considered for use in the inter- layer prediction path (i.e., inter-prediction performed between two layers).

[0064] In some example SAO implementations for HEVC and SHEVC, a partition (which consists of a set of LCUs) can have one of three pixel classifications: no offset, edge classification based type, and band classification based offset type. Further, the edge classification based type includes four edge offset classifications: one dimensional (ID) 0-degree edge (also referred to as SAO edge offset of classification zero or SAO_ EO 0), ID 90-degree edge (also referred to as SAO edge offset of classification one or SAO_ EO l), ID 135-degree edge (also referred to as SAO edge offset of classification two or SAO_ E0 2), and ID 45 -degree edge (also referred to as SAO edge offset of classification three or SAO_ E0 3). Band classification based offset type includes two band offset type classifications: central band and side band.

[0065] An edge classification based type SAO technique classifies each pixel within a partition based on edge information. FIG. 2 is a conceptual diagram showing four possible edge offset classifications. JCT-VC E049 ("CE13: Sample adaptive offset with LCU-independent decoding," Fu et al, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 5th Meeting: Geneva, CH, 16-23 March, 2011) describes one example of an edge classification technique that includes the four edge offset type classifications described above. For a given edge classification shown in FIG. 2, an edge type for the current pixel is calculated by comparing the value of the current pixel (C) to the values of neighboring pixels (1 and 2). In some examples, pixel values may be an 8-bit string including 256 possible values or a 10-bit string including 1024 possible values. For SAO_ EO 0 (0 degrees), the current pixel is compared to the left and right neighbor pixels. For SAO_ EO l (90 degrees), the current pixel is compared to the top and bottom neighbor pixels. For SAO_ E0 2 (135 degrees), the current pixel is compared to the upper left and bottom right neighbor pixels. For SAO_ E0 3 (45 degrees), the current pixel is compared to the bottom left and upper right neighbor pixels. [0066] Initially, the edge type of the current pixel is assumed to be zero. If the value of current pixel C is equal to values of both the left and right neighbor pixels (1 and 2), the edge type remains at zero. If the value of the current pixel C is greater than the value of neighbor pixel 1, the edge type is increased by one. If the value of the current pixel C is less than the value of neighbor pixel 1, the edge type is decreased by one. Likewise, if the value of the current pixel C is greater than the value of neighbor pixel 2, the edge type is increased by one, and if the value of the current pixel C is less than the value of the neighbor pixel 2, the edge type is decreased by 1.

[0067] As such, the current pixel C may have an edge type of either -2, -1, 0, 1, or 2, where (1) the edge type is -2 if the value of current pixel C is less than both values of neighbor pixels 1 and 2; (2) the edge type is -1 if the value of current pixel C is less than one neighbor pixel, but equal to the other neighbor pixel; (3) the edge type is 0 if the value of current pixel C is the same as both neighbor pixels, or if the value of current pixel C is greater than one neighbor pixel, but less than the other neighbor pixel; (4) the edge type is 1 if the value of the current pixel C is greater than one neighbor pixel, but equal to the other neighbor pixel; and (5) the edge type is 2 if the value of the current pixel C is greater than both values of neighbor pixels 1 and 2. It should be noted that when one of neighboring pixels 1 and 2 is not available (i.e., current pixel C is located at the edge of a frame or partition), a default edge type may be defined.

[0068] In view of the above description, for each edge offset classification, edge type values may be computed with the following equations:

EdgeType = 0;

if (C > Pixel 1) EdgeType = EdgeType + 1;

if (C < Pixel 1) EdgeType = EdgeType - 1;

if (C > Pixel 2) EdgeType = EdgeType + 1 ;

if (C < Pixel 2) EdgeType = EdgeType - 1 ;

[0069] Once an edge type is determined for a current pixel an offset value can be determined for the current pixel. Offset values are based on the difference between the original video frame and the reconstructed video frame. In one example, each non-zero edge type value (i.e., -2, -1, 1, and 2) has one offset value calculated by taking an average of differences between the values of original and reconstructed pixels belonging to each category in a partition. The four offset values may be denoted as eoffset_2, eoffseti, eoffseti, and eoffset ₂ . Because each of eoffset_ ₂ , eoffseti, eoffseti, and eoffset ₂ is based on the original video frame, which is not available at a video decoder, a video decoder includes a mechanism to derive the four offset values without relying on the original video frame.

[0070] Band classification based offset type classification classifies pixels into different bands based on their intensity. As described above, band classification based offset type classification may include two band offset type classifications: central band and side band. FIG. 3 is a conceptual diagram showing an example band classification based offset type classification including a central band and a side band. As shown in FIG. 3, each of pixel intensities 0 to MAX may be categorized into one of 32 bands. In one example, pixels may have 8-bit intensity values and MAX may equal 255. In the example of FIG. 3, the 16 bands in the center are classified into a first group and the remaining side bands are classified into a second group. In a manner similar to edge type offset classification, once a band type is determined for a current pixel, an offset value can be determined for the current pixel based on the difference between the original video frame and the reconstructed video frame. In one example, each band type value (i.e., 0 to 31) has one offset value calculated by taking an average of differences between the values of original and reconstructed pixels belonging to each band type category in a partition. Thus, for each group of bands (i.e., first group and second group), 16 offset values are determined. The 16 offset values for each group may be denoted as boffset ₀ ,... ,boffset ₁₅ . As with eoffset ₂ , eoffset _i, eoffseti, and eoffset ₂ , each of boffseto,... boffseti ₅ is based on the original video frame and a video decoder includes a mechanism to derive the 16 offset values.

[0071] Typically, an encoded video bitstream includes information indicating one of the six pixel classification types and a corresponding set of offsets (i.e., eoffset _2, ... , eoffset ₂ and boffseto, ..., boffseti ₅ ) for each partition of a video frame. In some cases, each offset value in a set of offset values is independently coded using signed unary coding on a partition-by-partition basis. Independently coding offset values using signed unary coding fails to exploit possible correlations between offset values within a set offset values or between offset values of neighboring partitions (or partitions from previous frames). Thus, independently coding offset values using signed unary coding may not provide the most efficient bit rate.

[0072] Further, SAO techniques may be executed in conjunction with additional filtering techniques. Additional filtering techniques may include, for example, Weiner filtering techniques. Similar to the calculation of offset values for SAO techniques, additional filtering techniques may calculate filter coefficients based on the difference between the original frame and the reconstructed frame. For example, filter coefficients for a Weiner filter may be determined based on the difference between the original picture and a reconstructed picture. Like offset values, calculated coefficients may also be included in the bitstream for use by a video decoder.

[0073] In one example ALF process proposed for HEVC and SHEVC, a filtered pixel value is derived by taking a summation of adjusted values of current and neighboring pixels within a partition of a video block, wherein the values of current and neighboring pixels are adjusted by multiplying calculated AC coefficients and adding DC

coefficients to the current and neighboring pixels. The value of the summation may further be normalized by dividing the result of the summation by the total number of pixels included in partition. The equation below provides an example equation for calculating a filtered pixel using AC and DC coefficients, wherein the pixel is included in partition of size 1 by m and bit shift is a normalizing factor:

Filtered pixel (x,y) = (sumi _,m ( prefiltered pixel(x+l,y+m) * AC coefficients(l,m)) + DC coefficients ) » bit shift.

[0074] In one ALF proposal for HEVC and SHEVC, two adaptation modes (i.e., block and region adaptation modes) are proposed. For region adaptive mode, a frame is divided into 16 regions, and each region can have one set of linear filter coefficients (a plurality of AC coefficients and one DC coefficient), and one region can share the same filter coefficients with other regions. FIG. 4 is a conceptual diagram showing region- based classification for an adaptive loop filter. As shown in FIG. 4, frame 120 is divided into 16 regions, and each region may include multiple CUs. Each of these 16 regions is represented by a number (0-15) that indicates the particular set of linear filter coefficients used by that region. The numbers (0-15) may be index numbers to a predetermined set of filter coefficients that are stored at both a video encoder and a video decoder. In one example, a video encoder may signal, in the encoded video bitstream, the index number of the set of filter coefficients used by the video encoder for a particular region. Based on the signaled index, a video decoder may retrieve the same predetermined set of filter coefficients to use in the decoding process for that region. In other examples, the filter coefficients are signaled explicitly for each region.

[0075] For a block-based classification mode, a frame is divided into 4x4 blocks, and each 4x4 block derives one class by computing a metric using direction and activity information. For each class, one set of linear filter coefficients (a plurality of AC coefficients and one DC coefficient) can be used and one class can share the same filter coefficients with other classes. FIG. 5 is a conceptual diagram showing block-based classification for an adaptive loop filter.

[0076] The computation of the direction and activity, and the resulting metric based on direction and activity, are shown below:

^■ Direction

^■ Ver_act(i,j) = abs ( X(i,j)«l - X(i,j-1) - X(i,j+1) )

^■ Hor_act(i,j) = abs ( X(i,j)«l - X(i-l,j) - X(i+l,j) )

^■ H _B =∑i=o, ₂ ∑j=o,2 H(i,j)

^■ V _B =∑i=o,2∑j=o,2 V(i,j)

^■ Direction = 0, 1 (H>2V), 2 (V>2H)

^■ Activity

^■ L _B = H _B + V _B

^■ 5 classes (0, 1, 2, 3, 4)

^■ Metric

^■ Activity + 5* Direction

[0077] Hor act (i, j) generally refers to the horizontal activity of current pixel (i, j), and Vert_act(i, j) generally refers to the vertical activity of current pixel (i,j). X(i, j) generally refers to a pixel vale of pixel (i, j) ), where i and j indicate horizontal and vertical coordinates of the current pixel. In this context, activity is generally the gradient or variance among pixels in a location.

[0078] H _B refers to the horizontal activity of the 4x4 block, which in this example is determined based on a sum of horizontal activity for pixels (0, 0), (0, 2), (2, 0), and (2, 2). V _B refers to the vertical activity of the 4x4 block, which in this example is determined based on a sum of vertical activity for pixels (0, 0), (0, 2), (2, 0), and (2, 2). "«1" represents a multiply by two operation. Based on the values of H _B and V _B , a direction can be determined.

[0079] As one example, if the value of H _B is more than 2 times the value of V _B , then the direction can be determined to be direction 1 (i.e., horizontal), which might correspond to more horizontal activity than vertical activity. If the value of V _B is more than 2 times the value of H _B , then the direction can be determined to be direction 2 (i.e., vertical), which might correspond to more vertical activity than horizontal activity. Otherwise, the direction can be determined to be direction 0 (i.e., no direction), meaning neither horizontal nor vertical activity is dominant. The labels for the various directions and the ratios used to determine the directions merely constitute one example, as other labels and ratios can also be used.

[0080] Activity (L _B ) for the 4x4 block can be determined as a sum of the horizontal and vertical activity. The value of L _B can be classified into a range. This particular example shows five ranges, although more or fewer ranges may similarly be used. Based on the combination of activity and direction, a filter for the 4x4 block of pixels can be selected. As one example, a filter may be selected based on a two-dimensional mapping of activity and direction to filters, or activity and direction may be combined into a single metric, and that single metric may be used to select a filter (e.g., the metric = Activity + 5* Direction).

[0081] Returning to FIG. 5, block 140 represents a 4x4 block of pixels. In this example, only four of the sixteen pixels are used to calculate activity and direction metrics for a block-based ALF. The four pixels are pixel (0, 0) which is labeled as pixel 141, pixel (2, 0) which is labeled as pixel 142, pixel (0, 2) which is labeled as pixel 143, and pixel (2, 2) which is labeled as pixel 144. The Horizontal activity of pixel 141 (i.e., hor_act(0, 0)), for example, is determined based on a left neighboring pixel and a right neighboring pixel. The right neighboring pixel is labeled as pixel 145. The left neighboring pixel is located in a different block than the 4x4 block and is not shown in FIG. 5. The vertical activity of pixel 142 (i.e., ver_act(2, 0)), for example, is determined based on an upper neighboring pixel and a lower neighboring pixel. The lower neighboring pixel is labeled as pixel 146, and the upper neighboring pixel is located in a different block than the 4x4 block and is not shown in FIG. 5. Horizontal and vertical activity may be calculated for pixels 143 and 144 in a similar manner.

[0082] When single-loop decoding of SHEVC is performed, inter-layer block prediction (IntraBL) uses reconstructed pixels from the base layer whose block type is intra (i.e., the block was intra-predicted). In one proposal for SHEVC, the intra-prediction performed on such base layer blocks is always constrained intra prediction. Constrained intra prediction is a loss-resilience feature in HEVC. Neighboring reference samples inside any inter-predicted block are considered not available in order to avoid letting potentially corrupted prior decoded picture data propagate errors into the prediction signal. As such, in constrained intra prediction, when performing intra-prediction on a current block, neighboring blocks that were inter-predicted are not allowed to be used as predictors. This constraint allows only one motion compensation in the target layer. [0083] For this purpose, previous scalable video coding (SVC) techniques (e.g., the scalable video extension of H.264/AVC) used a special treatment for deblocking operations. Deblocking between inter and intra blocks of base layer is not allowed, because allowance of deblocking between inter and intra blocks requires reconstruction of neighboring inter blocks (i.e., in H.264-AVC/SVC, deblock strength is set to 0 if interLayerDeblockingFlag is equal to 1 and mbType[mbAddrP ] is Inter macroblock prediction mode).

[0084] Now, in SHEVC, there are other loop filters, such as SAO and ALF, which may benefit from special handling when those filters are applied to constrained intra blocks in the base layer. Also, the same problems may occur when loop filters are used in inter-layer prediction (e.g., inter-layer SAO and ALF).

[0085] In view of these potential drawbacks, this disclosure presents techniques for loop filtering, including techniques for partial loop filtering around boundaries of intra- predicted blocks. In some examples, the loop filtering techniques of this disclosure are applied to constrained intra-predicted blocks (i.e., blocks where some intra-prediction techniques are limited and/or constrained). The techniques of this disclosure may be applied to any loop filter, including deblocking, ALF, and SAO filters. In one example, this disclosure proposes techniques for coding a block of video data according to a scalable video coding process (e.g., SHEVC). The techniques of this disclosure include limiting the application of a loop filter to the block of video data based on

characteristics of the scalable video coding process.

[0086] In this context, limiting the application of a loop filter involves performing a loop filtering process that is in some way different or limited in relation to the loop filter processes specified in proposals for HEVC and SHEVC. The examples of limiting the application of a loop filter described below may include the restriction of what pixels are used as an input to a filter process, what pixels are actually filtered, and not performing filtering at all based on certain characteristics of the scalable video coding process (e.g., characteristics of SHEVC). Example characteristics that may be used to determine how to limit loop filtering processes may include the use or non-use of constrained intra-coding, the use of inter-layer prediction, and whether or not the block to be filtered is in a base or enhancement layer.

[0087] The next section will discuss the techniques of this disclosure for SAO coding in a base layer. In one example of the disclosure, when determining whether or not to apply SAO filtering at the boundary of constrained intra blocks of the base layer, several solutions are presented to help the use of pixels from non-intra neighboring blocks. As described above, because non-intra neighboring blocks may not be reconstructed when using constrained intra-prediction for a block of video data, pixels for non-intra neighboring blocks may not be available for use in loop filtering processes, including SAO filtering. In particular, pixels from neighboring blocks may be unavailable to make edge offset or band offset determinations for SAO.

[0088] In one example of the disclosure for SAO coding in the base layer on

constrained intra blocks, rather than using the pixels of non-intra neighboring blocks to apply the SAO, padded pixels are used instead. That is, rather than using pixels from non-intra neighboring blocks to make a determination of edge offset type, as well as the offsets to be used, pixels from the constrained intra-block are reused (i.e., padded) in place of any unavailable pixels needed from neighboring non-intra blocks. Then the edge offset type, as well as the offset values themselves, may be determined as normal, as was outlined above with reference to FIG. 2. FIG. 6 A shows an example for edge offset type zero (SAO EO 0) classification where a pixel (pixel P) is unavailable as it is located in a non-intra neighboring block. In the example of FIG. 6A, a padded pixel is used in place of the unavailable pixel. Note that similar techniques may be applied to the other edge offset types.

[0089] In another example of the disclosure for SAO coding in the base layer on constrained intra blocks, SAO coding is skipped for boundary pixels in the case that the neighboring block is not intra-coded. That is, SAO filtering is not applied for pixels at boundaries of a constrained intra block in situations where pixels from an unavailable non-intra neighboring block are needed for making an edge offset type determination, and/or are needed for the determination of the offset values themselves. FIG. 6B shows an example for edge offset type zero (SAO EO 0) classification where a pixel (pixel X) is unavailable as it is located in a non-intra neighboring block. In the example of FIG. 6B, SAO is skipped for pixel C. Note that similar techniques may be applied to the other edge offset types. In one example, SAO coding may be skipped for an entire block where one pixel in the block uses a pixel from a non-intra neighboring block to make an edge offset type determination. In another example, as will be discussed below, SAO coding may be skipped only for the pixel that uses a pixel from a non-intra neighboring block.

[0090] In another example of SAO coding in the base layer on constrained intra blocks, SAO coding may be selectively skipped depending on the sao type on the boundary pixels. For example, when band offset (BO) is used, no pixels are skipped because BO only requires the current pixel (i.e., a pixel in the intra-coded block) for classification. If edge offset (EO) is used, SAO is skipped only on pixel positions which require access to pixels belonging to neighboring inter blocks (i.e., neighbor blocks that are not intra- coded as shown in FIG. 6B).

[0091] In another example of the disclosure for SAO coding in the base layer on constrained intra blocks, SAO coding is skipped or the SAO type is set to zero (meaning SAO is not applied) for all constrained intra blocks of a base layer, regardless of whether or not pixels from neighboring blocks are needed to make an edge offset type determination. In another example of the disclosure for SAO coding in the base layer on constrained intra blocks, SAO coding is skipped or the SAO type is set to zero (meaning SAO is not applied) when at least one of the neighboring blocks is not intra- coded.

[0092] In another example of the disclosure for SAO coding in the base layer on constrained intra blocks, avoiding usage of non-intra pixels (e.g., pixels from

neighboring inter-predicted blocks) in the SAO process may be accomplished through encoder restriction and imposing a bitstream constraint where the bitstream shall not contain the SAO type that requires non-intra pixels for the SAO process, in particular for pixel classification. That is, rather than requiring video decoder 30 to make a determination of whether or not to apply SAO to particular block, video encoder 20 may be configured such that it does not signal SAO types that may require special handling at boundaries of constrained intra blocks (e.g., edge offset types).

[0093] In addition to all the solutions mentioned above for SAO coding in a base layer, video encoder 20 may be configured to signal a flag (flagl) in the encoded video bitstream to indicate that SAO application is restricted to intra pixels in the base layer.

[0094] The next section of the disclosure will discuss SAO coding for inter layer prediction. In one example of the disclosure for SAO coding in inter layer prediction, rather than using the pixels of non-intra neighboring blocks to apply the SAO (e.g., for determining SAO edge offset type), padded pixels are used instead. The same techniques as described above with reference to FIG. 6A may be used. In one example, SAO coding may be skipped for an entire block where one pixel in the block uses a pixel from a non-intra neighboring block to make an edge offset type determination. In another example, as will be discussed below, SAO coding may be skipped only for the pixel that uses a pixel from a non-intra neighboring block. [0095] In another example of the disclosure for SAO coding in inter layer prediction, SAO coding is skipped for boundary pixels where neighboring blocks are not intra- coded. The same techniques as described above with reference to FIG. 6B may be used.

[0096] In another example of the disclosure for SAO coding in inter layer prediction, SAO coding is selectively skipped depending on the sao type of the boundary pixels in the case that a neighboring block is not intra-coded. For example, when band offset (BO) is used, no pixels are skipped because BO only requires a current pixel for classification. If edge offset (EO) is used, SAO is skipped only on pixel positions which require access to pixels belonging to inter blocks. In another example of SAO coding in inter layer prediction, SAO coding is skipped or SAO type is set to zero (meaning SAO is not applied) for constrained intra blocks of base layer.

[0097] In another example of SAO coding in inter layer prediction, SAO coding is skipped or SAO type is set to zero (meaning SAO is not applied) for constrained intra blocks of base layer when at least one of neighboring block is not intra-coded.

[0098] In another example of SAO coding in inter layer prediction, avoiding usage of non-intra pixels in the SAO process may be accomplished through encoder restriction and imposing a bitstream constraint where the bitstream shall not contain the SAO type that requires non-intra pixels for the SAO process, in particular for pixel classification.

[0099] In addition to all the solutions mentioned above, a video encoder may signal, and a video decoder may receive, a flag (flag2) in the encoded video bitstream to indicate that SAO application is restricted to intra pixels in the base layer.

[0100] The next section will discuss ALF coding for inter layer prediction. When inter- layer ALF is used in the boundary of constrained intra blocks, there are several solutions possible to prevent the use of pixels from non-intra neighboring blocks. As discussed above, for constrained intra blocks/frames, pixels from non-intra neighboring blocks may not be reconstructed, and thus may be unavailable for use with ALF.

[0101] In one example of ALF coding in inter layer prediction, rather than using the pixels of non-intra neighboring blocks to apply the ALF, padded pixels are used instead. In another example of ALF coding in inter layer prediction, ALF coding is skipped on boundary pixels where neighboring blocks are not intra-coded. Similar to the examples above with regard to FIG. 6A and 6B, if the filter mask for ALF extends to pixels in neighboring non-intra blocks, ALF filtering for such boundary pixels may be skipped, or padded data may be used. In another example of ALF coding in inter layer prediction, ALF coding is skipped for constrained intra blocks of the base layer. In another example of ALF coding in inter layer prediction, ALF coding is skipped for constrained intra blocks of the base layer when at least one of the neighboring blocks is not intra- coded.

[0102] As such, in one example, ALF coding may be skipped for an entire block where one pixel in the block uses a pixel from a non-intra neighboring block to make an edge offset type determination. In another example, ALF coding may be skipped only for the pixel that uses a pixel from a non-intra neighboring block.

[0103] In another example of ALF coding in inter layer prediction, partial ALF filtering is used. In partial ALF filtering, only the available pixels for the filter are used (i.e., filter taps whose corresponding pixels are not available are not used). Partial filtering may be symmetrical or asymmetrical. Symmetrical and asymmetrical partial filtering is discussed in more detail below with reference to FIGS. 7-11.

[0104] FIG. 7 is conceptual diagram depicting an ALF at block boundaries. Horizontal block boundary 201 is depicted as a horizontal line and vertical block boundary 202 is depicted as a vertical line. The filled circles (i.e., dots) of filter mask 200 in FIG. 7 represent coefficients (i.e., weights) of the filter, which are applied to pixels of the reconstructed video block in the slice and/or tile. That is, the value of a coefficient of the filter may be applied to the value of a corresponding pixel, such that the value of the corresponding is multiplied by the coefficient value to produce a weighted pixel value. The pixel value may include a luminance value and one or more chrominance values. Assuming that the center of the filter is positioned at the position of (or in close proximity to) the pixel to be filtered, a filter coefficient may be said to correspond to a pixel that is collocated with the position of the coefficient. Pixels corresponding to coefficients of a filter can also be referred to as "supporting pixels" or collectively, as a "set of support" for the filter. The filtered value of a current pixel 203 (corresponding to the center pixel mask coefficient CO) is calculated my multiplying each coefficient in filter mask 200 by the value of its corresponding pixel, and summing each resulting value.

[0105] In this disclosure, the term "filter" generally refers to a set of filter coefficients. For example, a 3x3 filter may be defined by a set of 9 filter coefficients, a 5x5 filter may be defined by a set of 25 filter coefficients, a 9x5 filter may be defined by a set of 45 filter coefficients, and so on. Filter mask 200 shown in FIG. 7 is a 7x5 filter having 7 filter coefficients in the horizontal direction and 5 filter coefficients in the vertical direction (the center filter coefficient counting for each direction). However, any number of filter coefficients may be applicable for the techniques of this disclosure. The term "set of filters" generally refers to a group of more than one filter. For example, a set of two 3x3 filters, could include a first set of 9 filter coefficients and a second set of 9 filter coefficients. The term "shape," sometimes called the "filter support," generally refers to the number of rows of filter coefficients and number of columns of filter coefficients for a particular filter. For example, 9x9 is an example of a first shape, 7x5 is an example of a second shape, and 5x9 is an example of a third shape. In some instances, filters may take non-rectangular shapes including diamond-shapes, diamond-like shapes, circular shapes, circular-like shapes, hexagonal shapes, octagonal shapes, cross shapes, X-shapes, T-shapes, other geometric shapes, or numerous other shapes or configuration. The example in FIG. 7 is a cross shape; however other shape may be used. In most common cases, regardless of the shape of the filter, the center pixel in the filter mask is the one that is being filtered. In other examples, the filter pixel is offset from the center of the filter mask.

[0106] In accordance with the example discussed above, ALF may be disabled or limited across block boundaries. In one example, this disclosure proposes using partial filters around block boundaries. A partial filter is a filter that does not use one or more filter coefficients that are typically used for the filtering process. In one example, this disclosure proposes using partial filters where at least the filter coefficients

corresponding to pixels on the other side of a block boundary are not used. Hence, in some examples, there is no need to provide padded data for the pixels on the other side of the block boundary. Rather, a partial filter can be configured to omit the pixels on the other side of the block boundary.

[0107] In one example, asymmetric partial filters are used near block boundaries. FIG. 8 is conceptual diagram depicting asymmetric partial filters at a horizontal boundary. FIG. 9 is conceptual diagram depicting asymmetric partial filters at a vertical boundary. In this approach, as shown in FIGS. 9 and 10, only available pixels (i.e., pixels within the current block) are used for filtering. Filter taps outside the block boundary are skipped. The filters in FIG. 8 and FIG. 9 are referred to as asymmetric because there are more filter taps used on one side (either the horizontal or vertical side) of the center of the filter mask then the other. As the entire filter mask is not used, the filter coefficients may be renormalized to produce the desired results. Techniques for renormalization will be discussed in more detail below. [0108] In Case 1 of FIG. 8, the center 221 of filter mask 220 is one row of pixels away from a horizontal block boundary. Since filter mask 220 is a 7x5 filter, one filter coefficient in the vertical direction corresponds to a pixel that is over the horizontal boundary. This filter coefficient is depicted in white, i.e., as an unfilled circle. The pixel corresponding to the white filter coefficient is unavailable for use in filtering. As such, the filter coefficient corresponding to that pixel is not used. Likewise, in Case 2, the center 222 of filter mask 225 is on a row of pixels adjacent the horizontal block boundary. In this case, two filter coefficients correspond to pixels that are over the horizontal boundary. As such, neither of the two white filter coefficients in filter mask 225 is used for ALF. In both Case 1 and Case 2, all black (i.e., filled circle) filter coefficients are used. It should be noted that filter pixels values in accordance with this disclosure may include filtering luminance components of the pixel value, filtering chrominance components of the pixel value, or filtering both luminance and

chrominance components of the pixel value.

[0109] In case 3 of FIG. 9, the center 235 of filter mask 234 is two columns of pixels away from a vertical tile boundary. Since filter mask 234 is a 7x5 filter, one filter coefficient in the horizontal direction corresponds to a pixel that is over the vertical boundary. Again, this filter coefficient is depicted in white. The pixel corresponding to the white filter coefficient is unavailable for use in filtering. As such, the filter coefficient corresponding to that pixel is not used. Similarly, in Case 4, the center 233 of filter mask 232 is one column of pixels away from a vertical block boundary. In this case, two filter coefficients correspond to pixels that over the vertical boundary. As such, neither of the two white filter coefficients in filter mask 232 is used for ALF. In Case 5, the center 231 of filter mask 230 is on a column of pixels adjacent the vertical boundary. In this case, three filter coefficients correspond to pixels that are over the vertical boundary. As such, none of the three white filter coefficients in filter makes 230 are used for ALF. In all of Case 1, 2 or 3, all black filter coefficients are used.

[0110] In another example, symmetric partial filters are used near block boundaries. FIG. 10 is conceptual diagram depicting symmetric partial filters at a horizontal boundary. FIG. 11 is conceptual diagram depicting symmetric partial filters at a vertical boundary. As with asymmetric partial filters, in this approach, only available pixels are used for filtering. That is, the filter taps outside the block boundary are skipped. Also, some coefficients of the filter mask that are within the current slice or tile are also not used, so as to retain a symmetrical filter mask. [0111] For example, in Case 6 of FIG. 10, one filter coefficient in filter mask 240 is outside the horizontal block boundary. The corresponding filter coefficient within the horizontal boundary on the other side of the filter mask is also not used. In this way, a symmetrical arrangement of coefficients in the vertical direction around the center coefficient 241 is preserved. In Case 7 of FIG. 10, two filter coefficients in filter mask 242 are across the horizontal boundary. The corresponding two filter coefficients on the other side of the center filter coefficient 243 within the horizontal boundary are also not used. Similar examples are shown in FIG. 11 for the vertical tile boundary. In case 8, one filter coefficient corresponds to a pixel across the vertical block boundary. This coefficient is not used, as well as another pixel at the left side of the horizontal part of filter mask 250 to maintain symmetry around center coefficient 251. Similar filter mask adjustments are made for filter masks 252 and 254 in the case where two (Case 9) and three (Case 10) filter coefficients correspond to pixels across the vertical boundary. Shown in Cases 9 and 10, symmetry is maintained around center coefficients 253 and 255, respectively.

[0112] Like the asymmetric partial filters shown in FIG. 8 and FIG. 9, the entire filter mask is not used for the symmetric partial filters. Accordingly, the filter coefficients may be renormalized. Techniques for renormalization will be discussed in more detail below.

[0113] To reiterate, for each of the filter masks shown in FIGS. 8-12, a filtered value for the pixel corresponding to the center of the filter mask is calculated by multiplying a filter coefficient (represented by a darkened circle in the mask) to an associated pixel value, and then adding the multiplied values together.

[0114] Renormalization of filter coefficients for symmetric and asymmetric partial filter can be achieved in different ways. In general, the renormalization process recalculates the value of the remaining filter coefficients in a partial filter mask, such that the total value of the remaining filter coefficients equals the total value of the original filter coefficients. Often, this total value is 1. Consider an example where the original filter coefficients are labeled as C_l,...,C_N, where C is the value of a particular coefficient. Now assume that the C_1,...,C_M coefficients do not have available corresponding pixels (i.e., the corresponding pixels are across a slice or tile boundary). Renormalized filter coefficients can be defined as follows: Example 1

Coeff_all = C_l + C_2 +...+C_N

CoefTpart = Coeff_all - (C_l+...+C_M)

New_coeffs C_i'= C_i * Coeff_all/Coeff_part, i= M+l,...,N

[0115] In example 1, Coeff all represents the value of all coefficients in a filter mask summed together. Coeff_part represents the value of all coefficients in a partial filter mask. That is, the summed value of the coefficients corresponding to unavailable pixels (C 1+...+C_M) are subtracted from the sum of all possible coefficients in the filter mask (Coeff_all). New_coeffs_Ci' represents the value of the filter coefficients in the partial coefficients after a renormalization process. In Example 1 above, the value of the coefficient remaining in the partial filter is multiplied by the total value of all possible coefficients in the filter mask (Coeff all) and divided by the total value of all coefficients in the partial filter mask (Coeff_part).

[0116] Example 2 below shows another technique for renormalizing filter coefficients in a partial filter.

Example 2

For subset of C_i, i= M+ 1 , ... ,N, add C_k, k= 1 , ... ,M

For example,

a. C_(M+1)'= C_(M+1) + C_l, C_(M+2)'= C_(M+2) + C_3,... or b. C_L' = C_L + (C I + C 2 +...+C M)

In this example, filter coefficients are renormalized by adding the coefficients of skipped filter taps (C_k) to the coefficients of non-skipped filter taps (C i).

[0117] In addition to all the solutions mentioned above with regard to ALF for inter layer prediction, a flag (flag3) may be signaled by a video encoder to indicate that ALF application is restricted to intra pixels in the base layer and/or inter-layer filtering.

[0118] In one example of the disclosure, the newly introduced flags (i.e., flagl, flag2 and flag3) may be merged together into a single flag. In another example, flagl, flag2 and flag 3 may be merged into one flag with the corresponding flag for DB

(interLayerDeblockingFlag in H.264). As yet another example, flagl, flag2 and flag3 may be merged into one flag with the constraint intra flag.

[0119] FIG. 12 is a block diagram illustrating an example of a video encoder 20 that may use techniques for loop filtering in a video coding process as described in this disclosure. The video encoder 20 will be described in the context of SHEVC and HEVC coding for purposes of illustration, but without limitation of this disclosure as to other coding standards or methods that may require loop filtering. The video encoder 20 may perform intra- and inter-coding of CUs within video frames. Intra-coding relies on spatial prediction to reduce or remove spatial redundancy in video data within a given video frame. Inter-coding relies on temporal prediction to reduce or remove temporal redundancy between a current frame and previously coded frames of a video sequence. In some examples, video encoder may be configured to perform inter-layer prediction. Intra-mode (I -mode) may refer to any of several spatial-based video compression modes. Inter-modes such as uni-directional prediction (P-mode) or bidirectional prediction (B-mode) may refer to any of several temporal-based video compression modes.

[0120] As shown in FIG. 12, the video encoder 20 receives a current video block within a video frame to be encoded. In the example of FIG. 12, the video encoder 20 includes a motion compensation unit 44, a motion estimation unit 42, an intra-prediction module 46, a reference frame buffer 64, a summer 50, a transform module 52, a quantization unit 54, and an entropy encoding unit 56. The transform module 52 illustrated in FIG. 12 is the unit that applies the actual transform or combinations of transform to a block of residual data, and is not to be confused with block of transform coefficients, which also may be referred to as a transform unit (TU) of a CU. For video block

reconstruction, the video encoder 20 also includes an inverse quantization unit 58, an inverse transform module 60, a summer 62, and a loop filter unit 43. Loop filter unit 43 may comprise one or more of a deblocking filter unit, an SAO filter unit, and an ALF filter unit.

[0121] During the encoding process, the video encoder 20 receives a video frame or slice to be coded. The frame or slice may be divided into multiple video blocks, e.g., largest coding units (LCUs). The motion estimation unit 42 and the motion

compensation unit 44 perform inter-predictive coding of the received video block relative to one or more blocks in one or more reference frames to provide temporal compression. The intra-prediction module 46 may perform intra-predictive coding of the received video block relative to one or more neighboring blocks in the same frame or slice as the block to be coded to provide spatial compression.

[0122] The mode select unit 40 may select one of the coding modes, intra or inter, e.g., based on rate distortion results for each mode, and provides the resulting intra- or inter- predicted block (e.g., a prediction unit (PU)) to the summer 50 to generate residual block data and to the summer 62 to reconstruct the encoded block for use in a reference frame. Summer 62 combines the predicted block with inverse quantized, inverse transformed data from inverse transform module 60 for the block to reconstruct the encoded block, as described in greater detail below. Some video frames may be designated as I-frames, where all blocks in an I-frame are encoded in an intra-prediction mode. In some cases, the intra-prediction module 46 may perform intra-prediction encoding of a block in a P- or B-frame, e.g., when motion search performed by the motion estimation unit 42 does not result in a sufficient prediction of the block.

[0123] The motion estimation unit 42 and the motion compensation unit 44 may be highly integrated, but are illustrated separately for conceptual purposes. Motion estimation (or motion search) is the process of generating motion vectors, which estimate motion for video blocks. A motion vector, for example, may indicate the displacement of a prediction unit in a current frame relative to a reference sample of a reference frame. In some cases the reference frame may be in a different layer than the coded frame (e.g., in inter-layer prediction). The motion estimation unit 42 calculates a motion vector for a prediction unit of an inter-coded frame by comparing the prediction unit to reference samples of a reference frame stored in the reference frame buffer 64. A reference sample may be a block that is found to closely match the portion of the CU including the PU being coded in terms of pixel difference, which may be determined by sum of absolute difference (SAD), sum of squared difference (SSD), or other difference metrics. The reference sample may occur anywhere within a reference frame or reference slice, and not necessarily at a block (e.g., coding unit) boundary of the reference frame or slice. In some examples, the reference sample may occur at a fractional pixel position.

[0124] The motion estimation unit 42 sends the calculated motion vector to the entropy encoding unit 56 and the motion compensation unit 44. The portion of the reference frame identified by a motion vector may be referred to as a reference sample. The motion compensation unit 44 may calculate a prediction value for a prediction unit of a current CU, e.g., by retrieving the reference sample identified by a motion vector for the PU.

[0125] The intra-prediction module 46 may intra-predict the received block, as an alternative to inter-prediction performed by the motion estimation unit 42 and the motion compensation unit 44. The intra-prediction module 46 may predict the received block relative to neighboring, previously coded blocks, e.g., blocks above, above and to the right, above and to the left, or to the left of the current block, assuming a left-to- right, top-to-bottom encoding order for blocks. The intra-prediction module 46 may be configured with a variety of different intra-prediction modes. For example, the intra- prediction module 46 may be configured with a certain number of directional prediction modes, e.g., thirty- five directional prediction modes, based on the size of the CU being encoded.

[0126] The intra-prediction module 46 may select an intra-prediction mode by, for example, calculating error values for various intra-prediction modes and selecting a mode that yields the lowest error value. Directional prediction modes may include functions for combining values of spatially neighboring pixels and applying the combined values to one or more pixel positions in a PU. Once values for all pixel positions in the PU have been calculated, the intra-prediction module 46 may calculate an error value for the prediction mode based on pixel differences between the PU and the received block to be encoded. The intra-prediction module 46 may continue testing intra-prediction modes until an intra-prediction mode that yields an acceptable error value is discovered. The intra-prediction module 46 may then send the PU to the summer 50.

[0127] The video encoder 20 forms a residual block by subtracting the prediction data calculated by the motion compensation unit 44 or the intra-prediction module 46 from the original video block being coded. The summer 50 represents the component or components that perform this subtraction operation. The residual block may correspond to a two-dimensional matrix of pixel difference values, where the number of values in the residual block is the same as the number of pixels in the PU corresponding to the residual block. The values in the residual block may correspond to the differences, i.e., error, between values of co-located pixels in the PU and in the original block to be coded. The differences may be chroma or luma differences depending on the type of block that is coded.

[0128] The transform module 52 may form one or more transform units (TUs) from the residual block. The transform module 52 selects a transform from among a plurality of transforms. The transform may be selected based on one or more coding characteristics, such as block size, coding mode, or the like. The transform module 52 then applies the selected transform to the TU, producing a video block comprising a two-dimensional array of transform coefficients. The transform module 52 may signal the selected transform partition in the encoded video bitstream.

[0129] The transform module 52 may send the resulting transform coefficients to the quantization unit 54. The quantization unit 54 may then quantize the transform coefficients. The entropy encoding unit 56 may then perform a scan of the quantized transform coefficients in the matrix according to a scanning mode. This disclosure describes the entropy encoding unit 56 as performing the scan. However, it should be understood that, in other examples, other processing units, such as the quantization unit 54, could perform the scan.

[0130] Once the transform coefficients are scanned into the one-dimensional array, the entropy encoding unit 56 may apply entropy coding, such as CABAC.

[0131] To perform CABAC, the entropy encoding unit 56 may select a context model to apply to a certain context to encode symbols to be transmitted. The context may relate to, for example, whether neighboring values are non-zero or not. The entropy encoding unit 56 may also entropy encode syntax elements, such as the signal representative of the selected transform. In accordance with the techniques of this disclosure, the entropy encoding unit 56 may select the context model used to encode these syntax elements based on, for example, an intra-prediction direction for intra-prediction modes, a scan position of the coefficient corresponding to the syntax elements, block type, and/or transform type, among other factors used for context model selection.

[0132] Following the entropy coding by the entropy encoding unit 56, the resulting encoded video may be transmitted to another device, such as the video decoder 30, or archived for later transmission or retrieval.

[0133] In some cases, the entropy encoding unit 56 or another unit of the video encoder 20 may be configured to perform other coding functions, in addition to entropy coding. For example, the entropy encoding unit 56 may be configured to determine coded block pattern (CBP) values for CU's and PU's. Also, in some cases, the entropy encoding unit 56 may perform run length coding of coefficients.

[0134] The inverse quantization unit 58 and the inverse transform module 60 apply inverse quantization and inverse transformation, respectively, to reconstruct the residual block in the pixel domain, e.g., for later use as a reference block. The motion compensation unit 44 may calculate a reference block by adding the residual block to a predictive block of one of the frames of the reference frame buffer 64. The motion compensation unit 44 may also apply one or more interpolation filters to the reconstructed residual block to calculate sub-integer pixel values for use in motion estimation. The summer 62 adds the reconstructed residual block to the motion compensated prediction block produced by the motion compensation unit 44 to produce a reconstructed video block.

[0135] The loop filter unit 43 may then perform loop filtering on the reconstructed blocks in accordance with the techniques described above. In examples of the disclosure, loop filter unit 43, alone or together with other components of video encoder 20, may be configured to perform loop filtering in a video coding process.

[0136] After filtering the pixels, using the loop filtering techniques described in this disclosure, the filtered reconstructed video block is then stored in the reference frame buffer 64. The reconstructed video block may be used by the motion estimation unit 42 and the motion compensation unit 44 as a reference block to inter-code a block in a subsequent video frame.

[0137] FIG. 13 is a block diagram illustrating an example of a video decoder 30, which decodes an encoded video sequence. In the example of FIG. 13, the video decoder 30 includes an entropy decoding unit 70, a motion compensation unit 72, an intra- prediction module 74, an inverse quantization unit 76, an inverse transformation module 78, a reference frame buffer 82, a loop filter unit 79, and a summer 80. The video decoder 30 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to the video encoder 20 (see FIG. 12).

[0138] The entropy decoding unit 70 performs an entropy decoding process on the encoded bitstream to retrieve a one-dimensional array of transform coefficients. The entropy decoding process used depends on the entropy coding used by the video encoder 20 (e.g., CABAC). The entropy coding process used by the encoder may be signaled in the encoded bitstream or may be a predetermined process.

[0139] In some examples, the entropy decoding unit 70 (or the inverse quantization unit 76) may scan the received values using a scan mirroring the scanning mode used by the entropy encoding unit 56 (or the quantization unit 54) of the video encoder 20.

Although the scanning of coefficients may be performed in the inverse quantization unit 76, scanning will be described for purposes of illustration as being performed by the entropy decoding unit 70. In addition, although shown as separate functional units for ease of illustration, the structure and functionality of the entropy decoding unit 70, the inverse quantization unit 76, and other units of the video decoder 30 may be highly integrated with one another. [0140] The inverse quantization unit 76 inverse quantizes, i.e., de-quantizes, the quantized transform coefficients provided in the bitstream and decoded by the entropy decoding unit 70. The inverse quantization process may include a conventional process, e.g., similar to the processes proposed for HEVC or defined by the H.264 decoding standard. The inverse quantization process may include use of a quantization parameter QP calculated by the video encoder 20 for the CU to determine a degree of quantization and, likewise, a degree of inverse quantization that should be applied. The inverse quantization unit 76 may inverse quantize the transform coefficients either before or after the coefficients are converted from a one-dimensional array to a two-dimensional array.

[0141] The inverse transform module 78 applies an inverse transform to the inverse quantized transform coefficients. In some examples, the inverse transform module 78 may determine an inverse transform based on signaling from the video encoder 20, or by inferring the transform from one or more coding characteristics such as block size, coding mode, or the like. In some examples, the inverse transform module 78 may determine a transform to apply to the current block based on a signaled transform at the root node of a quadtree for an LCU including the current block. Alternatively, the transform may be signaled at the root of a TU quadtree for a leaf-node CU in the LCU quadtree. In some examples, the inverse transform module 78 may apply a cascaded inverse transform, in which inverse transform module 78 applies two or more inverse transforms to the transform coefficients of the current block being decoded.

[0142] The intra-prediction module 74 may generate prediction data for a current block of a current frame based on a signaled intra-prediction mode and data from previously decoded blocks of the current frame.

[0143] Based on the retrieved motion prediction direction, reference frame index, and calculated current motion vector, the motion compensation unit produces a motion compensated block for the current portion. These motion compensated blocks essentially recreate the predictive block used to produce the residual data.

[0144] The motion compensation unit 72 may produce the motion compensated blocks, possibly performing interpolation based on interpolation filters. Identifiers for interpolation filters to be used for motion estimation with sub-pixel precision may be included in the syntax elements. The motion compensation unit 72 may use

interpolation filters as used by the video encoder 20 during encoding of the video block to calculate interpolated values for sub-integer pixels of a reference block. The motion compensation unit 72 may determine the interpolation filters used by the video encoder 20 according to received syntax information and use the interpolation filters to produce predictive blocks.

[0145] Additionally, the motion compensation unit 72 and the intra-prediction module 74, in an HEVC example, may use some of the syntax information (e.g., provided by a quadtree) to determine sizes of LCUs used to encode frame(s) of the encoded video sequence. The motion compensation unit 72 and the intra-prediction module 74 may also use syntax information to determine split information that describes how each CU of a frame of the encoded video sequence is split (and likewise, how sub-CUs are split). The syntax information may also include modes indicating how each split is encoded (e.g., intra- or inter-prediction, and for intra-prediction an intra-prediction encoding mode), one or more reference frames (and/or reference lists containing identifiers for the reference frames) for each inter-encoded PU, and other information to decode the encoded video sequence.

[0146] The summer 80 combines the residual blocks with the corresponding prediction blocks generated by the motion compensation unit 72 or the intra-prediction module 74 to form decoded blocks. The loop filter unit 79 then performs loop filtering in accordance with the techniques described above.

[0147] In examples of the disclosure, loop filter unit 79, alone or together with other components of video decoder 30, may be configured to perform loop filtering in a video coding process. Loop filtering may include one or more of deblocking, ALF, and SAO filtering.

[0148] The decoded video blocks are then stored in the reference frame buffer 82, which provides reference blocks for subsequent motion compensation for inter- predictive coding and also produces decoded video for presentation on a display device (such as the display device 32 of FIG. 1).

[0149] FIG. 14 is a flowchart illustrating an example encoding method of the disclosure. The methods of FIG. 14 may be implemented by video encoder 20, including loop filter unit 43.

[0150] Video encoder 20 may be configured to encode a block of video data according to a scalable video coding process to produce an encoded block of video data (1401), decode the encoded block of video data to produce a reconstructed block of video data (1402), limit the application of a loop filter to the reconstructed block of video data based on the characteristics of the scalable video coding process (1403), and loop filter the reconstructed block of video data (1404).

[0151] In one example of the disclosure, video encoder 20 encodes the block of video data in a base layer using a constrained intra-prediction process, and the loop filter is a sample adaptive offset (SAO) filter. In one example, limiting the application of the SAO filter comprises applying the SAO filter to boundary pixels of the block of video data in the case that band offset SAO filtering is applied, and skipping applying the SAO filter to boundary pixels of the block of video data in the case that edge offset SAO filtering is applied and a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises skipping applying the SAO filter to boundary pixels of the block of video data in the case that a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises skipping applying the SAO filter to the block of video data in the case that a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises not signaling an SAO type in the case that the SAO type uses pixels from a neighboring block that is not intra-coded.

[0152] In another example of the disclosure, video encoder 20 encodes the block of video data using inter layer prediction, and the loop filter is a sample adaptive offset (SAO) filter. In one example, limiting the application of the SAO filter comprises applying the SAO filter to boundary pixels of the block of video data in the case that band offset SAO filtering is applied, and skipping applying the SAO filter to boundary pixels of the block of video data in the case that edge offset SAO filtering is applied and a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises skipping applying the SAO filter to boundary pixels of the block of video data in the case that a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises skipping applying the SAO filter to the block of video data in the case that a neighboring block is not intra- coded and in the case that the block of video data is coded using a constrained intra- prediction process. In another example, limiting the application of the SAO filter comprises not signaling an SAO type in the case that the SAO type uses pixels from a neighboring block that is not intra-coded.

[0153] In another example, video encoder 20 encodes the video data using inter layer prediction, and the loop filter is an adaptive loop filter (ALF). In one example, limiting the application of the ALF comprises applying a partial ALF to the block of video data in the case that a neighboring block is not intra-coded.

[0154] FIG. 15 is a flowchart illustrating an example decoding method of the disclosure. The methods of FIG. 15 may be implemented by video decoder 30, including loop filter unit 79.

[0155] Video decoder 30 may be configured to decode a block of video data according to a scalable video coding process to produce a reconstructed block of video data (1501), limit the application of a loop filter to the reconstructed block of video data based on the characteristics of the scalable video coding process (1502), and loop filter the reconstructed block of video data (1503).

[0156] In one example of the disclosure, video decoder 30 decodes the block of video data in a base layer using a constrained intra-prediction process, and the loop filter is a sample adaptive offset (SAO) filter. In one example, limiting the application of the SAO filter comprises applying the SAO filter to boundary pixels of the block of video data in the case that band offset SAO filtering is applied, and skipping applying the SAO filter to boundary pixels of the block of video data in the case that edge offset SAO filtering is applied and a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises skipping applying the SAO filter to boundary pixels of the block of video data in the case that a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises skipping applying the SAO filter to the block of video data in the case that a neighboring block is not intra-coded.

[0157] In another example of the disclosure, video decoder 30 decodes the block of video data using inter layer prediction, and the loop filter is a sample adaptive offset (SAO) filter. In one example, limiting the application of the SAO filter comprises applying the SAO filter to boundary pixels of the block of video data in the case that band offset SAO filtering is applied, and skipping applying the SAO filter to boundary pixels of the block of video data in the case that edge offset SAO filtering is applied and a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises skipping applying the SAO filter to boundary pixels of the block of video data in the case that a neighboring block is not intra-coded. In another example, limiting the application of the SAO filter comprises skipping applying the SAO filter to the block of video data in the case that a neighboring block is not intra- coded and in the case that the block of video data is coded using a constrained intra- prediction process.

[0158] In another example, video decoder 30 decodes the video data using inter layer prediction, and the loop filter is an adaptive loop filter (ALF). In one example, limiting the application of the ALF comprises applying a partial ALF to the block of video data in the case that a neighboring block is not intra-coded.

[0159] In one or more examples, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over, as one or more instructions or code, a computer-readable medium and executed by a hardware-based processing unit.

Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer- readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium.

[0160] By way of example, and not limitation, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. It should be understood, however, that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transient media, but are instead directed to non-transient, tangible storage media. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

[0161] Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry. Accordingly, the term "processor," as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.

[0162] The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set). Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.

[0163] Various examples have been described. These and other examples are within the scope of the following claims.