Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders
Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Vigneash, L. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2017 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Cluster computing - Springer US, 1998, 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 |
|---|---|
| Übergeordnetes Werk: |
volume:22 ; year:2017 ; number:Suppl 5 ; day:26 ; month:09 ; pages:10669-10677 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10586-017-1155-2 |
|---|
| Katalog-ID: |
OLC2066395668 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2066395668 | ||
| 003 | DE-627 | ||
| 005 | 20230503024958.0 | ||
| 007 | tu | ||
| 008 | 200819s2017 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10586-017-1155-2 |2 doi | |
| 035 | |a (DE-627)OLC2066395668 | ||
| 035 | |a (DE-He213)s10586-017-1155-2-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 54.50$jProgrammierung: Allgemeines |2 bkl | ||
| 084 | |a 54.32$jRechnerkommunikation |2 bkl | ||
| 084 | |a 54.25$jParallele Datenverarbeitung |2 bkl | ||
| 100 | 1 | |a Vigneash, L. |e verfasserin |0 (orcid)0000-0003-3043-630X |4 aut | |
| 245 | 1 | 0 | |a Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders |
| 264 | 1 | |c 2017 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC 2017 | ||
| 520 | |a Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. | ||
| 650 | 4 | |a Motion estimation | |
| 650 | 4 | |a Video compression | |
| 650 | 4 | |a Block matching algorithm (BMA) | |
| 650 | 4 | |a Charged system search (CSS) and Full search algorithm (FSA) | |
| 700 | 1 | |a Marimuthu, C. N. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Cluster computing |d Springer US, 1998 |g 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 |w (DE-627)265187907 |w (DE-600)1465290-0 |w (DE-576)9265187905 |x 1386-7857 |7 nnns |
| 773 | 1 | 8 | |g volume:22 |g year:2017 |g number:Suppl 5 |g day:26 |g month:09 |g pages:10669-10677 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10586-017-1155-2 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 936 | b | k | |a 54.50$jProgrammierung: Allgemeines |q VZ |0 181569876 |0 (DE-625)181569876 |
| 936 | b | k | |a 54.32$jRechnerkommunikation |q VZ |0 10640623X |0 (DE-625)10640623X |
| 936 | b | k | |a 54.25$jParallele Datenverarbeitung |q VZ |0 181569892 |0 (DE-625)181569892 |
| 951 | |a AR | ||
| 952 | |d 22 |j 2017 |e Suppl 5 |b 26 |c 09 |h 10669-10677 | ||
| author_variant |
l v lv c n m cn cnm |
|---|---|
| matchkey_str |
article:13867857:2017----::piiainfoinsiainadaesncagdytmpiiainihopw |
| hierarchy_sort_str |
2017 |
| bklnumber |
54.50$jProgrammierung: Allgemeines 54.32$jRechnerkommunikation 54.25$jParallele Datenverarbeitung |
| publishDate |
2017 |
| allfields |
10.1007/s10586-017-1155-2 doi (DE-627)OLC2066395668 (DE-He213)s10586-017-1155-2-p DE-627 ger DE-627 rakwb eng 004 VZ 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung bkl Vigneash, L. verfasserin (orcid)0000-0003-3043-630X aut Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. Motion estimation Video compression Block matching algorithm (BMA) Charged system search (CSS) and Full search algorithm (FSA) Marimuthu, C. N. aut Enthalten in Cluster computing Springer US, 1998 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 (DE-627)265187907 (DE-600)1465290-0 (DE-576)9265187905 1386-7857 nnns volume:22 year:2017 number:Suppl 5 day:26 month:09 pages:10669-10677 https://doi.org/10.1007/s10586-017-1155-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 54.32$jRechnerkommunikation VZ 10640623X (DE-625)10640623X 54.25$jParallele Datenverarbeitung VZ 181569892 (DE-625)181569892 AR 22 2017 Suppl 5 26 09 10669-10677 |
| spelling |
10.1007/s10586-017-1155-2 doi (DE-627)OLC2066395668 (DE-He213)s10586-017-1155-2-p DE-627 ger DE-627 rakwb eng 004 VZ 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung bkl Vigneash, L. verfasserin (orcid)0000-0003-3043-630X aut Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. Motion estimation Video compression Block matching algorithm (BMA) Charged system search (CSS) and Full search algorithm (FSA) Marimuthu, C. N. aut Enthalten in Cluster computing Springer US, 1998 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 (DE-627)265187907 (DE-600)1465290-0 (DE-576)9265187905 1386-7857 nnns volume:22 year:2017 number:Suppl 5 day:26 month:09 pages:10669-10677 https://doi.org/10.1007/s10586-017-1155-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 54.32$jRechnerkommunikation VZ 10640623X (DE-625)10640623X 54.25$jParallele Datenverarbeitung VZ 181569892 (DE-625)181569892 AR 22 2017 Suppl 5 26 09 10669-10677 |
| allfields_unstemmed |
10.1007/s10586-017-1155-2 doi (DE-627)OLC2066395668 (DE-He213)s10586-017-1155-2-p DE-627 ger DE-627 rakwb eng 004 VZ 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung bkl Vigneash, L. verfasserin (orcid)0000-0003-3043-630X aut Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. Motion estimation Video compression Block matching algorithm (BMA) Charged system search (CSS) and Full search algorithm (FSA) Marimuthu, C. N. aut Enthalten in Cluster computing Springer US, 1998 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 (DE-627)265187907 (DE-600)1465290-0 (DE-576)9265187905 1386-7857 nnns volume:22 year:2017 number:Suppl 5 day:26 month:09 pages:10669-10677 https://doi.org/10.1007/s10586-017-1155-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 54.32$jRechnerkommunikation VZ 10640623X (DE-625)10640623X 54.25$jParallele Datenverarbeitung VZ 181569892 (DE-625)181569892 AR 22 2017 Suppl 5 26 09 10669-10677 |
| allfieldsGer |
10.1007/s10586-017-1155-2 doi (DE-627)OLC2066395668 (DE-He213)s10586-017-1155-2-p DE-627 ger DE-627 rakwb eng 004 VZ 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung bkl Vigneash, L. verfasserin (orcid)0000-0003-3043-630X aut Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. Motion estimation Video compression Block matching algorithm (BMA) Charged system search (CSS) and Full search algorithm (FSA) Marimuthu, C. N. aut Enthalten in Cluster computing Springer US, 1998 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 (DE-627)265187907 (DE-600)1465290-0 (DE-576)9265187905 1386-7857 nnns volume:22 year:2017 number:Suppl 5 day:26 month:09 pages:10669-10677 https://doi.org/10.1007/s10586-017-1155-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 54.32$jRechnerkommunikation VZ 10640623X (DE-625)10640623X 54.25$jParallele Datenverarbeitung VZ 181569892 (DE-625)181569892 AR 22 2017 Suppl 5 26 09 10669-10677 |
| allfieldsSound |
10.1007/s10586-017-1155-2 doi (DE-627)OLC2066395668 (DE-He213)s10586-017-1155-2-p DE-627 ger DE-627 rakwb eng 004 VZ 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung bkl Vigneash, L. verfasserin (orcid)0000-0003-3043-630X aut Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. Motion estimation Video compression Block matching algorithm (BMA) Charged system search (CSS) and Full search algorithm (FSA) Marimuthu, C. N. aut Enthalten in Cluster computing Springer US, 1998 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 (DE-627)265187907 (DE-600)1465290-0 (DE-576)9265187905 1386-7857 nnns volume:22 year:2017 number:Suppl 5 day:26 month:09 pages:10669-10677 https://doi.org/10.1007/s10586-017-1155-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 54.32$jRechnerkommunikation VZ 10640623X (DE-625)10640623X 54.25$jParallele Datenverarbeitung VZ 181569892 (DE-625)181569892 AR 22 2017 Suppl 5 26 09 10669-10677 |
| language |
English |
| source |
Enthalten in Cluster computing 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 volume:22 year:2017 number:Suppl 5 day:26 month:09 pages:10669-10677 |
| sourceStr |
Enthalten in Cluster computing 22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677 volume:22 year:2017 number:Suppl 5 day:26 month:09 pages:10669-10677 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Motion estimation Video compression Block matching algorithm (BMA) Charged system search (CSS) and Full search algorithm (FSA) |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Cluster computing |
| authorswithroles_txt_mv |
Vigneash, L. @@aut@@ Marimuthu, C. N. @@aut@@ |
| publishDateDaySort_date |
2017-09-26T00:00:00Z |
| hierarchy_top_id |
265187907 |
| dewey-sort |
14 |
| id |
OLC2066395668 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2066395668</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503024958.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10586-017-1155-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066395668</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10586-017-1155-2-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.50$jProgrammierung: Allgemeines</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.32$jRechnerkommunikation</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.25$jParallele Datenverarbeitung</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vigneash, L.</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-3043-630X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2017</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Motion estimation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Video compression</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Block matching algorithm (BMA)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Charged system search (CSS) and Full search algorithm (FSA)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marimuthu, C. N.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Cluster computing</subfield><subfield code="d">Springer US, 1998</subfield><subfield code="g">22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677</subfield><subfield code="w">(DE-627)265187907</subfield><subfield code="w">(DE-600)1465290-0</subfield><subfield code="w">(DE-576)9265187905</subfield><subfield code="x">1386-7857</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:22</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:Suppl 5</subfield><subfield code="g">day:26</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:10669-10677</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10586-017-1155-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.50$jProgrammierung: Allgemeines</subfield><subfield code="q">VZ</subfield><subfield code="0">181569876</subfield><subfield code="0">(DE-625)181569876</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.32$jRechnerkommunikation</subfield><subfield code="q">VZ</subfield><subfield code="0">10640623X</subfield><subfield code="0">(DE-625)10640623X</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.25$jParallele Datenverarbeitung</subfield><subfield code="q">VZ</subfield><subfield code="0">181569892</subfield><subfield code="0">(DE-625)181569892</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">22</subfield><subfield code="j">2017</subfield><subfield code="e">Suppl 5</subfield><subfield code="b">26</subfield><subfield code="c">09</subfield><subfield code="h">10669-10677</subfield></datafield></record></collection>
|
| author |
Vigneash, L. |
| spellingShingle |
Vigneash, L. ddc 004 bkl 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung misc Motion estimation misc Video compression misc Block matching algorithm (BMA) misc Charged system search (CSS) and Full search algorithm (FSA) Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders |
| authorStr |
Vigneash, L. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)265187907 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1386-7857 |
| topic_title |
004 VZ 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung bkl Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders Motion estimation Video compression Block matching algorithm (BMA) Charged system search (CSS) and Full search algorithm (FSA) |
| topic |
ddc 004 bkl 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung misc Motion estimation misc Video compression misc Block matching algorithm (BMA) misc Charged system search (CSS) and Full search algorithm (FSA) |
| topic_unstemmed |
ddc 004 bkl 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung misc Motion estimation misc Video compression misc Block matching algorithm (BMA) misc Charged system search (CSS) and Full search algorithm (FSA) |
| topic_browse |
ddc 004 bkl 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung misc Motion estimation misc Video compression misc Block matching algorithm (BMA) misc Charged system search (CSS) and Full search algorithm (FSA) |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Cluster computing |
| hierarchy_parent_id |
265187907 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Cluster computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)265187907 (DE-600)1465290-0 (DE-576)9265187905 |
| title |
Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders |
| ctrlnum |
(DE-627)OLC2066395668 (DE-He213)s10586-017-1155-2-p |
| title_full |
Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders |
| author_sort |
Vigneash, L. |
| journal |
Cluster computing |
| journalStr |
Cluster computing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
txt |
| container_start_page |
10669 |
| author_browse |
Vigneash, L. Marimuthu, C. N. |
| container_volume |
22 |
| class |
004 VZ 54.50$jProgrammierung: Allgemeines bkl 54.32$jRechnerkommunikation bkl 54.25$jParallele Datenverarbeitung bkl |
| format_se |
Aufsätze |
| author-letter |
Vigneash, L. |
| doi_str_mv |
10.1007/s10586-017-1155-2 |
| normlink |
(ORCID)0000-0003-3043-630X 181569876 10640623X 181569892 |
| normlink_prefix_str_mv |
(orcid)0000-0003-3043-630X 181569876 (DE-625)181569876 10640623X (DE-625)10640623X 181569892 (DE-625)181569892 |
| dewey-full |
004 |
| title_sort |
optimization of motion estimation hardware using charged system optimization with low power multipliers for h.264 encoders |
| title_auth |
Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders |
| abstract |
Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. © Springer Science+Business Media, LLC 2017 |
| abstractGer |
Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. © Springer Science+Business Media, LLC 2017 |
| abstract_unstemmed |
Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance. © Springer Science+Business Media, LLC 2017 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
Suppl 5 |
| title_short |
Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders |
| url |
https://doi.org/10.1007/s10586-017-1155-2 |
| remote_bool |
false |
| author2 |
Marimuthu, C. N. |
| author2Str |
Marimuthu, C. N. |
| ppnlink |
265187907 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10586-017-1155-2 |
| up_date |
2024-07-04T04:26:28.444Z |
| _version_ |
1803621172188807168 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2066395668</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503024958.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10586-017-1155-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066395668</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10586-017-1155-2-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.50$jProgrammierung: Allgemeines</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.32$jRechnerkommunikation</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.25$jParallele Datenverarbeitung</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vigneash, L.</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-3043-630X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimization of motion estimation hardware using charged system optimization with low power multipliers for H.264 encoders</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2017</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Motion estimation has a critical role to play in the transmission and compression of digital video. As it has a complexity in terms of computation that is inherent it is a big challenge for the implementation of real time codes. Recently there have been studies on block matching algorithms (BMA) for bringing down the complexity in the computation and has also got better attention in many algorithms that are very effective for very large scale integration (VLSI) systems for bringing down the complexity. These BMA algorithms are relatively easy to implement which can give solutions that are suboptimal even if the entire search has not been performed. The entire search is high in terms of cost of computation that prevents it from being applied in the systems of VLSI. A novel and fast motion estimation based algorithm known as charged system search (CSS) and full search algorithm (FSA) for multipliers of low power and for H.264 encoders is proposed. The CSS is used in all fields of optimization and is well suited for most domains and does not require any gradient information. The results have proved that proposed FSA has better performance.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Motion estimation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Video compression</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Block matching algorithm (BMA)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Charged system search (CSS) and Full search algorithm (FSA)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marimuthu, C. N.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Cluster computing</subfield><subfield code="d">Springer US, 1998</subfield><subfield code="g">22(2017), Suppl 5 vom: 26. Sept., Seite 10669-10677</subfield><subfield code="w">(DE-627)265187907</subfield><subfield code="w">(DE-600)1465290-0</subfield><subfield code="w">(DE-576)9265187905</subfield><subfield code="x">1386-7857</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:22</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:Suppl 5</subfield><subfield code="g">day:26</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:10669-10677</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10586-017-1155-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.50$jProgrammierung: Allgemeines</subfield><subfield code="q">VZ</subfield><subfield code="0">181569876</subfield><subfield code="0">(DE-625)181569876</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.32$jRechnerkommunikation</subfield><subfield code="q">VZ</subfield><subfield code="0">10640623X</subfield><subfield code="0">(DE-625)10640623X</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.25$jParallele Datenverarbeitung</subfield><subfield code="q">VZ</subfield><subfield code="0">181569892</subfield><subfield code="0">(DE-625)181569892</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">22</subfield><subfield code="j">2017</subfield><subfield code="e">Suppl 5</subfield><subfield code="b">26</subfield><subfield code="c">09</subfield><subfield code="h">10669-10677</subfield></datafield></record></collection>
|
| score |
7.400687 |