Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((SU Ping[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Image labeling based on fully-connected conditional random field
LIU Tong, HUANG Xiutian, MA Jianshe, SU Ping
Journal of Computer Applications 2017, 37 (
10
): 2841-2846. DOI:
10.11772/j.issn.1001-9081.2017.10.2841
Abstract
(
558
)
PDF
(939KB)(
626
)
Knowledge map
Save
The traditional image labeling models often have two deficiencies; they only can model short-range contextual information in pixel-level of the image and have a complicated inference. To improve the precision of image labeling, the fully-connected Conditional Random Field (CRF) model was used; to simplify the inference of the model, the mean filed approximation based on Gaussian kd-tree for inference was proposed. To verify the effectiveness of the proposed algorithm, the experimental image datasets not only contained the standard picture library MSRC-9, but also contained MyDataset_1 (machine parts) and MyDataset_2 (office table) which made by authors. The precisions of the proposed method on those three datasets are 77.96%, 97.15% and 95.35% respectively, and the mean cost time of each picture is 2s. The results indicate that the fully-connected CRF model can improve the precision of image labeling by considering the contextual information of image and the mean field approximation using Gaussian kd-tree can raise the efficiency of inference.
Reference
|
Related Articles
|
Metrics
Select
Palmprint recognition method based on localized non-negative sparse coding
SHANG Li SU Pingang DU Jixiang
Journal of Computer Applications 2011, 31 (
06
): 1609-1612. DOI:
10.3724/SP.J.1087.2011.01609
Abstract
(
1483
)
PDF
(639KB)(
480
)
Knowledge map
Save
To more effectively extract localized features of images, on the basis of the traditional Non-negative Sparse Coding (Hoyer NNSC) algorithm, a novel localized NNSC (LNNSC) algorithm with sparse constraint was proposed. This algorithm considered the sparse measure constraint of feature basis vectors and the maximized representativeness of features, and could obtain the strengthened localized image features. At the same time, this algorithm utilized the Laplace density model as the feature coefficients sparse punitive function to ensure an image's sparse structure. Furthermore, on the basis of feature extraction, by utilizing the Radial Basis Probabilistic Neural Networks (RBPNN), the palmprint recognition task could be implemented automatically. Compared with the palmprint recognition methods of Non-negative Matrix Factorization (NMF), Local NMF (LNMF) and Hoyer-NNSC, simulation results show that our method proposed here displays feasibility and practicality in palmprint recognition.
Related Articles
|
Metrics