DISTRIBUTED AGREEMENT BASED ML APPROXIMATION

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MOHAMADI MOHAMAD; PARVIN HAMID; FARAJI ESHAGH; PARVIN SAJAD

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2016 | Volume:7 | Issue:4 (26) Page(s): 67-78

Download Full-Text

View:

3,387

Download:

Cites:

Information Journal Paper

Title

DISTRIBUTED AGREEMENT BASED ML APPROXIMATION

Author(s)

MOHAMADI MOHAMAD | PARVIN HAMID | FARAJI ESHAGH | PARVIN SAJAD | Issue Writer Certificate

Keywords

MAXIMUM LIKELIHOOD APPROXIMATION

DATA FUSION

CONSENSUS ALGORITHM

HOMOGRAPHY

Abstract

In this manuscript we suggest a fast adaptive distributed method for MAXIMUM LIKELIHOOD APPROXIMATION (MLA) in multiple view object localization problem. For this purpose, we use "up to scale" property of projective geometry and by defining coefficients for convergence criterion, we increase the convergence speed of the CONSENSUS ALGORITHM. We try to present a mathematical model for the problem. We use two types of error function. The proposed method uses maximum likelihood for obtaining its best parameters. Our approach utilizes "up to scale" property in projective geometry to reach the consensus quickly. The difference between nodes' values and meanwhile consensus values are evaluated by two error functions. To estimate consensus value in the second error function, we used local weighted average of each node. At the last of the paper, we prove our claims by experimental results.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

MOHAMADI, MOHAMAD, PARVIN, HAMID, FARAJI, ESHAGH, & PARVIN, SAJAD. (2016). DISTRIBUTED AGREEMENT BASED ML APPROXIMATION. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 7(4 (26)), 67-78. SID. https://sid.ir/paper/328855/en

Vancouver: Copy

MOHAMADI MOHAMAD, PARVIN HAMID, FARAJI ESHAGH, PARVIN SAJAD. DISTRIBUTED AGREEMENT BASED ML APPROXIMATION. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2016;7(4 (26)):67-78. Available from: https://sid.ir/paper/328855/en

IEEE: Copy

MOHAMAD MOHAMADI, HAMID PARVIN, ESHAGH FARAJI, and SAJAD PARVIN, “DISTRIBUTED AGREEMENT BASED ML APPROXIMATION,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 7, no. 4 (26), pp. 67–78, 2016, [Online]. Available: https://sid.ir/paper/328855/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops