Abstract: This disclosure describes techniques for performing semi-global matching (SGM) path cost compression. In some examples, the techniques may perform disparity-dependent sub-sampling of a set of SGM path costs where the sub-sampling ratio is determined based on a candidate disparity level. The sub-sampled SGM path costs may be stored in a memory. When retrieved from memory, the sub-sampled SGM path costs may be interpolated to reconstruct the other path costs not stored in the memory. The reconstructed path costs may be used for further SGM processing. In further examples, the techniques may perform disparity-dependent quantization on the SGM path costs or the sub-sampled SGM path costs, and store the quantized SGM path costs in memory. The techniques of this disclosure may reduce bandwidth as well as reduce the memory footprint needed to implement an SGM algorithm.

Abstract: This disclosure describes techniques for performing semi-global matching (SGM) path cost compression. In some examples, the techniques may perform disparity-dependent sub-sampling of a set of SGM path costs where the sub-sampling ratio is determined based on a candidate disparity level. The sub-sampled SGM path costs may be stored in a memory. When retrieved from memory, the sub-sampled SGM path costs may be interpolated to reconstruct the other path costs not stored in the memory. The reconstructed path costs may be used for further SGM processing. In further examples, the techniques may perform disparity-dependent quantization on the SGM path costs or the sub-sampled SGM path costs, and store the quantized SGM path costs in memory. The techniques of this disclosure may reduce bandwidth as well as reduce the memory footprint needed to implement an SGM algorithm.

Abstract: This disclosure describes techniques for performing semi-global matching (SGM) path cost compression. In some examples, the techniques may perform disparity-dependent sub-sampling of a set of SGM path costs where the sub-sampling ratio is determined based on a candidate disparity level. The sub-sampled SGM path costs may be stored in a memory. When retrieved from memory, the sub-sampled SGM path costs may be interpolated to reconstruct the other path costs not stored in the memory. The reconstructed path costs may be used for further SGM processing. In further examples, the techniques may perform disparity-dependent quantization on the SGM path costs or the sub-sampled SGM path costs, and store the quantized SGM path costs in memory. The techniques of this disclosure may reduce bandwidth as well as reduce the memory footprint needed to implement an SGM algorithm.

Abstract: This disclosure describes techniques for performing semi-global matching (SGM) path cost compression. In some examples, the techniques may perform disparity-dependent sub-sampling of a set of SGM path costs where the sub-sampling ratio is determined based on a candidate disparity level. The sub-sampled SGM path costs may be stored in a memory. When retrieved from memory, the sub-sampled SGM path costs may be interpolated to reconstruct the other path costs not stored in the memory. The reconstructed path costs may be used for further SGM processing. In further examples, the techniques may perform disparity-dependent quantization on the SGM path costs or the sub-sampled SGM path costs, and store the quantized SGM path costs in memory. The techniques of this disclosure may reduce bandwidth as well as reduce the memory footprint needed to implement an SGM algorithm.

Abstract: This disclosure describes techniques for performing semi-global matching (SGM) path cost compression. In some examples, the techniques may perform disparity-dependent sub-sampling of a set of SGM path costs where the sub-sampling ratio is determined based on a candidate disparity level. The sub-sampled SGM path costs may be stored in a memory. When retrieved from memory, the sub-sampled SGM path costs may be interpolated to reconstruct the other path costs not stored in the memory. The reconstructed path costs may be used for further SGM processing. In further examples, the techniques may perform disparity-dependent quantization on the SGM path costs or the sub-sampled SGM path costs, and store the quantized SGM path costs in memory. The techniques of this disclosure may reduce bandwidth as well as reduce the memory footprint needed to implement an SGM algorithm.

Abstract: Apparatus and methods for disparity cost computation for a stereoscopic image. In an example, a method includes computing partial path matching costs for multiple disparities of pixels of multiple parallelogram blocks of an image in a forward pass direction. Between computing the partial path matching costs of the pixels of adjacent parallelogram blocks, the method includes computing partial path matching costs for the plurality of disparities of pixels along a boundary edge of a corresponding rectangular tile using paths that are external to the rectangular tile and computing partial path matching costs the disparities for all of the pixels of the corresponding rectangular tile. The method also includes computing total aggregated disparity costs for each disparity of the pixels of the image using the partial path matching costs computed for the pixels in the parallelogram blocks and in the rectangular tiles.

Abstract: Apparatus and methods for disparity cost computation for a stereoscopic image. In an example, a method includes computing partial path matching costs for multiple disparities of pixels of multiple parallelogram blocks of an image in a forward pass direction. Between computing the partial path matching costs of the pixels of adjacent parallelogram blocks, the method includes computing partial path matching costs for the plurality of disparities of pixels along a boundary edge of a corresponding rectangular tile using paths that are external to the rectangular tile and computing partial path matching costs the disparities for all of the pixels of the corresponding rectangular tile. The method also includes computing total aggregated disparity costs for each disparity of the pixels of the image using the partial path matching costs computed for the pixels in the parallelogram blocks and in the rectangular tiles.

Abstract: This disclosure describes techniques for performing semi-global matching (SGM) path cost compression. In some examples, the techniques may perform disparity-dependent sub-sampling of a set of SGM path costs where the sub-sampling ratio is determined based on a candidate disparity level. The sub-sampled SGM path costs may be stored in a memory. When retrieved from memory, the sub-sampled SGM path costs may be interpolated to reconstruct the other path costs not stored in the memory. The reconstructed path costs may be used for further SGM processing. In further examples, the techniques may perform disparity-dependent quantization on the SGM path costs or the sub-sampled SGM path costs, and store the quantized SGM path costs in memory. The techniques of this disclosure may reduce bandwidth as well as reduce the memory footprint needed to implement an SGM algorithm.

Abstract: A method of image compression with wavelet transforms applied locally rather than globally by image component partitioning into independently transformed macroblocks plus overlapping data for filter length compensation.

Abstract: The present application describes a system and method for handling an incoming call in a communication device. An incoming call hold feature allows a user to place an incoming call on hold without answering the incoming call. When the incoming call hold feature is activated, the incoming call is placed on hold before the user is alerted about the incoming call. When the user wants to answer the incoming call, the user can activate the incoming call and talk to the caller. Further, the incoming call hold feature allows the caller to transfer the incoming call to the user's voicemail.