Click to open the HelpDesk interface
AECE - Front page banner



JCR Impact Factor: 0.699
JCR 5-Year IF: 0.674
Issues per year: 4
Current issue: May 2018
Next issue: Aug 2018
Avg review time: 106 days


Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


1,987,800 unique visits
Since November 1, 2009

No robots online now


SCImago Journal & Country Rank

SEARCH ENGINES - Google Pagerank


Anycast DNS Hosting

 Volume 18 (2018)
     »   Issue 2 / 2018
     »   Issue 1 / 2018
 Volume 17 (2017)
     »   Issue 4 / 2017
     »   Issue 3 / 2017
     »   Issue 2 / 2017
     »   Issue 1 / 2017
 Volume 16 (2016)
     »   Issue 4 / 2016
     »   Issue 3 / 2016
     »   Issue 2 / 2016
     »   Issue 1 / 2016
 Volume 15 (2015)
     »   Issue 4 / 2015
     »   Issue 3 / 2015
     »   Issue 2 / 2015
     »   Issue 1 / 2015
  View all issues  


Clarivate Analytics published the InCites Journal Citations Report for 2017. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.699, and the JCR 5-Year Impact Factor is 0.674.

Thomson Reuters published the Journal Citations Report for 2016. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.595, and the JCR 5-Year Impact Factor is 0.661.

With new technologies, such as mobile communications, internet of things, and wide applications of social media, organizations generate a huge volume of data, much faster than several years ago. Big data, characterized by high volume, diversity and velocity, increasingly drives decision making and is changing the landscape of business intelligence, from governments to private organizations, from communities to individuals. Big data analytics that discover insights from evidences has a high demand for computing efficiency, knowledge discovery, problem solving, and event prediction. We dedicate a special section of Issue 4/2017 to Big Data. Prospective authors are asked to make the submissions for this section no later than the 31st of May 2017, placing "BigData - " before the paper title in OpenConf.

Read More »


  4/2012 - 4

Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA)

VASIC, B. See more information about VASIC, B. on SCOPUS See more information about VASIC, B. on IEEExplore See more information about VASIC, B. on Web of Science
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,170 KB) | Citation | Downloads: 344 | Views: 2,433

Author keywords
3D shape, curvature estimation, discrete geometry, mesh optimization, vertex extraction

References keywords
graphics(10), simplification(6), siggraph(6), techniques(5), interactive(5), geometry(5), surfaces(4), surface(4), polygonal(4), mesh(4)
No common words between the references section and the paper title.

About this article
Date of Publication: 2012-11-30
Volume 12, Issue 4, Year 2012, On page(s): 25 - 32
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2012.04004
Web of Science Accession Number: 000312128400004
SCOPUS ID: 84872815537

Quick view
Full text preview
We propose an algorithm for identifying vertices from three dimensional (3D) meshes that are most important for a geometric shape creation. Extracting such a set of vertices from a 3D mesh is important in applications such as digital watermarking, but also as a component of optimization and triangulation. In the first step, the Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA) estimates precisely the local curvature, and most important topological features of mesh geometry. Using the vertex geometric importance ranking, the algorithm traces and extracts a vector of vertices, ordered by decreasing index of importance.

References | Cited By

Cited-By ISI Web of Science

Web of Science® Times Cited: 4 [View]
View record in Web of Science® [View]
View Related Records® [View]

Updated today

Cited-By CrossRef

SCOPUS® Times Cited: 5
View record in SCOPUS®
[Free preview]

Updated today

Cited-By CrossRef

[1] A zero-watermarking scheme for three-dimensional mesh models based on multi-features, Wang, Xinyu, Zhan, Yongzhao, Multimedia Tools and Applications, ISSN 1380-7501, 2017.
Digital Object Identifier: 10.1007/s11042-017-4666-1

[2] Simplification Resilient LDPC-Coded Sparse-QIM Watermarking for 3D-Meshes, Vasic, Bata, Vasic, Bane, IEEE Transactions on Multimedia, ISSN 1520-9210, Issue 7, Volume 15, 2013.
Digital Object Identifier: 10.1109/TMM.2013.2265673

[3] Annotation of cultural heritage 3-D models by robust data embedding in the object mesh, Vasic, Bata, 2014 22nd Telecommunications Forum Telfor (TELFOR), ISBN 978-1-4799-6191-7, 2014.
Digital Object Identifier: 10.1109/TELFOR.2014.7034538

[4] Blind and robust 3D mesh watermarks, Vasic, Bata, Dordevic, Goran T., Vasic, Bane, 2013 21st Telecommunications Forum Telfor (TELFOR), ISBN 978-1-4799-1420-3, 2013.
Digital Object Identifier: 10.1109/TELFOR.2013.6716338

[5] New content based forensic metrics for judicial disputes concerning the graphic symbols similarity, Vasic, Bata, 2013 11th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services (TELSIKS), ISBN 978-1-4799-0902-5, 2013.
Digital Object Identifier: 10.1109/TELSKS.2013.6704944

[6] 3-D mesh vertex extraction by statistical assessment of geometric importance, Vasic, Bata, 2012 20th Telecommunications Forum (TELFOR), ISBN 978-1-4673-2984-2, 2012.
Digital Object Identifier: 10.1109/TELFOR.2012.6419450

[7] Blind QIM-LDPC watermarking of 3D-meshes, Vasic, Bata, Vasic, Bane, 2013 IEEE International Conference on Communications Workshops (ICC), ISBN 978-1-4673-5753-1, 2013.
Digital Object Identifier: 10.1109/ICCW.2013.6649324

Updated today

Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.

Web of Science® is a registered trademark of Clarivate Analytics, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.

Copyright ©2001-2018
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania

All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.

Website loading speed and performance optimization powered by: