Search arXivSearch

arXiv · 1504.01000

Modifying the Yamaguchi Four-Component Decomposition Scattering Powers Using a Stochastic Distance

Abstract

Model-based decompositions have gained considerable attention after the initial work of Freeman and Durden. This decomposition which assumes the target to be reflection symmetric was later relaxed in the Yamaguchi et al. decomposition with the addition of the helix parameter. Since then many decomposition have been proposed where either the scattering model was modified to fit the data or the coherency matrix representing the second order statistics of the full polarimetric data is rotated to fit the scattering model. In this paper we propose to modify the Yamaguchi four-component decomposition (Y4O) scattering powers using the concept of statistical information theory for matrices. In order to achieve this modification we propose a method to estimate the polarization orientation angle (OA) from full-polarimetric SAR images using the Hellinger distance. In this method, the OA is estimated by maximizing the Hellinger distance between the un-rotated and the rotated $T_{33}$ and the $T_{22}$ components of the coherency matrix $\mathbf{[T]}$. Then, the powers of the Yamaguchi four-component model-based decomposition (Y4O) are modified using the maximum relative stochastic distance between the $T_{33}$ and the $T_{22}$ components of the coherency matrix at the estimated OA. The results show that the overall double-bounce powers over rotated urban areas have significantly improved with the reduction of volume powers. The percentage of pixels with negative powers have also decreased from the Y4O decomposition. The proposed method is both qualitatively and quantitatively compared with the results obtained from the Y4O and the Y4R decompositions for a Radarsat-2 C-band San-Francisco dataset and an UAVSAR L-band Hayward dataset.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Avik Bhattacharya, Arnab Muhuri, Shaunak De, Surendar Manickam, Alejandro C. Frery. 2015-04-04. Modifying the Yamaguchi Four-Component Decomposition Scattering Powers Using a Stochastic Distance. https://doi.org/10.1109/jstars.2015.2420683

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT