2016
DOI: 10.1049/iet-ipr.2015.0559
|View full text |Cite
|
Sign up to set email alerts
|

Saliency histogram equalisation and its application to image resizing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
45
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(45 citation statements)
references
References 23 publications
0
45
0
Order By: Relevance
“…Pixels with great saliency values are often in the ROI, which need to be preserved as much as possible; on the other hand, those with small saliency values in the region of non‐interest (RON) can be ignored in the retargeted images/videos. This section reviews the SC algorithm [2] that is representative of the discrete approach, the SHE algorithm [13] that is classified into the continuous approach, and the improved SHE algorithm by combining SHE with SC [18].…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…Pixels with great saliency values are often in the ROI, which need to be preserved as much as possible; on the other hand, those with small saliency values in the region of non‐interest (RON) can be ignored in the retargeted images/videos. This section reviews the SC algorithm [2] that is representative of the discrete approach, the SHE algorithm [13] that is classified into the continuous approach, and the improved SHE algorithm by combining SHE with SC [18].…”
Section: Related Workmentioning
confidence: 99%
“…In the continuous approach, both of the original and the retargeted images are represented by mesh grids. Based on the SH of an image, which shows the occurrence of salient objects, the SHE algorithm had been proposed to construct a non‐uniform mesh for the original image [13]. Specifically, the marginal SH (MSH) obtained by pyfalse(yfalse)=x=1Mp(x,y)x=1Mfalse∑y=1Npfalse(x,yfalse);y1,Nis used to partition an M×N image, I , into L vertical strips with an equal accumulated amount of saliency values as follows: vn=argmaxkn1L<false∑y=1kpyfalse(yfalse)nLwhere pfalse(x,yfalse) is the SH of I , and vn is the coordinate of the lower‐right vertex of the n th vertical strip in the y ‐direction, n=1,,L, with the boundary condition vL=N.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations