Coding efficiency of multiring differential chain coding

1992 ◽  
Vol 139 (2) ◽  
pp. 224 ◽  
Author(s):  
A.B. Johannessen ◽  
R. Prasad ◽  
N.B.J. Weyland ◽  
J.H. Bons
Keyword(s):  
Coding Efficiency ◽  
Chain Coding

scholarly journals Role-reference associations and the explanation of argument coding splits

Linguistics ◽  
2020 ◽  
Vol 59 (1) ◽  
pp. 123-174
Author(s):  
Martin Haspelmath
Keyword(s):  
Language Use ◽  
General Pattern ◽  
General Level ◽  
Full Generality ◽  
Coding Efficiency ◽  
Object Marking ◽  
Case Markers ◽  
Ditransitive Constructions

Abstract Argument coding splits such as differential (= split) object marking and split ergative marking have long been known to be universal tendencies, but the generalizations have not been formulated in their full generality before. In particular, ditransitive constructions have rarely been taken into account, and scenario splits have often been treated separately. Here I argue that all these patterns can be understood in terms of the usual association of role rank (highly ranked A and R, low-ranked P and T) and referential prominence (locuphoric person, animacy, definiteness, etc.). At the most general level, the role-reference association universal says that deviations from usual associations of role rank and referential prominence tend to be coded by longer grammatical forms. In other words, A and R tend to be referentially prominent in language use, while P and T are less prominent, and when less usual associations need to be expressed, languages often require special coding by means of additional flags (case-markers and adpositions) or additional verbal voice coding (e.g., inverse or passive markers). I argue that role-reference associations are an instance of the even more general pattern of form-frequency correspondences, and that the resulting coding asymmetries can all be explained by frequency-based predictability and coding efficiency.

scholarly journals Automatic Detection of Pulmonary Nodules using Three-dimensional Chain Coding and Optimized Random Forest

2020 ◽  
Vol 10 (7) ◽  
pp. 2346 ◽  
Author(s):  
May Phu Paing ◽  
Kazuhiko Hamamoto ◽  
Supan Tungjitkusolmun ◽  
Sarinporn Visitsattapongse ◽  
Chuchart Pintavirooj
Keyword(s):  
Random Forest ◽  
Three Dimensional ◽  
Pulmonary Nodules ◽  
Region Growing ◽  
Favorable Result ◽  
Dimensional Chain ◽  
Chain Code ◽  
Seeded Region Growing ◽  
Chain Coding ◽  
Diagnosis Of Lung Cancer

The detection of pulmonary nodules on computed tomography scans provides a clue for the early diagnosis of lung cancer. Manual detection mandates a heavy radiological workload as it identifies nodules slice-by-slice. This paper presents a fully automated nodule detection with three significant contributions. First, an automated seeded region growing is designed to segment the lung regions from the tomography scans. Second, a three-dimensional chain code algorithm is implemented to refine the border of the segmented lungs. Lastly, nodules inside the lungs are detected using an optimized random forest classifier. The experiments for our proposed detection are conducted using 888 scans from a public dataset, and achieves a favorable result of 93.11% accuracy, 94.86% sensitivity, and 91.37% specificity, with only 0.0863 false positives per exam.

Chain coding representation of voxel-based objects with enclosing, edging and intersecting trees

2016 ◽  
Vol 20 (3) ◽  
pp. 825-844 ◽  
Author(s):  
Luis A. Martínez ◽  
Ernesto Bribiesca ◽  
Adolfo Guzmán
Keyword(s):  
Chain Coding

scholarly journals Variability and coding efficiency of noisy neural spike encoders

Biosystems ◽  
2001 ◽  
Vol 62 (1-3) ◽  
pp. 87-97 ◽  
Author(s):  
Peter N. Steinmetz ◽  
Amit Manwani ◽  
Christof Koch
Keyword(s):  
Coding Efficiency ◽  
Neural Spike
Sign in / Sign up

Export Citation Format

Share Document