|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Computer Science and Engineering >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/1998
|
Full metadata record
| DC Field | Value | Language |
|---|
| contributor.author | Chatterjee, S | - |
| contributor.author | Banerjee, S | - |
| contributor.author | Biswas, K K | - |
| date.accessioned | 2006-07-10T04:27:06Z | - |
| date.available | 2006-07-10T04:27:06Z | - |
| date.issued | 2000 | - |
| identifier.citation | Image Processing, Proceedings International Conference on, 2, 211 - 214p. | en |
| identifier.uri | http://eprint.iitd.ac.in/dspace/handle/2074/1998 | - |
| description.abstract | We suggest a feature based facial image reconstruction technique. The encoding technique utilizes the affine structure of the face to capture the global facial motion. The structure information is transmitted only once at the bootstrapping stage. After that only the motion information for each frame is used to reconstruct the image at the decoder. An attempt is made to perform local reconstruction without any colour patching. For local reconstruction lips are tracked across frames using the snake model. An online database of facial features is created from distinct feature templates. The lip feature in each frame is locally reconstructed from existing templates using local warping. The eye templates for each frame are also recognized and pasted from the online database | en |
| format.extent | 54287 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | en |
| subject | global facial motion | en |
| subject | bootstrapping stage | en |
| subject | tracked across frames | en |
| subject | snake model | en |
| title | Reconstruction of local features for facial video compression | en |
| type | Article | en |
| Appears in Collections: | Computer Science and Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| chatterjeerec2000.pdf | | 53Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|
