Edge Detection Methods Based on Modified Differential Phase Congruency of Monogenic Signal
Abstract
Monogenic signal is regarded as a generalization of analytic signal from one dimensional to higher dimensional space, which has been received considerable attention in the literature. It is defined by an original signal with its isotropic Hilbert transform (the combination of Riesz transform). Like the analytic signal, monogenic signal can be written in the polar form. Then it provides the signal features representation, such as the local attenuation and the local phase vector. The aim of the paper is twofold: first, to analyze the relationship between the local phase vector and the local attenuation in the higher dimensional spaces. Secondly, a study on image edge detection using modified differential phase congruency is presented. Comparisons with competing methods on real-world images consistently show the superiority of the proposed methods.
keywords:
Hilbert transform; Phase space, Poisson operatorAMS Mathematical Subject Classification: 44A15; 70G10; 35105
1 Introduction
In the scale-space literature, there are a lot of papers discussing Gaussian scale-space as the only linear scale-space [3, 14, 15]. The Gaussian scale space is obtained as the solution of the heat equation. In [11], M. Felsberg and G. Sommer proposed a new linear scale-space which is generated by the Poisson kernel, it is the so-called Poisson scale-space in two-dimensional (2D) spaces.
The Poisson scale-space is obtained by Poisson filtering (the convolution of the original signal and the Poisson kernel). The harmonic conjugate (the convolution of the original signal and the conjugate Poisson kernel) yields the corresponding figure flow at all scales. The Poisson scale-space and its corresponding figure flow form the monogenic scale-space [11]. In mathematics, monogenic scale-space is the Hardy space in the upper half complex plane. The boundary value of a monogenic function in the upper half space is the monogenic signal. The monogenic scale signal gives deeper insight to low level image processing.
Monogenic signal is regarded as a generalization of analytic signal from one dimensional space to higher dimensional case, which is first studied by M. Felsberg and G. Sommer in 2001 [10]. It is defined by an original signal with its Riesz transform in higher dimensions. Under certain assumptions, monogenic function can be representation in the polar form and then it provides the signal features, such as the local attenuation and the local phase vector [10, 21, 20, 8]. In [21], we first defined the scalar-valued phase derivative (local frequency) of a multivariate signal in higher dimensions. Then we studied the applications in signal processing [20, 19, 24, 25, 26].
Monogenic signals at any scale form monogenic scale-space. The representation of monogenic scale-space is just a monogenic function in the upper half-space. Therefore, considering the monogenic scale space with scale instead of monogenic signals, provides us more analysis tools. In the monogenic scale-space, the important features in image processing, such as local phase-vector, and local attenuation (the log of local amplitude) involving through scale are given in [11]. The relationship between the local attenuation and the local phase in the intrinsically 1D cases are derived in [11]. However, the problem is open if the signal is not intrinsically 1D signal.
The contributions of this paper are summarized as follows.
-
1.
We give the solution of the problem: if the higher dimensional signal is not intrinsically 1D signal, we derive the relationship between the local phase-vector and and local attenuation.
-
2.
We proposed the local attenuation (LA) method for edge detection operator. We establish the theoretical and experiment results on the newly methods.
-
3.
We proposed the modified differential phase congruency (MDPC) method for the edge detection operator. We establish the theoretical and experiment results on the newly methods.
-
4.
We show that in higher dimensional space, the instantaneous frequency in higher dimensional spaces defined by is equal to the minus of the scale derivative of the local attenuation.
-
5.
We show that the zero points of the differential phase congruency is not equal to the extrema of the local attenuation. The nonzero extra term
appears in high dimensional cases.
The rest of this paper is organized as follows. In order to make it self-contained, Section 2 gives a brief introduction to some general definitions and basic properties of Hardy space, analytic signal, Clifford algebra, monogenic signal and monogenic scale space. In Section 3 we derive the relationship between the local phase-vector and and local attenuation. Various edge detection methods are provided in Section 4. Finally, experiment results are drawn in Section 5.
2 Preliminaries
In the present section, we begin by reviewing some definitions and basic properties of analytic signal and Hardy space [5, 12, 13].
2.1 Analytic Signal and Hardy Space
Definition 2.1 (Analytic Signal).
For a square integrable real-valued function , the complex-valued signal whose imaginary part is the Hilbert transform of its real part is called the analytic signal. That is,
where is the Hilbert transform (HT) of defined by
provided this integral exists as a principal value ( means the Cauchy principle value).
Due to its definition, the real and imaginary parts of analytic signal form the Hilbert transform pairs
(1) |
To proceed the properties of analytic signal, we introduce the notion of Hardy space [12, 13], we will notice that the class of analytic signals is the class of boundary values of Hardy space functions.
Definition 2.2 (Hardy Space).
The Hardy space is the class of analytic functions on the upper half complex plane which satisfies the growth condition
for all .
Important properties of Hardy functions are given by Titchmarsh’s Theorem [16].
Theorem 2.1 (Titchmarsh’s Theorem).
Let . Then the following two assertions are equivalent:
-
1.
The Hardy function has no negative-frequency components. That is,
where is the Fourier transform of .
-
2.
The real and imaginary parts verify the formulas:
and
for all , where and are the Poisson and conjugate Poisson kernel in .
In this way, an analytic signal represents the boundary values of Hardy function in the upper half plane [12]. That is,
and
Starting from this concept we are going to study the higher dimensional generalization on Clifford algebra.
2.2 Clifford Algebra
For all what follows we will work in , the real Clifford algebra. Most of the basic knowledge and notations in relation to Clifford algebra are referred to [2, 7]. Let be basic elements satisfying , where if and otherwise, The Clifford algebra is the associative algebra over the real field . A general element in , therefore, is of the form , where and runs over all the ordered subsets of namely
Let
be identical with the usual Euclidean space and an element in is called a vector. Moreover, let
be the para-vector space and an element in is called a para-vector. The multiplication of two para-vectors and is given by with and Clearly, we have
(2) |
and
There are three parts of . We denote them as follows
-
1.
the scalar part: ,
-
2.
the vector part : ,
-
3.
the bi-vector part : .
In particular, we have .
The conjugation and reversion of are defined by and , respectively. Therefore, the Clifford conjugate of a para-vector is . It is easy to verify that implies
The open ball with center and radius in is denoted by and the unit sphere in is denoted by .
The natural inner product between and in is defined by where and . The norm associated with this inner product is defined by
Let be an open subset of with a piecewise smooth boundary. We say that function defined on such that is a Clifford-valued function or, briefly, a -valued function, where are real-valued functions defined in .
A possibility to generalize complex analytic is offered by following the Riemann approach, which is introduced by means of the generalized Cauchy-Riemann operator , where is the Dirac operator. Nullsolutions to this operator provide us with the class of the so-called monogenic functions.
Definition 2.3.
(Monogenic Function) An -valued function is called left (resp. right) monogenic in if (resp. ) in .
In the following, let
be the Cauchy kernel defined in . It is easy to verify that is a monogenic function in [2, 7].
Remark 2.1.
-
1.
For a -valued function defined on an open subset of , we apply the Dirac operator for the monogenic function.
-
2.
Throughout the paper, and unless otherwise stated, we only use left -valued monogenic functions that, for simplicity, we call monoginic. Nevertheless, all results accomplished to left -valued monogenic functions can be easily adapted to right -valued monogenic functions.
We further introduce the right linear Hilbert space of integrable and square integrable -valued functions in that we denote by and , respectively. If , the Fourier transform of is defined by
(3) |
if in addition, , then function can be recovered by the inverse Fourier transform
The well-known Plancherel Theorem for Fourier transform of and holds
In a recent paper [10], the authors defined the notion of the monogenic signal. It is regarded as an extension of the notion of the analytic signal to multidimensional signals.
2.3 Monogenic Signal and Monogenic Scale Space
The monogenic signal was defined by an original signal and its ”isotropic Hilbert transform” in the higher dimensional spaces (a combination of the Riesz transforms).
Definition 2.4 (Monogenic Signal).
For , the monogenic signal is defined by
where is the isotropic Hilbert transform of defined by
Furthermore,
is the jth-Reisz transform of and is the area of the unit sphere in .
Remark 2.2.
If is real-valued, then by Definition 2.4, is vector-valued.
Let us now generalize the notion of Hardy space to multidimensional space.
Definition 2.5 (Monogenic Scale Space).
The monogenic scale space is the class of monogenic functions defined on half space
which satisfies the growth condition
for all scale .
Like in the complex case, a monogenic signal is the boundary value of the monogenic scale function in the half space [4]. Some basic properties of the Monogenic scale space in the half space are summarized as follows. For the proof of Theorem 2.2 we refer the reader to [4] and [17].
Theorem 2.2.
Suppose . Then the following two assertions are equivalent:
-
1.
The inverse Fourier transform of vanishes for . That is, the -valued function has the form
in the half space , where
is monogenic in and is the Fourier transform of given by (3).
-
2.
The functions and are constructed by the Poisson and the conjugate Poisson integrals, respectively. That is,
(4) and
(5) where and are the Poisson and the conjugate Poisson kernel in , respectively.
3 Local Attenuation and Local Phase Vector
Note that it is possible to write the monogenic scale function in polar coordinate. Let us review the local feature [21] as follows.
Definition 3.1 (Local Features Representation I).
Suppose has the polar form
(6) |
then
(7) |
is is called the local amplitude.
(8) |
is called the phase angle that is between and .
(9) |
is called the local phase vector. is called the directional phase derivative and is called the phase direction. The phase derivative or instantaneous frequency is defined by
(10) |
Building on the ideas of [11], we can have the alternative form.
Definition 3.2 (Local Features Representation II).
For nontrivial function , the local amplitude is nonzero. We can rewrite (6) as
(11) |
where
(12) |
is called the local attenuation.
Remark 3.1.
In one-dimensional case, therefore the local phase vector .
Suppose has the form (11). That is, has no zeros and isolated singularities in the half plane , then the local attenuation and the local phase are related by the Cauchy-Riemann system. The reason is that the composition of analytic function is analytic. If is analytic and has no zeros and isolated singularities in the half plane , then is also analytic in .
Using the Cauchy-Riemann system for , we have
From the above system, we notice that:
-
1.
The instantaneous frequency can be obtained by the minus of the scale derivative of the local attenuation .
-
2.
The zero points of the scale derivative of the local phase is given by the extrema of the local attenuation.
Building on the ideas of 1D, the authors [11] considered the intrinsically 1D monogenic signals.
Definition 3.3.
If has no zeros and isolated singularities in the half plane , then the intrinsically 1D monogenic signal is defined by
(13) | |||||
where and is a fixed unit vector. The local attenuation is given by and the local phase vector is given by for intrinsically 1D signal.
Felsberg et al. [11] proved that for the intrinsically 1D signals, the local attenuation and the local phase-vector are related by the Hilbert transform pairs (1). Moreover, by the analyticity, using the generalized Cauchy-Riemann operator on , we have
(14) |
(15) |
In [11], the local frequency of the intrinsically 1D signal and the differential phase congruency are defined by and , receptively. From system (14) and (15), we notice that:
-
1.
The local frequency in an intrinsically 1D signal can also be obtained by the minus of the scale derivative of the local attenuation .
-
2.
The zero points of the differential phase congruency is given by the extrema of the local attenuation.
Remark 3.2.
In the recent paper [21], the instantaneous frequency of is given by (10)
(16) | |||||
In particular, if is a constant, the first term in (16) vanishes, then the instantaneous frequency is . It coincides with the local frequency defined in [11]. That is, when is a constant, the local frequency is given by .
Remark 3.3.
-
1.
In Clifford analysis [7], we notice that if , then for fixed unit vector , the function
is monogenic in . It is called monogenic plane wave.
-
2.
Clearly, if has no zeros and isolated singularities in , then is also analytic in . Consequently, the function is monogenic in .
Problem 3.1.
What is the situation in the higher dimension if the signal is not intrinsically 1D signal?
The solution was not considered in [11] and [9]. While in higher dimension, the situation is more complicated. The theory does not hold in general. In fact, if is monogenic in the half space , is not monogenic in general. Therefore, the local attenuation and the local phase vector are not related by the generalized Cauchy-Riemann system in higher dimensions. Let us now look at an example to illustrate the topic discussed above.
Example 3.1.
Let be the Cauchy kernel in , which is monogenic in . Then, by straightforward computations, we have
Then we apply the generalized Cauchy-Riemann operator on it, we have
Therefore, is not monogenic.
Let us now describe the solution for Problem 3.1, Theorem 3.1 gives the relationship between the local phase vector and the local attenuation in higher dimensional spaces.
Theorem 3.1.
In particular, if is independent of , that is , then we have the following corollary.
Corollary 3.1.
Theorem 3.2.
[Instantaneous Frequency]
-
1.
The instantaneous frequency in higher dimensional spaces defined by (10) is equal to the minus of the scale derivative of the local attenuation .
-
2.
The zero points of the differential phase congruency is not equal to the extrema of the local attenuation.
Remark 3.4.
By Theorem 3.2, we notice that, like in one dimensional case, the phase derivative in higher dimensions can also be given by the minus of the scale derivative of the local attenuation. However, the zero points of the phase congruency is not equal to the extrema of the local attenuation in high dimensional case. The nonzero extra term
appears in high dimensional cases.
We have divided the proof of Theorem 3.1 into a series of lemmas.
Lemma 3.1.
Proof: By the generalized Euler formula , we have
(21) | |||||
Clearly, the scalar part of is decided by the third part of equation (21). Let us now prove the following
Denote , we have . Then . By equation (2), we have
Thus, we obtain the desired result.
Lemma 3.2.
Proof: From (21), we know that the vector part of is decided by . Since , we have
Therefore, we obtain equation (22).
To prove equation (23), by direct calculation, we have
(24) | |||||
The fist part and the second part of equation (24) are scalar and bi-vector, respectively. Therefore the vector part of is decided by the third part of equation (24). Thus we obtain (23).
We can now prove Theorem 3.1.
Proof of Theorem 3.1: Since , we have
By straightforward computation, we have
That is
(25) |
Therefore, the scalar part of (25) is zero. By combining Lemma 3.1, we have
Therefore, we get the desired result (17).
If has the axial form
Then, in this case, the local orientation does not change through the scale . By polar coordinate, , using Theorem 3.1, we have the following corollary.
Corollary 3.2.
Let . Then we have
(28) |
(29) |
4 Edge Detection Methods
Edge detection by means of quadrature filters has two ways: either by detecting local maxima of the local amplitude or by detecting points of stationary phase in scale-space. In this section, we begin by reviewing the differential phase congruency method [11].
4.1 Differential Phase Congruency Methods
Method 4.1 (DPC).
For intrinsically 1D monogenic signal given by (13), if has no zero and isolated singularities in the half plane . Then the differential phase congruency (DPC) has the following formula
(30) |
where .
4.2 Proposed Methods
Let’s introduce the local attenuation (LA) method for monogenic signals.
Method 4.2 (LA).
For has no zeros and isolated singularities in the half space , the local attenuation has the formula
(31) |
Applying Dirac operator on the local attenuation , by direct computation on (7), formula (31) follows. Using (15), we know that for intrinsically 1D signals, the zero points of the differential phase congruency is given by the extrema of the local attenuation. Notice that formula (31) is equivalent to (30) for the intrinsically 1D monogenic signal.
Our second method is the modified differential phase congruency (MDPC) method. To proceed, we need the following technical lemma.
Lemma 4.1.
(32) |
Proof: By Eq. (9), we have
(33) |
By straightforward computation, we have
(34) |
Then,
(35) |
Using the equation
we obtain
(36) |
Applying Eq. (36) to Eq. (35), we have
(37) |
Remark 4.1.
Let us now define the points of modified differential phase congruency.
Definition 4.1.
Let be the local phase vector, given by (9), of function . Points where
are called points of modified differential phase congruency (MDPC).
Remark 4.2.
From Theorem 3.1 we know that in any higher dimensional cases, edge detection by means of local amplitude maxima is equivalent to edge detection by modified differential phase congruency.
Using Eq. (32), we can now proposed our second method, the so-called modified differential phase congruency (MDPC) method.
Method 4.3 (MDPC).
For has no zeros and isolated singularities in the half space , the MDPC has the formula
(38) | |||||
Finally, we introduce a mixed method by combining local attenuation and modified differential phase congruency (LA+MDPC) for edge detection.
Method 4.4 (LA+MDPC).
For has no zeros and isolated singularities in the half space , the MDPC has the formula
(39) | |||||
5 Experiments
In this section, we begin by showing the details of our proposed methods. Two classical edge detection methods, such as Canny and Sobel edge detectors, will be compared with our algorithms. The Canny edge detector will begin by applying Gaussian filter to the test images. Then Canny edge detector computes the gradients on the images. For the Sobel edge detector, we only apply its gradients to the original test images. For the DPC and our proposed methods, we first apply the Poisson filter to the test images, then we compute apply their formulas to the images.
By comparing with the classical methods, phased based methods may show more detail on image.

5.1 Algorithms
Let us now give the details of the phase based algorithms. They are divided by the following steps.
- Step 1.
-
Input image . For simplicity, the color image is converted to the gray image.
- Step 2.
-
Poisson filtering: and and for a fixed scale . We will discuss how to choose in Section LABEL:5.1. We consider in , , and . Moreover, we choose for all test images to compare with different methods.
- Step 3.
-
Compute the local attenuation and local phase vector , where the phase angle is given by .
- Step 4.
-
Compute gradients by different methods to get the gradient maps.
-
1.
The differential phase congruency (DPC) method: compute by the formula
-
2.
The local amplitude (LA) method: compute , where is the sum for the derivatives of image in vertical and horizontal directions. By theoretical analysis, can be computed by
-
3.
The modified differential phase congruency (MDPC) method: compute , which equals to
-
4.
The mixed method by using local attenuation and modified differential phase congruency (LA+MDCP): compute
-
1.
- Step 5.
-
Applying Non-maximum suppress to these gradient maps, which is the same as for the Canny edge detector. After non-maximum suppression, the edge will become thinner [22, 23]. For a fair comparison, all the six methods aforementioned utilize the non-maximum suppression method with the same parameters. Concretely, we choose the radius and the lower and upper threshold values are and , respectively.

5.2 Experiment Results
We will use three different images (Fig. 1) for the comparison of different edge detectors. Fig. 3 shows the edge detection results of various methods with the fixed scale . From top to down of Fig. 2, there are six rows. Each row shows one comparison method. They are Canny, Sobel, DPC, LA, MDPC and LA+MDPC methods, respectively. From the experiment results, we can draw the following conclusions.
-
1.
First, the mixed method yields decent edge detection results with fewer mistakes, outperforming other algorithms in some cases.
-
2.
Second, the comparison between the results of LA, DPC, MDPC and the mixed methods also suggest that both local attenuation and local phase are important in edge detection.
-
3.
Our proposed method MDPC can achieve very good performances in dealing with the details. For the pepper in Fig. 2, we found that our method and canny’s results are similar, we can find the edge of pepper in the results. However, for the shadows of the house and liver in Fig. 2, where the human eye is relatively subtle. Fortulately, the DPC and MDPC methods have found the details in the shadow. However, Canny, Sobel and LA methods cannot give the information about the shadows. Canny uses the Gaussian filter which will make part of these shadows as noise and removed them. While Sobel directly generate the horizontal and vertical differences, because the shadows and the surrounding area is not much difference, which may not find the shadow of the image. By applying the phase based method, these details can be clearly found in our experiment results. This shows that our method can detect the whole smooth region and local small change region. Applications can be useful in places where it is difficult for the human eye to find the details.
Remark 5.1.
For intrinsically 1D signals, we know that edge detection by means of local amplitude maxima is equivalent to edge detection by phase congruency. While, in intrinsically 2D signals, we know that it dose not hold. In [11], the authors said: We cannot give an exhaustive answer to this question. In this paper, since the behavior of phase and attenuation in intrinsically 2D neighborhoods is still work in progress.” From Eq. (38), we know that difference between the DPC and MDPC methods is . By experiment, we know that the effect is not obvious.
5.3 Effect of Scale

Monogenic signals at any scale form the monogenic scale-space . The representation of monogenic scale-space is just a monogenic function in the upper half space . Therefore, considering the monogenic scale space instead of monogenic signal, it has a scale parameter to choose which provides us more analysis tools for different purposes.
We found that when tends to , the Poisson integral tends to Hilbert transform. Moreover, in the paper [18], Hilbert transform has been proved to be useful for image edge extraction. In the choice of scale, we compare from to , as can be seen in Fig. 2, when is smaller, the edge is more fine. But too much detail is not good at all, so in the comparative experiment in Fig. 3, we chose the case of 0.5 for to compare with the various methods.
6 Acknowledgements
The authors acknowledge financial support from the National Natural Science Funds (No. 11401606) and University of Macau No. MYRG2015-00058-L2-FST and the Macao Science and Technology Development Fund FDCT/099/2012/A3.
References
References
- [1] T. Alieva and M.J. Bastiaans. Powers of transfer matrices determined by means of eigenfunctions, J. Opt. Soc. Amer. A, 16(10): 2413-2418 (1999).
- [2] F. Brackx, R. Delanghe, and F. Sommen. Clifford Analysis, Pitman 76, Boston-London-Melbourne, 1982.
- [3] J. Babaud, A. P. Witkin, M. Baudin, and R. O. Duda. Uniqueness of the Gaussian kernel for scale-space filtering, IEEE Trans. on Pattern Analysis and Machine Intelligence, 8(1): 26-33 (1986).
- [4] C. Li, A. Mcintosh, and T. Qian. Clifford algebras, Fourier transforms, and singular convolution operators on Lipschitz surfaces, Rev. Mat. Iberoamericana, 10: 665-721 (1994).
- [5] L. Cohen. Time-Frequency Analysis: Theory and Applications, Prentice Hall, Inc. Upper Saddle River, NJ, USA, 1995.
- [6] P. Dang, T. Qian, and Z. You, Hardy-Sobolev spaces decomposition in signal analysis, J. Fourier Anal. Appl. , 17(1): 36-64 (2011).
- [7] R. Delanghe, F. Sommen, and V. Soucek. Clifford Algebra and Spinor Valued Functions, Kluwer, Dordrecht-Boston-London, 1992.
- [8] M. Felsberg. Low-level Image Prossing with the Structure Multivector, Institut Fur Informatik Und Praktische Mathmatik, Christian-Alberchis-Universitat Kiel, 2002.
- [9] M. Felsberg, R. Duits, and L. Florack. The Monogenic Scale Space on a Rectanular Domain and it Features, Internertional Journal of Computer Vision, 64(2/3): 187-201 (2005).
- [10] M. Felsberg and G. Sommer. The monogenic signal, IEEE Transactions on Signal Processing, 49(12): 3136-3144 (2001).
- [11] M. Felsberg and G. Sommer. The Monogenic Scale-Space: A Unifying Approach to Phase-Based Image Processing in Scale-Space, Journal of Mathematical Imaging and Vision, 21(1): 5-26 (2004).
- [12] J. Garnet. Bounded Analytic Functions, Academic Press, New York, 1981.
- [13] S. L. Hahn. Hilbert Transforms in Signal Processing, Artech House, Norwood, MD, 1996.
- [14] T. Iijima. Basic theory of pattern obsercation, In Papers of Technical Group on Automata and Automatic Control, IECE, Japan, (1959).
- [15] T. Lindeberg. Scale-Space Theory in Computer Vision, The Kluwer International Series in Engeneering and Computer Science. Kluwer Academic Publishers, Boston, 1994.
- [16] Nussenzveig, H. M. Causality and dispersion relations, London: Academic Press.
- [17] K-I. Kou and T. Qian. The Paley-Wiener Theorem in with the Clifford Analysis Setting, Journal of Functional Analysis, 189: 227-241 (2002).
- [18] S. Pei, J. Huang, J. Ding, and G. Guo. Short response Hilbert transform for edge detection, IEEE Asia Pacific Conference on Circuits and Systems, 340-343 (2008).
- [19] Y. Yang and K-I. Kou. Uncertainty principles for hypercomplex signals in the linear canonical transform domains, Signal Processing, 95: 67-75 (2014).
- [20] Y. Yang, P. Dang, and T. Qian. Space-Frequency Analysis in Higher Dimensions and Applications, Annali di Mathematica, 194(4): 953-968 (2015).
- [21] Y. Yang, T. Qian, and F. Sommen. Phase derivative of monogenic functions in higher dimensional spaces, Complex Analysis and Operator Theory, 6(5): 987-1010 (2012).
- [22] P. Kovesi. Image Features From Phase Congruency, Videre: A Journal of Computer Vision Research. MIT Press, 1(3):1-30 (1999).
- [23] P. Kovesi. Phase Congruency Detects Corners and Edges, Proceedings DICTA, (2013).
- [24] L. Zhang, W. Zuo and D. Zhang. LSDT: Latent Sparse Domain Transfer Learning for Visual Adaptation, IEEE Trans. Image Processing, 25(3): 247-259 (2016).
- [25] L. Zhang and D. Zhang. Visual Understanding via Multi-Feature Shared Learning with Global Consistency, IEEE Trans. Multimedia, 18(2): 247-259 (2016).
- [26] L. Zhang and D. Zhang. Robust Visual Knowledge Transfer via Extreme Learning Machine-Based Domain Adaptation, IEEE Trans. Image Processing, 25(10): 4959-4973 (2016).