Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3A3EFJB
Repositorysid.inpe.br/sibgrapi/2011/07.09.15.15
Last Update2011:07.09.15.15.16 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2011/07.09.15.15.16
Metadata Last Update2022:06.14.00.07.12 (UTC) administrator
DOI10.1109/SIBGRAPI.2011.42
Citation KeyNobleSchAgoAraLam:2011:TwNoAl
TitleTwo Novel Algorithms for High Quality Motion Estimation in High Definition Video Sequences
FormatDVD, On-line.
Year2011
Access Date2024, Apr. 18
Number of Files1
Size267 KiB
2. Context
Author1 Noble, Diego Vrague
2 Schiavon Porto, Marcelo
3 Agostini, Luciano Volcan
4 Araújo, Ricardo Matsumura
5 Lamb, Luis da Cunha
Affiliation1 Federal University of Rio Grande do Sul
2 Federal University of Pelotas
3 Federal University of Pelotas
4 Federal University of Pelotas
5 Federal University of Rio Grande do Sul
EditorLewiner, Thomas
Torres, Ricardo
e-Mail Addressdiegovnoble@gmail.com
Conference NameConference on Graphics, Patterns and Images, 24 (SIBGRAPI)
Conference LocationMaceió, AL, Brazil
Date28-31 Aug. 2011
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2011-07-23 15:36:12 :: diegovnoble@gmail.com -> administrator :: 2011
2022-06-14 00:07:12 :: administrator -> :: 2011
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsmotion estimation
video coding
high definition
AbstractIn this paper, we propose two new algorithms for high quality motion estimation in high definition digital videos. Both algorithms are based on the use of random features that guarantee robustness to avoid dropping into a local-minimum. The first algorithm was developed from a simple two stage approach where a random stage is complemented by a greedy stage in a very simple fashion. The second algorithm is based on a more refined class of algorithms called Memetic Network Algorithms where each instance of the search may exchange information with its neighbour instances according to some rules that control the information flow. The proposed algorithms were implemented and tested exclusively with high definition sequences against well known fast algorithms like Diamond Search and Three Step Search. The results show that our algorithms can outperform other algorithms in quality yielding an increment in complexity that may be amortized if resources for a parallel execution are available. Additionally, we provide further evidence that fast algorithms do not perform well in high definition.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2011 > Two Novel Algorithms...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Two Novel Algorithms...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 09/07/2011 12:15 0.5 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3A3EFJB
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3A3EFJB
Languageen
Target File87108_2.pdf
User Groupdiegovnoble@gmail.com
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SKNPE
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.00.56 6
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close