Local ternary patterns: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 07:54, 3 January 2023 edit Citation bot (talk \| contribs) Bots 5,865,322 edits Alter: url. URLs might have been anonymized. Add: s2cid, bibcode, pmid, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by SemperIocundus \| #UCB_webform 446/2500 ← Previous edit		Latest revision as of 20:12, 26 August 2025 edit undo Citation bot (talk \| contribs) Bots 5,865,322 edits Added bibcode. Removed URL that duplicated identifier. \| Use this bot. Report bugs. \| Suggested by Headbomb \| Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox \| #UCB_webform_linked 600/990
(3 intermediate revisions by 3 users not shown)
Line 2: {{more citations needed\|date=November 2012}} '''Local ternary patterns''' (LTP) are an extension of [[local binary patterns]] (LBP).<ref>{{Cite journal \|last1=Xiaoyang Tan \|last2=Triggs \|first2=Bill \|date=June 2010 \|title=Enhanced Local Texture Feature Sets for Face Recognition Under Difficult Lighting Conditions ~~\|url=https://ieeexplore.ieee.org/document/5411802~~ \|journal=IEEE Transactions on Image Processing \|volume=19 \|issue=6 \|pages=1635–1650 \|doi=10.1109/TIP.2010.2042645 \|pmid=20172829 \|bibcode=2010ITIP...19.1635T \|issn=1057-7149\|citeseerx=10.1.1.105.3355 }}</ref><ref>{{Cite journal \|last1=Ji \|first1=Luping \|last2=Ren \|first2=Yan \|last3=Pu \|first3=Xiaorong \|last4=Liu \|first4=Guisong \|date=2018-07-01 \|title=Median local ternary patterns optimized with rotation-invariant uniform-three mapping for noisy texture classification ~~\|url=https://ui.adsabs.harvard.edu/abs/2018PatRe..79..387J~~ \|journal=Pattern Recognition \|volume=79 \|pages=387–401 \|doi=10.1016/j.patcog.2018.02.009\|bibcode=2018PatRe..79..387J \|s2cid=13691471 \|doi-access=free }}</ref> Unlike LBP, it does not threshold the pixels into 0 and 1, rather it uses a threshold constant to threshold [[pixel]]s into three values. Considering k as the threshold constant, c as the value of the center pixel, a neighboring pixel p, the result of threshold is: :<math>